Codeforces Round #806 (Div. 4)参考代码

最新推荐文章于 2022-11-01 10:44:40 发布

My_sort.

最新推荐文章于 2022-11-01 10:44:40 发布

阅读量391

点赞数 1

分类专栏： CF 文章标签： c++ 算法

本文链接：https://blog.csdn.net/guajiProMax/article/details/125755456

版权

Codeforces Round #806 (Div. 4)
A.YES or YES?:

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

void solve()
{
	char a[4];
	scanf("%s",a+1);
	if((a[1]=='Y'||a[1]=='y')&&(a[2]=='E'||a[2]=='e')&&(a[3]=='s'||a[3]=='S'))cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}

int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}

B.ICPC Balloons

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

void solve()