Search found 5 matches

by CelebiX
Sun Dec 28, 2003 4:14 pm
Forum: Volume 105 (10500-10599)
Topic: 10589 - Area
Replies: 48
Views: 18608


I have just tried this 0.0%-rated problem and got accepted in a few trials.
The key is high precision - simply using double or long double may not be sufficient.
Try to "magnify" the input numbers.
by CelebiX
Tue Jun 17, 2003 2:02 pm
Forum: Volume 104 (10400-10499)
Topic: 10422 - Knights in FEN
Replies: 49
Views: 18233

bidirectional bfs

i used IDA* and solved in 0.000sec.

if n<=20 try bfs from both the start and goal
the bfs tree grown from the start will meet the one grown from the goal at some node x
then start ~> x ~> goal is the path
by CelebiX
Wed Jun 19, 2002 12:55 pm
Forum: Volume 6 (600-699)
Topic: 636 - Squares (III)
Replies: 7
Views: 3530

636 - Squares (III)

I got WA every time..... plz help me >< plz >< [cpp]#include <iostream> #include <math.h> #include <string> long long i,j,k,l,tmp,a,digits[100]; string strg; int main() { while(cin >> strg,strg!="0") { j=2; for(i=0,k=strg.length()-1;i<strg.length();++i) { digits =strg[k-i]-48; if(digits >j) j=digits...
by CelebiX
Tue Jun 18, 2002 12:51 pm
Forum: Volume 8 (800-899)
Topic: 851 - Maze
Replies: 35
Views: 16750

thx for ur reply.

Another question:
You have ``escaped" whenever you reach a square on an outside edge of the grid.
squares on outside edge are those marked with X or those with A?? (plz refer to the sample input)

by CelebiX
Tue Jun 18, 2002 11:08 am
Forum: Volume 8 (800-899)
Topic: 851 - Maze
Replies: 35
Views: 16750

851 - Maze

Do I need to walk UNTIL i reach a blocked location? or I can stop anywhere and continue to the next direction?

Go to advanced search