Codeforces Round #697 (Div. 3), problem: (B) New Year‘s Number,

B. New Year’s Number
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
You can output “YES” and “NO” in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).

Example
inputCopy
5
1
4041
4042
8081
8079
outputCopy
NO
YES
YES
YES
NO
暴力循环即可,或者进行第二重的循环优化即可
第一种:
双重循环:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    int t;
    cin>>t;
    while(t--)
    {
        bool flag=false;
        cin>>n;
        for(int i=0;i<=496;i++)
           for(int j=0;j<=495;j++)
             if((i*2020+j*2021)==n)
                { flag=true; break;}
        if(flag)
          cout<<"YES"<<endl;
        else
        {
            cout<<"NO"<<endl;
        }
        flag=false;
        
    }
   // system("pause");
}

第二种的优化:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    int t;
    cin>>t;
    while(t--)
    {
        bool flag=false;
        cin>>n;
        for(int i=0;i<=496;i++)
             if((n-i*2020)%2021==0&&(n-i*2020)>=0)
                { flag=true; break;}
        if(flag)
          cout<<"YES"<<endl;
        else
        {
            cout<<"NO"<<endl;
        }
        flag=false;
        
    }
    //system("pause");
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值