Hi, Can someone please help me out with this problem which appeared in Ad Infinitum 17 on Hackerrank.
Problem Link: https://www.hackerrank.com/contests/infinitum17/challenges/number-of-m-coprime-arrays
Thanks!
# | 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 |
Hi, Can someone please help me out with this problem which appeared in Ad Infinitum 17 on Hackerrank.
Problem Link: https://www.hackerrank.com/contests/infinitum17/challenges/number-of-m-coprime-arrays
Thanks!
Name |
---|
Consider some prime P in factorization, sequence of powers should not have two consecutive non-zero powers, then you can multiply answers over distinct primes since they are independent. The first part can be done by matrix multiplication. Hint: matrix should have 2x2 size.
Thanks, it helped! Can you provide your code for the problem, it will help :)
It would be better for you to implement own code, this might help: http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/, http://codeforces.net/blog/entry/22317
These blogs are what I needed :) Thanks a lot again.