Antor_1809032's blog

By Antor_1809032, history, 7 weeks ago,

Codeforcess Round #788 (Div. 2) Problem B.

I have used O(n) complexity code in my code, but I got TLE on test 35.

While my friend during the contest solved the problem has a total number of test cases 34.

This is my submission and I got TLE on test case no. 35.

And this is the last case for my friend's submission.

What is the problem??

• 0

 » 7 weeks ago, # |   0 In my submission, the 35th test is:t = 10^5and, i guess, every test case looks the same: 2ab26 a b c d e f g h i j k l m n o p q r s t u v w x y z
 » 7 weeks ago, # | ← Rev. 2 →   +3 HelloI tried a lot with your code , but nothing workedI finally removed the "scanf" and "printf" and added "cin" and "cout" with the fast i/o method , and it worked ! .So either use (cin,cout) with fast i/oor (scanf,printf) without fast i/ofast i/o : ios::sync_with_stdio(NULL); cin.tie(NULL);cout.tie(NULL); 
 » 7 weeks ago, # |   +8 more likely skill issue