1 条题解
-
0
C :
#include<stdio.h> #include<stdlib.h> void main() { int max( int,int ); int ( *pf )( ); int a,b,c; pf=max; scanf("%d%d",&a,&b); c=(*pf)(a,b); printf("%d\n",c); } int max (int x,int y) { return (x>y)?x:y; }
C++ :
#include <stdio.h> int main() { int a, b, c; int max(int, int); int (*p)(int, int); p = max; scanf("%d %d", &a, &b); c = (*p)(a, b); printf("%d\n", c); return 0; } int max(int x, int y) { if (x > y) return x; else return y; }
Pascal :
var a,b:longint; begin read(a,b); if a>b then write(a) else write(b); end.
Java :
import java.util.Scanner; public class Main { private static Scanner s = new Scanner(System.in) ; public static void main(String[] args) { int a = s.nextInt() ; int b = s.nextInt() ; int temp = 0 ; if(a<b){ temp = a ; a = b ; b = temp ; } System.out.println(a) ; } }
Python :
def a(b,c): return max(int(b),int(c)) b,c = raw_input().split() print a(b,c)
- 1
信息
- ID
- 1354
- 时间
- 1000ms
- 内存
- 32MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者