### wuhudsm's blog

By wuhudsm, history, 6 months ago,

A

code
solution

B

code
solution

C

code
solution

D

code
solution

E

code
solution

F

code
solution
• +20

 » 6 months ago, # | ← Rev. 2 →   0 B. If $n=1$, answer 1 if $con(k,k)$ is prime?
•  » » 6 months ago, # ^ | ← Rev. 2 →   0 In fact when $k>1$,$con(k,k)$ is always not a prime.
•  » » » 6 months ago, # ^ |   +3 wow, how to prove it?
•  » » » » 6 months ago, # ^ |   +14 For $k>1,con(k,k)$ has a divisor $10^{\lfloor log_{10}(k) \rfloor}+1$.For example,$123123$ has a divisor $1001(123*1001=123123)$.
•  » » » 6 months ago, # ^ |   +3 oh, ok; $con(k,k)$ is a $k+ 10^x * k$
 » 6 months ago, # |   +8 Very interesting contest <3
•  » » 6 months ago, # ^ |   0 Love your profile...
•  » » » 6 months ago, # ^ |   0 Thanks
 » 6 months ago, # |   +1 Didn't get the editorial of C,can anyone tell their approach of how they solved C?
•  » » 6 months ago, # ^ |   0 Editorial of C updated :)
•  » » » 6 months ago, # ^ | ← Rev. 2 →   0 In Problem C : What is the condition for -1, Can you explain it, please ? According to editorial, we can always make 2max(ai)≤Σai in atmost 2 operation of increasing minimum values by 26, then what is the case, when -1 comes ?
•  » » » » 6 months ago, # ^ |   0 The unsolvable situation only occurs in $n=2,s_1 \neq s_2$.
•  » » » » » 6 months ago, # ^ |   0 Ok! Thanks, got it
 » 6 months ago, # |   +1 Couldnt understand C
•  » » 6 months ago, # ^ |   0 Same here :(
•  » » 6 months ago, # ^ |   0 Editorial of C updated :)
 » 6 months ago, # |   +8 Great Problemset. Enjoyable Round. Thanks for this :)
 » 6 months ago, # |   0
 » 6 months ago, # |   0 can someone explain A? :)
 » 6 months ago, # |   +21 Interesting problem F
 » 6 months ago, # |   0 Where can i find the classic problem mentioned in C
 » 6 months ago, # |   0 Memory Limit is too low for Python solutions to pass Problem D.