Ques.
Find the min. Number whose sum of digits is k and the number should be divisible by f. Since number can be large return output as string. Return -1 if no such number exist.
f < 500 k < 5000
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Ques.
Find the min. Number whose sum of digits is k and the number should be divisible by f. Since number can be large return output as string. Return -1 if no such number exist.
f < 500 k < 5000
Given a string S consisting of characters 'r' and 'l' and N where N is length of road.
Determine the number of unique subsequences of those moves that lead from a given house x to end at another house y. Moves will be given as a sequence of l and r instructions where l indicates you need to move left and r indicates you need to move right. Return answer modulo 10^9+7
Input format- String (S) N — Length of road x — starting point y — Ending point
rrlrlr 6 1 2
Output- 7
Название |
---|