1329 条题解
-
-1
核糖核酸 LV 8 @ 2016-07-24 15:45:29
print(sum([int(x) for x in raw_input().split(' ')])) -
-1@ 2016-07-24 15:45:16
print(sum([int(x) for x in raw_input().split(' ')]))
-
-1@ 2016-07-12 11:46:17
c++ #include<cstdio> #include<iostream> #include<cmath> #include<cstring> using namespace std; int a[1000],b[1000],c[1000];char ch[1000]; int k; void plus_(){ int temp=0; for(int i = 1; i <= c[0]; i++){ c[i]=temp+(a[i]+b[i])%k; temp=(a[i]+b[i])/k; } if((a[a[0]]+b[b[0]])/k>0){ a[0]++; b[0]++; c[a[0]]=temp; c[0]=a[0]; } } void init(){ cin>>k; cin>>ch; c[0]=strlen(ch); for(int i = 0; i < c[0]; i++){ if(ch[i]<='9'&&ch[i]>='0'){ c[c[0]-i]=ch[i]-'0'; } else{ c[c[0]-i]=ch[i]-'A'+11; } } } int main(){ int flag=0; init(); int ii; for(ii = 1; ii <= 30 &&flag==0; ii++){ b[0]=c[0]; a[0]=c[0]; for(int i = 1; i <= c[0]; i++){ a[i]=c[i]; b[i]=c[c[0]-i+1]; } plus_(); for(int i = 1; i <= c[0]; i++){ if(a[i]==b[i]){ flag=1; } else{ flag=0; break; } } } if(flag==1)cout<<"STEP="<<ii-2; else cout<<"Impossible!"; return 0; } -
-1@ 2016-07-04 19:30:26
#include<stdio.h>
int main()
{
int a,b;
int sum;
scanf("%d %d",&a,&b);
sum=a+b;
printf("%d",sum);
} -
-1@ 2016-06-20 11:36:50
program ex1_1;
var a,b,c:real;
begin
read(a,b);
c:=a+b;
writeln('c=',c);
end. -
-1@ 2016-06-04 17:02:32
var
a,b:integer;
begin
readln(a,b);
writeln(a+b);
end.
这题“太难了”!!! -
-1@ 2016-05-17 12:58:45
var a,b;
begin
read(a,b);
inc(a,b);
write(a);
end. -
-1@ 2016-05-11 21:10:46
我要在这里练一下
A+B Problem题解
##**最简单**的做法!
附上:度娘传送门
太简单啦!
话说代码高亮好像**不支持Java!!!**
我要试一下
java
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner in=new Scanner(System.in);//新建扫描仪(其实就是输入用的啦)
int a=in.nextInt(),b=in.nextInt();//使用刚刚新建的扫描仪来输入加数
int ans=a+b;//这一个全国通用......
System.out.println(ans);//输出不解释......
}
}
现在看来话说好像**支持Java啊** -
-1@ 2015-10-23 19:38:09
var
a,b:integer;
begin
read(a,b);
writeln(a+b);
end. -
-1@ 2015-10-18 21:13:47
var
a,b:integer;
begin
readln(a,b);
writeln(a+b);
end. -
-1@ 2015-10-18 20:35:09
var
a,b:integer;
begin
readln(a,b);
writeln(a+b);
end. -
-1@ 2015-10-18 09:09:06
#include<stdio.h>
main()
{
int a,b;
scanf("%d %d",&a,&b);
printf("%d",a+b);
return 0;
} -
-1@ 2015-10-02 14:55:20
谁会做啊!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
-
-1@ 2015-10-02 14:55:03
太难了,我想了好长好长好长一段时间,太难了,不会做,难度是九啊,多学学高级知识才能做,太难了
-
-1@ 2015-09-29 13:34:03
#include<cstdio>
using namespace std;
int main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a+b);
return 0;
}
史上最好,最完美,最厉害,最纯真,最无敌,最安全,最ac的题解 -
-1@ 2015-09-27 16:09:30
被坑了!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!不是高精度加法!!!!!!!!!!!!!太简单了!!!!!!!!!!!!!!!!!!!!!!111
-
-1@ 2015-09-25 21:21:18
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
} -
-1@ 2015-09-16 20:14:34
var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end.
PACAL算法!。 -
-1@ 2015-09-12 15:20:32
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
return 0;
} -
-1@ 2015-08-14 11:35:15
AC
#include <cstdio>
int main()
{
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a + b);
return 0;
}
信息
- ID
- 1000
- 难度
- 9
- 分类
- (无)
- 标签
- (无)
- 递交数
- 75095
- 已通过
- 28724
- 通过率
- 38%
- 被复制
- 261