thanks,mine is O(n^6)

Not sure what you're doing, but you're not supposed to brute force it. A normal solution should be able to go up to n=100 without taking too long, there's no way you're getting that with O(n ^ 6).

I'm not sure what the complexity is, but I believe it should be something between O(n ^ 2) and O(n ^ 3).

Must I develop it to O(n^4) or faster?

I think although I'am O(n^6), I can run n<=10 fast enough.

I'am showing my code below here.

I found that the online-judge is much slower than my computer,how come?

I can't understand...
Why I got ETO? I used 'cerr' to find out which task made me ETO.But it runs very fast on my computer.
Have you met the same problem?Please help me.Thank you very much indeed.