ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1748. The Most Complex Number

Weak test cases and Time Limit too strict for Java
Posted by rishav kumar 25 Apr 2018 06:38
Same code gets AC in c++ but gets TLE in test 14 in Java.
Turns out, even if you dont use the condition of "powers of primes should be in non increasing order" , your c++ code gets AC, while for Java you have to use that condition.

Edited by author 25.04.2018 06:42

Edited by author 25.04.2018 06:42