- 【例31.1】 石头剪子布
22
- 2025-3-17 10:39:15 @
#include<bits/stdc++.h> using namespace std; int n,sum = 0,ans = 0; char a,b; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a>>b; if(a=='S'){ if(b=='J') sum++; if(b=='B') ans++; } if(a=='J'){ if(b=='B') sum++; if(b=='S') ans++; } if(a=='B'){ if(b=='S') sum++; if(b=='J') ans++; } } if(ans>sum) cout<<"xiaoke"; if(sum>ans) cout<<"xiaoyan"; if(sum==ans) cout<<"QAQ"; return 0; }
1 comments
-
xiance069 LV 4 @ 2025-3-17 10:45:11
#include<bits/stdc++.h> using namespace std; int main(){ int n,cnt1=0,cnt2=0; char a,b; cin>>n; while(n--){ cin>>a>>b; if(a=='S'){ if(b=='J') cnt1++; if(b=='B') cnt2++; } if(a=='J'){ if(b=='S') cnt1++; if(b=='B') cnt2++; } if(a=='b=B'){ if(b=='S') cnt1++; if(b=='J') cnt2++; } } if(cnt1>cnt2) cout<<"xiaoyan"; if(cnt1<cnt2) cout<<"xiaoke"; if(cnt1==cnt2) cout<<"QAQ"; return 0; } o-O
- 1
Information
- ID
- 97
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 4
- Tags
- # Submissions
- 30
- Accepted
- 18
- Uploaded By