I used BigInteger for this problem, just in case if the output had to be a large number, but I got a Time limit exceeded on pretest 10. If you used java, can you tell me what you used to solve it?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | atcoder_official | 162 |
3 | maomao90 | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
I used BigInteger for this problem, just in case if the output had to be a large number, but I got a Time limit exceeded on pretest 10. If you used java, can you tell me what you used to solve it?
Name |
---|
The problem time limit is only 0.5 seconds so that you wouldn't solve it using big integer. you should find the non beautiful number and add zeros to its right equal to zeros in all numbers. If all numbers are beautiful then you can consider any number as the starting number.