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!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/20/2024 22:57:46 (k2).
Desktop version, switch to mobile version.
Supported by
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://mirror.codeforces.com/blog/entry/22317
These blogs are what I needed :) Thanks a lot again.