OJ Board

I assume that O(n^4) means the number of operations is ^4. What's the name of this notation; how can I find out more? Is there a method to assist in converting an O(n^6) solution to O(n^4) or less?

Thanks

I'm wondering about the very high performance programs i.e. 64 memory and ~0 CPU time, and also about improving the performance of my own while still using the standard C++ classes e.g. "use lists instead of vectors in this case" and maybe compiler settings.

I am actually getting a TLE on 108 ...

Loop between i and j for each input and update max to n when n is greater than max.

I think you should be able to search Topic/Subject only.

"You can assume that no opperation overflows a 32-bit integer."

should be operation

scanf returns an integer containing the number of items read. EOF is returned if no items can be read therefore in this case it's better to compare to the number of items you require in case only one of two are input. Although, you could argue that you know the input is valid in this case so ...

Could someone advise me on how some authors achieve such good performance for the problems in C++? For example do they just write the code in embedded assembly or are there some good C++ performance tips I can use?

Also, are our submissions compiled in debug mode with no optimizations? Might it be ...