Kageyama_29's blog

Can someone help me with this problem — E(Div-2 Latest)
By Kageyama_29, history, 5 months ago, In English

1978E - Computing Machine — 266794537. It's failing in hidden test cases.

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
5 months ago, # |
  Vote: I like it +5 Vote: I do not like it

Just add in your code counter of the q. And if the sum of q is 529, print the test (then terminate the program). But to not print all 529 numbers, you can skip all unneeded after 9th (so it passes the first test). With this you will see the test on which it fails.

→ Reply
  • »
    »
    5 months ago, # ^ |
    ← Rev. 4   Vote: I like it 0 Vote: I do not like it

    Thank you so much for the help.
    Input-
    1(t)
    4(n)
    0110(a)
    1111(b)
    1(q)
    1 3(l & r)
    Expected output(given) — 0
    but the actual output for the above test case is 2
    so, the input I got here for 529th query is wrong.

    can you check my submission please- link
    Thank you in advance.

    → Reply