- 数字游戏
- 2009-07-26 14:41:32 @
编译通过...
├ 测试数据 01:答案正确... 0ms
├ 测试数据 02:答案错误...程序输出比正确答案长
├ 测试数据 03:答案错误...程序输出比正确答案长
├ 测试数据 04:答案错误...程序输出比正确答案长
├ 测试数据 05:答案正确... 0ms
var
x:array[1..100] of longint;
a,b:array[1..100,1..100,1..9] of longint;
i,j,n,m,c,k,max,l,min:longint;
procedure doit;
begin
for k:=2 to m do
for i:=1 to n do
for l:=2 to n do
for j:=i to i+l-1 do begin
if ab*b[j+1,i+l,1] then b:=b*b[j+1,i+l,1];
end;
end;
procedure te(i,j:longint);
begin
for l:=i to j do
inc(a,x[l]);
a:=a mod 10;
while amax then max:=a;
if b
1 条评论
-
1031389972 LV 8 @ 2014-08-15 17:19:44
编译成功
测试数据 #0: Accepted, time = 0 ms, mem = 816 KiB, score = 20
测试数据 #1: Accepted, time = 0 ms, mem = 820 KiB, score = 20
测试数据 #2: Accepted, time = 0 ms, mem = 816 KiB, score = 20
测试数据 #3: Accepted, time = 0 ms, mem = 820 KiB, score = 20
测试数据 #4: Accepted, time = 0 ms, mem = 816 KiB, score = 20
Accepted, time = 0 ms, mem = 820 KiB, score = 100
- 1