sir/mam, i solved this problem
https://www.codechef.com/problems/DIRTBYTE
this is my solution,,, http://ideone.com/dt6lxi
but i dont know why am i getting TLE.
couls anyone pls help me to get AC..
thank you.
# | 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 |
sir/mam, i solved this problem
https://www.codechef.com/problems/DIRTBYTE
this is my solution,,, http://ideone.com/dt6lxi
but i dont know why am i getting TLE.
couls anyone pls help me to get AC..
thank you.
Name |
---|
Your time complexity is O(20 * 220 * gcdtime), that one definitely doesn't fit into 1 sec. Just optimize it to O(gcdtime * 220). dp[mask] — lcm of all numbers in mask. , where bit is some one bit in mask.