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 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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 |
---|