You have given a number n you have to return the smallest possible palindrome number of digit n which is divisble by 7.
1<=n<=1000
Input :
4 -> no of test cases
1
2
3
4
output :
0
77
161
1001
####
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
7 | atcoder_official | 147 |
7 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
####
Название |
---|