3 solutions
-
2
#include<bits/stdc++.h> using namespace std; long n; int x=0; int main(){ cin>>n; char a[n][3]; string out[n]; for(int i=0;i<n;i++){ x=0; cin>>a[i][0]>>a[i][1]>>a[i][2]; if(a[i][0]!='J') x++; if(a[i][1]!='Q') x++; if(a[i][2]!='K') x++; if(x>2) out[i]="NO"; else out[i]="YES"; } for(int i=0;i<n;i++) cout<<out[i]<<endl; return 0; }
-
0
#include<bits/stdc++.h> using namespace std; int main(){ int t;cin>>t; int count[t]; char poker[t][3]; for(int i=0;i<t;i++){ for(int n=0;n<=2;n++){ cin>>poker[i][n]; } } for(int i=0;i<t;i++){ count[i]=0; } for(int i=0;i<t;i++){ if(poker[i][0]=='J'&&poker[i][1]=='Q'&&poker[i][2]=='K')count[i]=2; } for(int i=0;i<t;i++){ swap(poker[i][0],poker[i][1]); if(poker[i][0]=='J'&&poker[i][1]=='Q'&&poker[i][2]=='K'&&count[i]==0||count[i]==2)count[i]=1; else count[i]=0; swap(poker[i][0],poker[i][1]); } for(int i=0;i<t;i++){ swap(poker[i][0],poker[i][2]); if(poker[i][0]=='J'&&poker[i][1]=='Q'&&poker[i][2]=='K')count[i]=1; swap(poker[i][0],poker[i][2]); } for(int i=0;i<t;i++){ swap(poker[i][1],poker[i][2]); if(poker[i][0]=='J'&&poker[i][1]=='Q'&&poker[i][2]=='K')count[i]=1; swap(poker[i][1],poker[i][2]); } for(int i=0;i<t;i++){ if(count[i]==0)cout<<"NO"<<endl; else cout<<"YES"<<endl; } return 0; }
就这个极端暴力爽=) (好吧看的我眼花缭乱)
- 1
Information
- ID
- 903
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 6
- Tags
- # Submissions
- 120
- Accepted
- 35
- Uploaded By