my ques is : SPOJ.com - Problem DIVCNT3
my code is : http://ideone.com/HSbDXQ
shows tle
please check my solution as it shows tle for the last case
What a nice solution!
Assuming the computer can make roughly 10^8 simple operations in a second, T=1, N=10^11 your O(N^4) solution will take only 3*10^28 years for the answer of a single test case to come. You can wait till then and note down the answer and just report it!
1 Like
i am a new user thats why i am asking
i am a beginner thats why i am asking