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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 149 |
6 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
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.
Название |
---|
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.