My code follows the exact procedure of tutorial. But getting wa on test 10. case is too long that it is not showing . Can someone help me; where did i do wrong ?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
My code follows the exact procedure of tutorial. But getting wa on test 10. case is too long that it is not showing . Can someone help me; where did i do wrong ?
On Timus getting wa on test 2 ..somebody plz tell me what is wrong?
the problem 1049 brave ballon
my code: ideone
Idea : what i tried to do was ..calculate all prime factors of those 10 num;
Then maintained dp where dp[x]..would be n^(x or higher)...the number of factor which has x or higher power.. then i calculate the number of situation where all numbers are prime, i gradually lessened the length and calculate new numbers where the situation was of that length;
if it was : 36 length 4: 2, 3 case [2*2*3*3] length 3 : 4,9,6 cases[ 4 * 3* 3, 2*2*9, 6*6] length 2 : 12, 18 cases [12*3, 18*2]
length 1 : 1, 36
in my code length was denoted as x
Name |
---|