You are given a number , in how many different ways you can write that number in alphabetical form . eg n = 121 Different ways to write 121 are : (1)(2)(1) , (1)(21), (12)(1) [la] , So the ans for this example is 3. how can we solve this problem ?
# | 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 |
You are given a number , in how many different ways you can write that number in alphabetical form . eg n = 121 Different ways to write 121 are : (1)(2)(1) , (1)(21), (12)(1) [la] , So the ans for this example is 3. how can we solve this problem ?
You are provided with coins of denominations "a" and "b". You are required to find the least value of n, such that all currency values greater than or equal to n can be made using any number of coins of denomination "a" and "b" and in any order. If no such number exists, print "-1" in that case. how can i solve this question ?
Name |
---|