Codeforces Round #426 (Div. 2)

来源：互联网发布：黑客网站源码编辑：程序博客网时间：2024/06/05 15:01

A. The Useless Toy

#include<bits/stdc++.h>#define ll long long using namespace std;int main(){ios::sync_with_stdio(0);cin.tie(0);char c1,c2;int n;cin>>c1>>c2;cin>>n;if(n%4==0){cout<<"undefined"<<'\n';} else if(n%4==1){if((c1=='^'&&c2=='>')||(c1=='>'&&c2=='v')||(c1=='v'&&c2=='<')||(c1=='<'&&c2=='^'))cout<<"cw"<<'\n';else if((c2=='^'&&c1=='>')||(c2=='>'&&c1=='v')||(c2=='v'&&c1=='<')||(c2=='<'&&c1=='^'))cout<<"ccw"<<'\n';else cout<<"undefined"<<'\n';}else if(n%4==2){cout<<"undefined"<<'\n';}else if(n%4==3){if((c1=='^'&&c2=='<')||(c1=='>'&&c2=='^')||(c1=='v'&&c2=='>')||(c1=='<'&&c2=='v'))cout<<"cw"<<'\n';else if((c2=='^'&&c1=='<')||(c2=='>'&&c1=='^')||(c2=='v'&&c1=='>')||(c2=='<'&&c1=='v'))cout<<"ccw"<<'\n';else cout<<"undefined"<<'\n';}return 0;}

B. The Festive Evening

#include<bits/stdc++.h>#define ll long long using namespace std;char s[1000010];map<char,int>  mp,mmp;int main(){ios::sync_with_stdio(0);cin.tie(0);int n,k;cin>>n>>k;for(int i=0;i<n;i++){cin>>s[i];mp[s[i]]++;}   int sum=0,ans=0;for(int i=0;i<n;i++){if(mp[s[i]]>0){if(mmp[s[i]]==0){mmp[s[i]]=1;sum++;ans=max(ans,sum); }mp[s[i]]--;}if(mp[s[i]]==0)  sum--;}if(ans<=k)  cout<<"NO"<<'\n';else cout<<"YES"<<'\n';return 0;}

C - The Meaningless Game

#include<bits/stdc++.h>#define ll long long using namespace std;int main(){ll n, x, y, c, q;scanf("%lld",&n);while(n--){scanf("%lld%lld",&x,&y);c = x * y;q = floor(pow(c,1/3.0)+0.5);if((q*q*q==x*y)&&(x%q==0)&&(y%q==0)){printf("Yes\n");}else printf("No\n"); } return 0;}

阅读全文

0 0