MY1STCONTEST Editorial

editorial
, ,
1

PROBLEM LINK:

Contest Division 1
Contest Division 2
Contest Division 3
Contest Division 4

Setter: Hrishikesh
Tester: Abhinav Sharma, Utkarsh Gupta
Editorialist: Pratiyush Mishra

DIFFICULTY:

284

PREREQUISITES:

None

PROBLEM:

Each contest - there are approximately 1500 - 2000 users who participate for the 1st time and get rated.

The Chef wanted to tell new users some tricks for their 1st contest:

  • Before the contest - you don’t have any rating. So even if you make a single submission - you will become part of the contest rank list and you will get a rating.
  • If you want your rating to increase - give the entire 3 hours to the contest & don’t quit! If you keep trying till the end, and the more time you get, the more problems you can solve. That means larger rating increases!
  • Do not ask your friends for their code. If you copy paste their code, you will get caught during plagiarism checks and your rating will be reduced by 275 points, along with a permanent black mark on your profile.

Now to the problem:

In a contest where N new users visited the contest,

  • A users just saw the problems and didn’t make any submissions and hence won’t get any rating.
  • B users who made a submission but could not solve any problem correctly. Thus, after the contest, they will get a rating in the range 800 - 1000.
  • Everyone else could correctly solve at least 1 problem. Thus, they will get a rating strictly greater than 1000 after the contest.

You need to output the number of new users in the contest who, after the contest, will get a rating and also the number of new users who will get a rating strictly greater than 1000.

EXPLANATION:

Here we are given total number of users as N. Now we need to calculate two things.

  • Rated Users: Except for the A users who did not attempt anything, rest all will be rated after the contest, so
ans = N - A
  • Rating Higher than 1000: Since A users did not participate in the contest and B users did participate but were not able to solve any problem, so rest all the users managed to solve at least one problem, therefore
ans = N - A - B

TIME COMPLEXITY:

O(1)

SOLUTION:

Editorialist’s Solution
Tester1’s Solution
Tester2’s Solution