| # | Who | = | * | A | B | C | D | E |
|---|---|---|---|---|---|---|---|---|
| 82 | kyuridenamida | 2960 | +4 / -1 | 47400:13 | 91200:22 | 122400:46 | -1 |
By the way ... I committed a serious mistake in problem D ;(
I set program to output -1 in n=2 case.
But, the program didn't exit program after that.
So, I got WA.
------------------------
Expected:
-1
Outptut:
-1
6
3
------------------------
*Methods to solve
[A] I only used the Python:)
Actually, input is "positive integer". <- damn!
[B] Simulation. I only did.
[C] I made tree with using <map> and <set>
do counting folder and files that starts at all one-depth folders , and get maximum.
[D] Look at the method image(n=5) I did this method , and used the bigInteger.
This method is not effective.
[E] Unread.
*Hacks
I succeeded 4 hacks. (Problem D Case: n=2)
Sorry my bad English.
Nice!