Search found 12 matches
- Fri Jan 02, 2004 8:15 pm
- Forum: Volume 4 (400-499)
- Topic: 406 - Prime Cuts
- Replies: 187
- Views: 30252
- Fri Jan 02, 2004 8:07 pm
- Forum: Volume 4 (400-499)
- Topic: 439 - Knight Moves
- Replies: 33
- Views: 11996
- Fri Jan 02, 2004 8:05 pm
- Forum: Volume 4 (400-499)
- Topic: 406 - Prime Cuts
- Replies: 187
- Views: 30252
- Fri Jan 02, 2004 2:15 pm
- Forum: Volume 4 (400-499)
- Topic: 439 - Knight Moves
- Replies: 33
- Views: 11996
- Fri Jan 02, 2004 11:32 am
- Forum: Volume 4 (400-499)
- Topic: 439 - Knight Moves
- Replies: 33
- Views: 11996
I am using a graph search algorithm to solve this problem, and I am getting WA, but I don't know why. Here are some input and output cases, can anyone try them with a AC program? Thanks... Input: a1 e4 a2 a8 a3 g5 b1 c1 b2 b6 b3 c4 b4 h8 b8 h8 c2 c6 c3 h4 c6 f7 d2 f8 d4 e6 d6 h8 e2 e6 e4 e8 f1 g6 f4...
Oh, sorry. I am getting the compile error only on OJ. At home I use Visual C#, but I am coding in C. And I have a lot of problems accepted, but in this one I am using feof(stdin) and there is where I am getting compile error (if I remove it from the code, it's OK, but then I get WA). And I didn't in...
feof
Why am I getting compile error if i use:
[c]if(feof(stdin))
return;[/c] ?
[c]if(feof(stdin))
return;[/c] ?
- Sun Dec 21, 2003 11:32 am
- Forum: Volume 101 (10100-10199)
- Topic: 10116 - Robot Motion
- Replies: 10
- Views: 4949
- Sun Dec 21, 2003 9:03 am
- Forum: Volume 105 (10500-10599)
- Topic: 10515 - Powers Et Al.
- Replies: 124
- Views: 32917
Re: I got AC .
Nope, one digit of m and two digits of n are enough.yan4546 wrote:2 digits is not enough and 3 digits can do .
- Mon Dec 15, 2003 6:31 pm
- Forum: Volume 3 (300-399)
- Topic: 371 - Ackermann Functions
- Replies: 196
- Views: 33769
- Mon Dec 15, 2003 6:21 pm
- Forum: Volume 3 (300-399)
- Topic: 371 - Ackermann Functions
- Replies: 196
- Views: 33769
371: why SIGSEGV
Hello all!
Why am I getting SIGSEV error with this piece of code?
The largest value in the sequence will not be larger than a 32-bit C long, and I have long's in the code. What else could be wrong?
Why am I getting SIGSEV error with this piece of code?
The largest value in the sequence will not be larger than a 32-bit C long, and I have long's in the code. What else could be wrong?