ENG
RUS
Timus 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
1661
. Dodecahedron
Al.Cash
Hint
[1] // Problem
1661. Dodecahedron
3 May 2009 14:37
This problem isn't hard! Just use Burnside's lemma.
2ch
Re: Hint
// Problem
1661. Dodecahedron
2 Feb 2018 19:44
One would need Polya enumeration theorem to obtain an explicit formula though. Well, the theorem is a generalization of Burnside's anyway.
© 2000–2026
Timus Online Judge Team
. All rights reserved.