1323 条题解
-
0
src250 LV 10 @ 2009-05-29 20:08:02
膜拜voyagec2大牛!
小菜有礼了! -
02009-05-24 10:12:17@
var
a, b: longint;
begin
readln(a, b);
writeln(a + b);
end. -
02009-05-17 10:22:48@
var
a,b:integer;
procedure init;
begin
assign(input);
assign(output);
reset(input);
rewrite(output);
end;
procedure outit;
begin
close(input);
close(output);
end;
begin
read(a,b);
writeln(a+b);
end. -
02009-05-15 14:55:40@
var
a,b:longint;
begin
readln(a,b);
write(a+b);
end. -
02009-05-14 17:45:46@
我超时了!!!!!!!!!!!!!!
-
02009-05-13 16:19:37@
最好用高精度!
-
02009-05-07 13:36:24@
var
a,b:int64;
begin
read(a,b);
write(a+b);
end. -
02009-04-25 08:45:01@
#include
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout -
02009-04-15 13:31:09@
照打
-
02009-04-07 09:10:47@
program Plus;
var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end. -
02009-04-06 14:42:12@
program xx;
var
x,y:longint;
begin
readln(x,y);
writeln(x+y);
readln;
end. -
02009-04-04 13:49:52@
program plus;
var
x,y:integer;
begin
readln(x,y);
writeln(x+y);
readln;
end. -
02009-04-01 16:06:14@
编译通过...
├ 测试数据 01:答案正确... 0ms
├ 测试数据 02:答案正确... 0ms
├ 测试数据 03:答案正确... 0ms
├ 测试数据 04:答案正确... 0ms
├ 测试数据 05:答案正确... 0ms
├ 测试数据 06:答案正确... 0ms
├ 测试数据 07:答案正确... 0ms
├ 测试数据 08:答案正确... 0ms
├ 测试数据 09:答案正确... 0ms
├ 测试数据 10:答案正确... 0ms
---|---|---|---|---|---|---|---|-
Accepted 有效得分:100 有效耗时:0msprogram sunny;
var a,b:longint;
begin
readln(a,b);
writeln(a+b);
end. -
02009-04-03 09:12:57@
program plus;
var x,y:integer;
begin
readln(x,y);
writeln(x+y);
readln
end. -
02009-03-31 16:21:22@
program zh;
var
a,b:integer;
begin
writeln('Please input 2 numbers');
read(a,b);
writeln(a+b);
end. -
02009-03-28 21:58:25@
program p_1000;
var
a,b:integer;
begin
read(a,b);
write(a+b);
end. -
02009-03-11 21:21:21@
program xr_1;
var a,b,c:real;
begin
read(a,b);
c:=a+b;
writeln(c);
end. -
02009-03-11 17:40:51@
program hyf;
var a,b:longint;
begin
readln(a,b);
write(a+b);
end. -
02009-03-09 16:11:07@
var a,b:longint;
begin
readln(a,b);
write(a+b);
end. -
02009-03-08 20:40:06@
拆点作最小费用流
不过时间有点小微:
在Vag 6K上:
编译通过...
├ 测试数据 01:运行超时...
├ 测试数据 02:运行超时...
├ 测试数据 03:答案正确... 680ms
├ 测试数据 04:运行超时...
├ 测试数据 05:运行超时...
├ 测试数据 06:答案正确... 524ms
├ 测试数据 07:运行超时...
├ 测试数据 08:运行超时...
├ 测试数据 09:运行超时...
├ 测试数据 10:运行超时...
---|---|---|---|---|---|---|---|-
Unaccepted 有效得分:20 有效耗时:1204ms在Puppy上:
编译通过...
├ 测试数据 01:答案正确... 728ms
├ 测试数据 02:答案正确... 541ms
├ 测试数据 03:答案正确... 25ms
├ 测试数据 04:答案正确... 197ms
├ 测试数据 05:答案正确... 525ms
├ 测试数据 06:答案正确... 41ms
├ 测试数据 07:答案正确... 619ms
├ 测试数据 08:答案正确... 166ms
├ 测试数据 09:答案正确... 369ms
├ 测试数据 10:答案正确... 400ms
---|---|---|---|---|---|---|---|-
Accepted 有效得分:100 有效耗时:3611ms这题卡时间啊。。。。。
大家碰不到puppy就别交了。。。附上源代码:
program problem;
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
信息
- ID
- 1000
- 难度
- 9
- 分类
- (无)
- 标签
- (无)
- 递交数
- 74446
- 已通过
- 28492
- 通过率
- 38%
- 被复制
- 223