30 条题解
-
0
黄道十二宫 LV 7 @ 2009-01-24 17:03:42
谁说下标准算法啊
-
02009-01-24 16:40:30@
囧,纯模拟还有这么多人错。。。
-
02009-01-23 11:58:12@
注意中间传递过程中无路可走直接跳出
if flag then
begin
s1:=s1+x1;s2:=s2+y1;
end
else break;
外面再加一个判断即可
if sum=k1*k2 then flag:=true;
if flag then writeln(sum) else writeln('Error!');
writeln(s1,',',s2); -
02009-01-23 11:05:02@
中间的那个我也不知道怎么回事
答案是咱们想的解 再走上一步
=.=
-
02009-01-23 09:50:06@
中间5个点咋回师?
-
02009-01-22 17:55:01@
我全死。。。
-
02009-01-22 17:47:20@
一点没过?
他说我错了……,why?哪位强神牛帮忙看看
var
sum:qword;
a,b:array[1..30,1..30]of integer;
v:array[1..30,1..30]of boolean;
f,x1,x2,y1,y2,n1,n2,m1,m2:integer;
t:qword;procedure init;
var
i,j:integer;
begin
read(n1,m1);
for i:=1 to n1 do
for j:=1 to m1 do
begin
read(a);
if a=0 then
begin
x1:=i;
y1:=j;
end;
end;
read(n2,m2);
for i:=n2 downto 1 do
for j:=1 to m2 do
begin
read(b);
if b=0 then
begin
x2:=i;
y2:=j;
end;
end;
read(f);
end;procedure suan1;
var
i,j:integer;
begin
t:=0;
for i:=1 to x2-1 do
for j:=1 to m2 do inc(t,b);
if (f=0) xor odd(x2-1) then for j:=1 to y2-1 do inc(t,b[x2,j])
else for j:=m2 downto y2+1 do inc(t,b[x2,j]);
end;procedure suan2(last,x,y:integer);
var
i,j,k,min:integer;
begin
inc(sum);
dec(last,a[x,y]);
if (last -
02009-01-22 17:30:56@
为什么只过5点
-
02009-01-22 10:41:00@
Program P1503;
var a,b:array[1..30,1..30]of longint;
var x,y,k1,k2,l1,l2,n,i,j:longint;
var time:qword;
begin
readln(k1,k2);
for i:=1 to k1 do
for j:=1 to k2 do begin
read(a);
if a=0 then begin x:=i,y:=j;end;
end;
readln(l1,l2);
for i:=1 to l1 do
for j:=1 to l2 do read(b);
readln(n);
if n=0 then begin
b -
02009-01-20 19:42:24@
还没推出呢,fengyi就A了。。。