Codeforces Round 697 – New Year’s Number Solution

Codeforces Round 697 – New Year’s Number Solution

Polycarp remembered the 2020-th year, and he is happy with the arrival of the new 2021-th year. To remember such a wonderful moment, Polycarp wants to represent the number n as the sum of a certain number of 2020 and a certain number of 2021.

For example, if:

  • n=4041, then the number n can be represented as the sum 2020+2021;
  • n=4042, then the number n can be represented as the sum 2021+2021;
  • n=8081, then the number n can be represented as the sum 2020+2020+2020+2021;
  • n=8079, then the number n cannot be represented as the sum of the numbers 2020 and 2021.

Help Polycarp to find out whether the number n can be represented as the sum of a certain number of numbers 2020 and a certain number of numbers 2021.

Input :

The first line contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

Each test case contains one integer n (1≤n≤106) — the number that Polycarp wants to represent as the sum of the numbers 2020 and 2021.

Output :

For each test case, output on a separate line:

  • “YES” if the number n is representable as the sum of a certain number of 2020 and a certain number of 2021;
  • “NO” otherwise.

Input :

5
 1
 4041
 4042
 8081
 8079

Output :

NO
 YES
 YES
 YES
 NO

Solution :

// <-Coded by Pasindu Piumal-> 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long int 
#define ld long double
#define str string
#define F first 
#define S second
#define pb push_back
#define mp make_pair
 
int mxN=1e5;
ll n;
 
void solve() {
 cin >> n;
 int p=n%2020, k=n/2020;
 if(p<=k)cout << "YES\n";
 else cout << "NO\n";
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    int t;
    cin >> t;
    while(t--) {
     solve();
    }
 
    return 0;
}

 795 total views,  1 views today

Leave a Reply

Your email address will not be published. Required fields are marked *