We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
With T apparently only limited to 10**5 and a limit of 10**5 items in an input sequence, there's a possibility that we'd have to read in 10**10 numbers, which would almost certainly not be possible in the given time.
Though it's mostly common-sense, most problems would mention this constraint explicitly, so here goes:
None of the testcases (I've tried them all!) require you to read in more than 100000 input sequence elements totalled across all T of that testcases' input sequences (in fact, 98280 (testcase 04) seems to be the largest total number of input sequence elements you'll need to read in).
In fact (spoiler!) - no testcase has T > 100!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Repetitive K-Sums
You are viewing a single comment's thread. Return to all comments →
With T apparently only limited to 10**5 and a limit of 10**5 items in an input sequence, there's a possibility that we'd have to read in 10**10 numbers, which would almost certainly not be possible in the given time.
Though it's mostly common-sense, most problems would mention this constraint explicitly, so here goes:
None of the testcases (I've tried them all!) require you to read in more than 100000 input sequence elements totalled across all T of that testcases' input sequences (in fact, 98280 (testcase 04) seems to be the largest total number of input sequence elements you'll need to read in).
In fact (spoiler!) - no testcase has T > 100!