|
|
This problem isn't hard! Just use Burnside's lemma. One would need Polya enumeration theorem to obtain an explicit formula though. Well, the theorem is a generalization of Burnside's anyway. My first solution get WA 9 now. And same solution on C# (first solution on C++) get Crash 9.
Edited by author 07.08.2010 21:25 And what's the bug? Submit #2687131 - Accepted.
Same program - submits #3124073 and #3124305 get WA9.
Edited by author 08.08.2010 02:05 New compiler - new verdict :) What's wrong? |
|
|
