0
已解决
贾智衡
高级守护
高级守护
题目链接: 酷町堂:5258
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
string a,b;
int j,k,A,B,D;
int main() {
cin>>a>>b;
int n,nt=a.size(),nq=b.size();
cin>>n;
for(int i=0; i<n; i++) {
if(a[i%nt]=='B'&&b[i%nq]=='C'||a[i%nt]=='A'&&b[i%nq]=='B'||a[i%nt]=='C'&&b[i%nq]=='A') {
A++;
} else if(a[i%nt]=='C'&&b[i%nq]=='B'||a[i%nt]=='B'&&b[i%nq]=='A'||a[i%nt]=='A'&&b[i%nq]=='C') {
B++;
} else {
D++;
}
}
if(A>B)cout<<"酷酷赢 "<<A;
else if(A<B)cout<<"丁丁赢 "<<B;
else cout<<"平局";
return 0;
}