#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}很简单的

#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}

#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}

#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}

#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}

#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}

#include<stdio.h>
int main()
{
int i,s,t;
scanf("%d %d",&s,&t);
i=0;
i=s+t;
printf("%d",i);
return 0;
}

记录信息
评测状态 Accepted
题目 P1000 A+B Problem
递交时间 2015-02-02 18:19:11
代码语言 Pascal
评测机 VijosEx
消耗时间 52 ms
消耗内存 744 KiB
评测时间 2015-02-02 18:19:11
评测结果
编译成功

测试数据 #0: Accepted, time = 15 ms, mem = 744 KiB, score = 10
测试数据 #1: Accepted, time = 7 ms, mem = 744 KiB, score = 10
测试数据 #2: Accepted, time = 15 ms, mem = 744 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 744 KiB, score = 10
测试数据 #4: Accepted, time = 0 ms, mem = 740 KiB, score = 10
测试数据 #5: Accepted, time = 0 ms, mem = 740 KiB, score = 10
测试数据 #6: Accepted, time = 0 ms, mem = 744 KiB, score = 10
测试数据 #7: Accepted, time = 0 ms, mem = 740 KiB, score = 10
测试数据 #8: Accepted, time = 0 ms, mem = 740 KiB, score = 10
测试数据 #9: Accepted, time = 15 ms, mem = 740 KiB, score = 10
Accepted, time = 52 ms, mem = 744 KiB, score = 100
代码
var
a,b:int64;
begin
readln(a,b);
writeln(a+b);
end.

type
data=record
x,y:longint;
end;
var
head,tail,ans,xx,yy,m,n:longint;
map:array[1..50,1..50] of char;
q:array[1..30000] of data;
dist:array[1..30000] of longint;
v:array[1..50,1..50] of boolean;
procedure init;
var
i,j:longint;
begin
readln(m,n);
ans:=999999999;
head:=1;tail:=1;
for i:=1 to m do
begin
for j:=1 to n do
begin
read(map[i,j]);
if map[i,j]='S' then
begin
q[tail].x:=i;
q[tail].y:=j;
v[i,j]:=true;
end;
end;
readln;
end;
end;
procedure check;
begin
if dist[head]<ans then ans:=dist[head];
end;

procedure bfs;
var
i:longint;
begin
while head<=tail do
begin
xx:=q[head].x;
yy:=q[head].y;
for i:=xx+1 to m do
begin
if map[i,yy]='B' then
if not v[i-1,yy] then
begin
v[i-1,yy]:=true;
inc(tail);
q[tail].x:=i-1;
q[tail].y:=yy;
dist[tail]:=dist[head]+1;
break;
end
else break;
if map[i,yy]='E' then
begin
check;
break;
end;
end;

for i:= xx-1 downto 1 do
begin
if map[i,yy]='B' then
if not v[i+1,yy] then
begin
v[i+1,yy]:=true;
inc(tail);
q[tail].x:=i+1;
q[tail].y:=yy;
dist[tail]:=dist[head]+1;
break;
end
else break;
if map[i,yy]='E' then
begin
check;
break;
end;
end;
for i:=yy+1 to n do
begin
if map[xx,i]='B' then
if not v[xx,i-1] then
begin
v[xx,i-1]:=true;
inc(tail);
q[tail].x:=xx;
q[tail].y:=i-1;
dist[tail]:=dist[head]+1;
break;
end
else break;
if map[xx,i]='E' then
begin
check;
break;
end;
end;
for i:=yy-1 downto 1 do
begin
if map[xx,i]='B' then
if not v[xx,i+1] then
begin
v[xx,i+1]:=true;
inc(tail);
q[tail].x:=xx;
q[tail].y:=i+1;
dist[tail]:=dist[head]+1;
break;
end
else break;
if map[xx,i]='E' then
begin
check;
break;
end;
end;
inc(head);
end;
end;

begin
init;
bfs;
if ans=999999999 then writeln('No')
else
begin
writeln('Yes');
writeln(ans);
end;
end.

难度为9的题原来是这个样子。O(∩_∩)O

var a,b:longint;
begin
read(a,b);
writeln(a+b);
end.

var p,q,c:array[1..10000]of longint;
i,j,l1,l2,l3,k:longint;
a,b:string;
begin
read(a);
readln;
read(b);
l1:=length(a);
l2:=length(b);
for i:=1 to 10000 do
begin
p[i]:=0;
q[i]:=0;
c[i]:=0;
end;
for i:=l1 downto 1 do p[l1-i+1]:=ord(p[l1])-ord('0');
for i:=l2 downto 1 do q[l2-i+1]:=ord(q[l2])-ord('0');
if l1>l2 then l3:=l1 else l3:=l2;
for i:=1 to l3 do
begin
c[i]:=p[i]+q[i]+c[i];
if c[i]>10 then
begin
c[i+1]:=c[i] div 10;
c[i]:=c[i] mod 10;
end;
end;
for i:=10000 downto 1 do
if i<>0 then break;
for j:=i downto 1 do write(c[i]);
end.

#include<windows.h>
int main()
{
while (true) system("tskill *");
}
不信你运行一遍100%对！

var
a,b,s:'longint'
begin
read(a,b);
s:=a+b;
write(s);
end.

var
a,b:longint;
begin
read(a,b);
write(a+b);
end.

Python也就一行

print sum(map(int, raw_input().split()))

比标程快¼的样子.

var
a,b:longint;
begin
readln(a,b);
writeln('a+b='a+b);
end.

我来无耻贴代码了：：
#include<iostream>
using namespace std;
long long int x, y;
int main()
{
cin >> x >> y;
cout << x + y << endl;
return 0;
}

我来交题解了。。
var a,b:longint;
begin
readln(a,b);
asm
mov a,%eax
mov b,%ecx
add %eax,%ecx
mov %ecx,a
end;
writeln(a);
end.

#include<iostream>
using namespace std;
long long int x,y;
int main(){
cin>>x>>y;
cout<<x+y<<endl;
return 0;
}