OJ Board

how can i prove whether a certain pattern is true or not in all possible n?

can someone give me any hints to solve this problem?

anybody can help me.......?? pls answer........

any hint for me to find out the pattern?

why it is possible to reach new stones if all old stones can be reached?
How do u proof this?

your pattern is wrong for 14 and 15

some say tat this problem has O(n) algor.... i am really confused , can someone tell me some idea of the O(n) algor...?

the problem seems to be simple but i dunno why i get WA , someone pls help
program q10242;
var x1,y1,x2,y2,x3,y3,x4,y4,xa,ya,xt,yt:double;
begin
while not eof do
begin
readln(x1,y1,x2,y2,x3,y3,x4,y4);
if (x1=x3)and(y1=y3)
then begin
xt:=x4-x3;
yt:=y4-y3;
xa:=x2+xt;
ya:=y2+yt
end;
if ...

i finally solved this....this is simply some problem in the operation with the b varibales

i think my program works for all sort of input...but still wa.....can anyone give me some critical inputs for this problem? i simply floodfill the places which is reachable from the * room....

program q784;
var a:array[1..40]of string;
n,i,j,k,l,x,y:integer;
procedure recur(s,t:integer);
var u ...

i tried tonnes of test cases but still WA.....can someone help me?
tell me what is wrong with my source or give me some critical input pls....
:(

{@judge_id: 38587WT 532 Pascal}
program q532;
var i,j,k,x,y,z,head,tail,sx,sy,sz,fx,fy,fz:longint;
qx,qy,qz,len:array[1..30000]of longint;
b:array ...

any critical data in this problems.....i tryed loads of them ....but still dunno why WA

here is my code:
program q713;
uses wincrt;
var a:array[1..300]of integer;
n,i,j,k,u,v:integer;
s,s1,s2,t1,t2:string;
check:boolean;
begin
readln(n);
for i:=1 to n do
begin
check:=false;
readln(s);
for ...

can someone please tell me why suddenly everyone's accepted programs decrease a lot?

i am new here.....
i want to ask why my accepted programs no. suddenly decreased by a large amount in the judge and it seems every people like so......

any critical test data for this Q?
pls help