Opening the reading…
Opening the reading…
TIME AND SPACE COMPLEXITY / ONLINE JUDGE › TIME AND SPACE COMPLEXITY
This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.
TASK
Check the supplied inequality T(n) <= 4n for every integer n from 2 through the given limit. Print "O(n) witness passes" only when every check passes.
OUTPUT
SampleO(n) witness passes
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.