he says that 10^5 will not be accepted with O(n3). please tell how to guess the desired complexity constraint for any question?
How to decide that this solution will not be accepted?
hey @sirraghavgupta, our machine can you through approximately 10^8 iterations in a sec.
so if n=10^5 and ur sol is of order O(n3), total no. of iterations will be 10^15, and time taken will be equal to approximately 10^7 sec
what should be the ideal time to solve any problem normally in competitive programming.???
what if i solve this problem in 10 sec time? will it be accepted? just a general question
yes there are high chances that it will get accepted