program dfas;

var a,b,c:real;

begin;

read(a,b);

c:a+b;

write('c=',c);

end

program ex221;

var a,b,c:real;

begin;

read(a,b);

c:=a+b;

write('c=',c);

end.

大牛们都用网络流做啊 orz orz orz

program ex001;

var x,y,z:longint;

begin;

read (x,y);

z:=x+y;

write('z=',z);

end.

编译通过...

├ 测试数据 01：答案正确... 744ms

├ 测试数据 02：答案正确... 697ms

├ 测试数据 03：答案正确... 666ms

├ 测试数据 04：答案正确... 681ms

├ 测试数据 05：答案正确... 666ms

├ 测试数据 06：答案正确... 712ms

├ 测试数据 07：答案正确... 681ms

├ 测试数据 08：答案正确... 697ms

├ 测试数据 09：答案正确... 666ms

├ 测试数据 10：答案正确... 728ms

---|---|---|---|---|---|---|---|-

Accepted 有效得分：100 有效耗时：6938ms

为什么我那么慢啊.各位用什么方法做的啊,dfs+优化不能秒杀我试试dp做.

从新开放~

莫大的鼓舞~

Orz……

oh

被删了啊

悼念中

program lx;

var

a,b:integer;

begin

readln(a,b);

write(a+b);

end.

var a,b:integer;

begin

read(a,b);

writeln(a+b);

end.

program cc;

var

a,b,c:integer;

begin

readln(a);

readln(b);

writeln(c:=a+b);

end.

program z(input,output);

var

a,b,c:string;

p,q:array[1..225] of longint;

m,n,i,j:longint;

function jia(a,b:string):string;

begin

m:=length(a);

n:=length(b);

fillchar(p,sizeof(p),0);

fillchar(q,sizeof(q),0);

for i:=m downto 1 do

p[m+1-i]:=ord(a[i])-48;

for i:=n downto 1 do

q[n+1-i]:=ord(b[i])-48;

i:=1;

repeat

q[i]:=p[i]+q[i];

q:=(q[i] div 10)+q;

q[i]:=q[i] mod 10;

i:=i+1;

until (q[i]+p[i])=0;

jia:='a';

for j:=i-1 downto 1 do

begin

jia:=jia+chr(q[j]+48);

end;

delete(jia,1,1);

end;

begin

read(a);

for i:=1 to length(a) do

begin

if a[i]=' ' then

begin

b:=copy(a,1,i-1);

delete(a,1,i);

end;

end;

c:=jia(a,b);

write(c);

end.

var

en,et,ec,eu,ep,ex:Array[0..250000] of longint;

dis:array[0..1000] of longint;

v:array[0..1000] of boolean;

i,j,k,n,m,w,cost,l:longint;

a,b,ans,left,right:longint;

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

begin

if a0)and not v[et[i]] and(dis[et[i]]+ec[i]=dis[no]) then

begin

d:=aug(et[i],min(m,eu[i]));

if d>0 then

begin

dec(eu[i],d);

inc(eu[ep[i]],d);

ex[no]:=i;

exit(d);

end;

end;

i:=en[i];

end;

ex[no]:=i;

exit(0);

end;

function modlabel:boolean;

var

d,i,j:longint;

begin

d:=maxlongint;

for i:=1 to n do

if v[i] then

begin

j:=en[i];

while j0 do

begin

if (eu[j]>0)and not v[et[j]] and(ec[j]-dis[i]+dis[et[j]]0 do

fillchar(v,sizeof(v),0);

until modlabel;

work:=cost;

end;

function solve(x,d:longint):longint;

var i,k,t,p,last,cost,lk:longint;

begin

fillchar(en,sizeof(en),0);

fillchar(dis,sizeof(dis),0);

k:=0; n:=2; t:=x; p:=0;

while x0 do

begin

k:=k+x mod 10;

x:=x div 10;

inc(p);

end;

n:=1; x:=t; l:=k+p+1; last:=1; cost:=1; lk:=0;

while x0 do

begin

k:=x mod 10;

for i:=1 to k do

begin

inc(n);

build(last,n,1,-cost);

build(n,last+k+1,1,0);

end;

cost:=cost*10;

inc(n);

if last1 then

begin

if lk

program yhn;

var a,b,c:longint;

begin

readln(a,b);

c:=a+b;

writeln(c);

end.

张仰彪求和法可解此题，鉴定完毕

vijos怎么偷数据？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？？

main(a,b){scanf("%d%d",&a,&b);printf("%d\n",a+b);exit(0);}

program ab;

var a,b:integer;

begin

readln(a,b);

writeln(a+b);

end.

INV

program z(input,output);

var

a,b,c:integer;

begin

read(a,b);

c:=a+b;

writeln(c);

end.

位运算 a+b 用位运算给他一直加1

var a,b,c,d,n,i:longint;

begin

readln(a,b);

for i:=1 to b do

begin

c:=a; n:=1;

b:=1;

while b and c0 do

begin

a:=a and (not (1 shl (n-1)));

c:=c shr 1;

inc(n);

end;

a:=a or (1 shl (n-1));

end;

writeln(a);

end.