B. New Year’s Number
Polycarp remembered the 20202020-th year, and he is happy with the arrival of the new 20212021-th year. To remember such a wonderful moment, Polycarp wants to represent the number nn as the sum of a certain number of 20202020 and a certain number of 20212021.
For example, if:
- n=4041n=4041, then the number nn can be represented as the sum 2020+20212020+2021;
- n=4042n=4042, then the number nn can be represented as the sum 2021+20212021+2021;
- n=8081n=8081, then the number nn can be represented as the sum 2020+2020+2020+20212020+2020+2020+2021;
- n=8079n=8079, then the number nn cannot be represented as the sum of the numbers 20202020 and 20212021.
Help Polycarp to find out whether the number nn can be represented as the sum of a certain number of numbers 20202020 and a certain number of numbers 20212021.Input
The first line contains one integer tt (1≤t≤1041≤t≤104) — the number of test cases. Then tt test cases follow.
Each test case contains one integer nn (1≤n≤1061≤n≤106) — the number that Polycarp wants to represent as the sum of the numbers 20202020 and 20212021.Output
For each test case, output on a separate line:
- “YES” if the number nn is representable as the sum of a certain number of 20202020 and a certain number of 20212021;
- “NO” otherwise.
You can output “YES” and “NO” in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).
Example
input
5
1
4041
4042
8081
8079
output
NO
YES
YES
YES
NO
我的题解
#include<iostream>#include<cstdio>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
long a;
cin>>a;
if(a%2020>a/2020)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}