In yesterday's AtCoder Beginner Contest 280 I didn't able to solve D. Then I was looking for solution and after seeing this submission I was shocked. Can anyone tell me how the logic work for this problem submission?
Thanks.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
In yesterday's AtCoder Beginner Contest 280 I didn't able to solve D. Then I was looking for solution and after seeing this submission I was shocked. Can anyone tell me how the logic work for this problem submission?
Thanks.
Name |
---|
Here is an alternative approach. Suppose
k
is1792
. Convert1792
into2^8 * 7^1
. It is clear thatn
needs to be at least7
in order to cover the7
, but what is then
required to provide eight2
s? Let's count:2
provides one2
.4
provides two2
s.6
provides one2
.8
provides three2
s. Now we have (1+2+1+3 = 7
)2
s. We still need one more.10
provides one2
. Now we have eight2
s. This meansn==10
is the max n needed. The other factor found earlier isn==7
but7
is less than10
. So, the answer is10
.Edit: Just realized OP was referring to a particular submission.