B. New Year‘s Number

B. New Year’s Number

原题链接:

(https://codeforces.com/contest/1475/problem/B)

题面:

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

input

5
1
4041
4042
8081
8079

output

NO
YES
YES
YES
NO

题解:

文中输入t 组数据,每一组数据输入一个n,求n是否可以等于几个(包括0个)2020和几个(包括0个)2021的和.

总共会出现两种情况。
1.n正好是2020的倍数或者2021的倍数。
2.n等于几个2020和几个2021的和。
在这里只详细讲述第二种情况

因为2021=2020+1,所以我们可以直接先用n÷2020得出来最多能有多少个2020,然后再用n-2020*(n÷2020),算出还差几个1,也就是要用2021替换多少个2020当其小于n÷2020时输出"YES",否则输出"NO".

在这里插入图片描述

代码

#include<iostream>
using namespace std;

int main()
{
	int t;
	cin>>t;
	
	while(t--)
	{
		int n;
		cin>>n;
		
		if(n%2020==0||n%2021==0)
		cout<<"YES"<<endl;
		
		else
		{
			int a,b;
			a=n/2020;
			b=n-a*2020;
			
			if(b>a)
			cout<<"NO"<<endl;
			else
			cout<<"YES"<<endl;
			
		}
	}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值