#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e8 + 10;
int n, a[MAXN];
int check() {
for (int i = 1;i < n; i++) if(a[i] > a[i + 1]) return 0;
return 1;
}
int main() {
n = 2;
for (int i = 1;i <= n; i++) scanf("%d", &a[i]);
while (1) {
random_shuffle(a + 1, a + 1 + n);
if(check()) break;
}
int ans = 0;
for (int i = 1;i <= n; i++) ans += a[i]; printf("%d", ans);
return 0;
}
Python
s=input().split()
print(int(s[0])+int(s[1]))
Java(注意一本通不支持,100%编译错误,可以洛谷)
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int a=in.nextInt();
int b=in.nextInt();
System.out.println(a+b);
}
}
Pascal
program SumOfTwoIntegers;
var
a, b, sum: integer;
begin
readln(a, b);
sum := a + b;
writeln(sum);
end.