Search found 6 matches
- Wed Nov 19, 2014 1:04 am
- Forum: Volume 112 (11200-11299)
- Topic: 11221 - Magic square palindromes.
- Replies: 58
- Views: 22238
Re: 11221 - Magic square palindromes.
Did it, still WA. Already tried with and without the final \n;
- Tue Nov 18, 2014 6:01 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11221 - Magic square palindromes.
- Replies: 58
- Views: 22238
Re: 11221 - Magic square palindromes
Input: 2 :) ~ :D ~~~~ :))))))) :D :D :D :P :P :P :P AC Output: Case #1: 2 Case #2: 2 I ran it on toolkit and it gave me the same output my code did: Case #1: 0 Case #2: 0 Indeed, it doesn't really matter once judge ignores capital letters (there won't be capital inputs, it's in the specification).
- Tue Nov 18, 2014 5:09 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11321 - Sort! Sort!! and Sort!!!
- Replies: 50
- Views: 21878
Re: 11321 - Sort! Sort!! and Sort!!!
I've been trying to solve this one for a while now, and it only gives me WA, even though it passed all test cases I could find for it.
I don't see what is missing for that to fit in Ac. Can anyone help?
I don't see what is missing for that to fit in Ac. Can anyone help?
Code: Select all
AC, just missing "\n" when printing the "0 0" line ¬¬
- Tue Nov 18, 2014 5:06 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11221 - Magic square palindromes.
- Replies: 58
- Views: 22238
Re: 11221 - Magic square palindromes.
It gives me WA even though I passed all test cases:
EDIT: Nvm, i was forgeting the almost invisible ":" at the end of the "Case n#:" line
Code: Select all
Removed due to AC
- Thu Jun 27, 2013 9:31 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 12429
Re: WA on Problem #122
Damn I see it... my array won't handle 256 nodes if they're not perfectly arranged. Scare thing is: to handle up to 256 ordered like that, my array needs 2²?? integers, that's fucked up... I'll try bigger arrays, if they don't do it, I'll have to create a whole different algorithm =/. Thanks. EDIT: ...
- Wed Jun 26, 2013 3:28 am
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 12429
WA on Problem #122
I keep getting WA on this problem, but I can't find a problem on my algorithm. Here's my code: http://pastebin.com/d6Xc7DP1 #include <cstdio> #include <cstdlib> #include <cstring> #define NUM_NODES 256 template <class T> class Tree { private: T heap[NUM_NODES]; int hs[NUM_NODES]; // HeapStatus - 0: ...