OJ Board

I solved this problem during the contest but I get WA now. Is there anything I need to know, anything that was changed?

Thanks!

Your code takes too long to run. Each query of (i,j) takes max(i,j)-min(i,j) time which is potentially 1000000 each. Consider some sort of memoization to reduce your query time.

Hi, I'm uncertain on what to output for this problem, as I seem to get several possible outputs for some inputs... My program's method is to first find the roots of the degree 4 polynomial. If no roots are found, I use trial division to see if I can find a degree 2 factor. I get a TLE verdict ...

in:
2342
2343
34
1
234
678
67223
76627567
334
787890
787611
0

out:
Case 1: 1173
Case 2: 104
Case 3: 19
Case 4: 2
Case 5: 31
Case 6: 119
Case 7: 5184
Case 8: 22408
Case 9: 169
Case 10: 131321
Case 11: 23900


I get:

Case 1: 1173
Case 2: 85
Case 3: 19
Case 4: 2
Case 5: 24
Case 6: 118
Case 7: 5184 ...