Question was asked in this contest !!! [IEMATICS](https://www.codechef.com/IEMATICS
# | 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 |
Question was asked in this contest !!! [IEMATICS](https://www.codechef.com/IEMATICS
Name |
---|
What about 90,90,90,90,90,90,90,90,90,90,442.
People talk about conspiracy theories where Hitler is still alive. But after this comment they'll be talking about theories where Einstein's still alive.
Since the maximum sum of digits of a k-digit decimal number representation is 9k, the minimum number of digits of the decimal representation of N and 2N should be 13 digits and 14 digits, respectively.
UPDATE: It turns out that it is sufficient to concatenate two instances of the number M = 1,994,999 whose sum of digits is 50, and whose double 2 M = 3,989,998 has sum of digits equal to 55. The concatenation leads to doubling the sum of digits as the most significant digit in M is less than 5, and no carry operation is performed between the two instances when M is doubled.
Therefore, the 14-digit decimal number N = 19,949,991,994,999 is a possible solution of the problem.
The following is the simple DP-based solution that generated such number.
https://ideone.com/LuMF89