https://www.codechef.com/problems/CKISSHUG
My method :- if first place is H then there are 2^(n-1) possibilities if first place is K then there are 2^(n-1/2) possibilities but this method is not right .
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
https://www.codechef.com/problems/CKISSHUG
My method :- if first place is H then there are 2^(n-1) possibilities if first place is K then there are 2^(n-1/2) possibilities but this method is not right .
Name |
---|
I fully solved it on Codechef.
The formula is { 2^(((n-1)/2)+2) -2 } + 2^(n/2) if n is even.
You have to calculate power of 2 using Modular Exponentiation. You can read it about here https://www.geeksforgeeks.org/modular-exponentiation-power-in-modular-arithmetic/
This is my code https://www.codechef.com/viewsolution/26865644 Hope it helps :) Please upvote it if it helps.