var

a,b,c:longint;

begin

randomize;

readln(a,b);

repeat

c:=random(32767*2+1);

until c=a+b;

writeln(c);

end.

这样…………也能过…………

v

a

r

a

,

b

:

i

n

t

6

4

;

b

e

g

i

n

r

e

a

d

l

n

(

a

,

b

)

;

w

r

i

t

e

(

a

+

b

)

;

e

n

d

.

program Plus;

var a,b:longint;

begin

readln(a,b);

writeln(a+b);

end.

program ex01;

var

a,b,c:integer;

begin

readln(a,b);

c:=a+b;

writeln(c);

end.

#include

int main()

{

int a,b;

scanf("%d,%d",&a,&b);

printf("\n%d",a+b);

return 0;

}

#include

int main()

{

int a,b;

scanf("%d %d",&a,&b);

printf("\n%d",a+b);

return 0;

}

program aa;

var x,y,z:longint;

begin

read(x,y);

z:=x+y;

write(z);

end.

program Ltr;

const maxn=52;

type gjd=record l:integer;nu:array[0..maxn] of longint;end;

var i,j,k,m,n,s,tmp,tp1,tp2,ii:longint;

st,st1:string;

a,b,c:gjd;

procedure myget(var x:gjd);

begin

readln(st);

tmp:=length(st);

tp2:=3-(tmp-1) mod 4;

st1:='';

for i:=1 to tp2 do st1:=st1+'0';

st:=st1+st;

inc(tmp,tp2);

tp1:=tmp div 4;

x.l:=tp1;

j:=tmp-3;

with x do

for i:=1 to tp1 do begin

val(copy(st,j,4),nu[i]);

dec(j,4);

end;

end;

procedure myplus(var x,y,z:gjd);

begin

tmp:=x.l;tp1:=y.l;

if tmp9999 then begin

dec(z.nu[i],10000);

inc(z.nu);

end;

end;

if z.nu[tmp+1]>0 then inc(tmp);

z.l:=tmp;

end;

procedure myprint(var x:gjd);

begin

with x do begin

write(nu[l]);

tmp:=l-1;

for i:=tmp downto 1 do begin

tp1:=nu[i];

if tp1

var

x,y:integer;

begin

read(x,y);

writeln(x+y);

end.

#include

using namespace std;

int main(){

int a,b;

cin>>a>>b;

cout

program xl1;

var a,b:longint;

begin

read(a,b);

write(a+b);

end.

program asa;

var

a,b:integer;

begin

read(a,b);

writeln(a+b);

end.

好裸的网络流模型，SAP+GAP+当前弧一次AC

const

maxn=100000;

maxm=400000;

var

fir,e,g,next:array [1..maxm] of longint;

d,vd:array [0..maxn] of longint;

n,m,u,v,i,ans,mm,k,num,total,n1,n2:longint;

flag:boolean;

function min(a,b:longint):longint;

begin

if a0 do

begin

v:=e[k];

if (g[k]>0)and(d>d[v]) then

begin

low:=dfs(v,min(g[k],flow-dfs));

dec(g[k],low);

if odd(k) then inc(g[k+1],low)

else inc(g[k-1],low);

inc(dfs,low);

if dfs=flow then exit

end;

k:=next[k]

end;

dec(vd[d]);

if vd[d]=0

then flag:=false;

inc(d);

inc(vd[d])

end;

procedure addedge(u,v,gx:longint);

begin

inc(mm);

e[mm]:=v;g[mm]:=gx;

next[mm]:=fir;

fir:=mm

end;

procedure build(u,v,gx:longint);

begin

addedge(u,v,gx);

addedge(v,u,0)

end;

begin

n:=2;

m:=1;

readln(n1,n2);

addedge(1,2,n1+n2);

vd[0]:=n;

flag:=true;

ans:=0;

while flag do

inc(ans,dfs(1,maxlongint));

writeln(ans);

end.

program a+b problem;

var

q,a,z:integer;

begin

a:=123;

b:=500;

c:=a+b;

write(c);

end.

var

a,b,c:integer;

begin

read(a,b);

c:=a+b;

write(c);

end.

program p1000;

var

x,y,z:integer;

begin

readln(x,y);

z:=x+y;

writeln(z);

end.

program ab;

var

a,b,c:real;

begin

readln(a,b);

c:=a+b;

writeln(c);

end.

program ab;

var

a,b,c:real;

begin

readln(a,b);

c:=a+b;

writeln(c);

end.

应该要用for循环吧

Program abi(input,output);

var

a,b,c:integer;

begin

read(a,b);

c:=a+b;

write(c);

end.