ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1216. Two Pawns and One King

finally i got ac......
Posted by yuhch 12 Sep 2007 08:14
i changed my algorithm from checking cases to searching with memorizing, but always get wa on test 7. after one day's struggle, i'm nearly crazy... at last i found my reading part has a mistake that i read the data like this:
scanf("%s", tmp);
p[0] = tmp[0] - 'a';
p[1] = tmp[1] - '1';
but when N is greater than 9, p[1] may have 2 digits...... i hope no one will make SUCH a SILLY mistake like me, especially spending one day on it...

Edited by author 12.09.2007 08:15