PROBLEM LINK:
Practice
Contest: Division 1
Contest: Division 2
Contest: Division 3
Contest: Division 4
Author: iceknight1093
Tester: tabr
Editorialist: iceknight1093
DIFFICULTY:
TBD
PREREQUISITES:
None
PROBLEM:
Chef’s city has 100 neighborhoods. He’s visited N of them so far.
How many more are to be visited?
EXPLANATION:
There are 100 neighborhoods, and N of them have been visited.
This leaves 100 - N of them unvisited, which is the answer.
TIME COMPLEXITY:
\mathcal{O}(1) per testcase.
CODE:
Editorialist's code (Python)
n = int(input())
print(100 - n)