I have tried this serval hours, and finally got AC.
Believe it or not, what I discovered is that:
it seems that some of the test cases contain muliple TARGET 'T', and the judge only accept solution handling the latest Target.
Hope this can help
Search found 2 matches
Search found 2 matches • Page 1 of 1
- Wed Apr 22, 2009 4:30 pm
- Forum: Volume 8 (800-899)
- Topic: 850 - Crypt Kicker II
- Replies: 77
- Views: 37367
My program pass all the test case post here, but still get WA ><,can anyone plx help?? thanks! my code is as follows: #include <iostream> #include <cstring> using namespace std; const char KEY = "the quick brown fox jumps over the lazy dog"; const int SIZEKEY = strlen(KEY); char a; char b[120...