ZCMU暑期训练四-A - Vus the Cossack and a Contest

最新推荐文章于 2020-09-01 17:16:44 发布

原创最新推荐文章于 2020-09-01 17:16:44 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

本文探讨了一个简单的编程问题：如何判断是否能用给定数量的笔和笔记本奖励所有竞赛参与者，每位参与者至少获得一份奖励。通过输入参与人数及奖品数量进行判断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Vus the Cossack holds a programming competition, in which nn people participate. He decided to award them all with pens and notebooks. It is known that Vus has exactly mm pens and kk notebooks.

Determine whether the Cossack can reward all participants, giving each of them at least one pen and at least one notebook.

Input
The first line contains three integers nn, mm, and kk (1≤n,m,k≤1001≤n,m,k≤100) — the number of participants, the number of pens, and the number of notebooks respectively.

Output
Print “Yes” if it possible to reward all the participants. Otherwise, print “No”.

You can print each letter in any case (upper or lower).

Examples
Input
5 8 6
Output
Yes
Input
3 9 3
Output
Yes
Input
8 5 20
Output
No
Note
In the first example, there are 55 participants. The Cossack has 88 pens and 66 notebooks. Therefore, he has enough pens and notebooks.

In the second example, there are 33 participants. The Cossack has 99 pens and 33 notebooks. He has more than enough pens but only the minimum needed number of notebooks.

In the third example, there are 88 participants but only 55 pens. Since the Cossack does not have enough pens, the answer is “No”.

题面：手速题；

#include<iostream>
using namespace std;
int main(){
	int n,m,k;
	cin>>n>>m>>k;
	if(n<=m&&n<=k){
		cout<<"Yes"<<endl;
	}else
	{
		cout<<"No"<<endl;
	}
	
	return 0;
}