kyuridenamida's blog

By kyuridenamida, 9 years ago, In English,
#Who=*ABCDE
82kyuridenamida2960+4 / -147400:1391200:22122400:46-1
As a result , my rate about 100 increased!! I reached to div1!

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.

 
 
 
 
  • Vote: I like it
  • +36
  • Vote: I do not like it

9 years ago, # |
  Vote: I like it +3 Vote: I do not like it
Good idea to review what you have done in the contest. :)
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice!