生活大爆炸版石头剪刀布

• 这道题十分简单，只需要列出所有的条件并判断即可，然后循环一下他们呢出题的规律，就可以了，下面是代码

//rps
#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
int n,na,nb,wina,winb;
int a[205],b[205];
void Judge(int x,int y)
{
    if(x==y) return;
    if(x==0){
        if(y==1) winb++;
        else if(y==2) wina++;
        else if(y==3) wina++;
        else if(y==4) winb++;
    }
    else if(x==1){
        if(y==0) wina++;
        else if(y==2) winb++;
        else if(y==3) wina++;
        else if(y==4) winb++;
    }
    else if(x==2){
        if(y==0) winb++;
        else if(y==1) wina++;
        else if(y==3) winb++;
        else if(y==4) wina++;
    }
    else if(x==3){
        if(y==0) winb++;
        else if(y==1) winb++;
        else if(y==2) wina++;
        else if(y==4) wina++;
    }
    else if(x==4){
        if(y==0) wina++;
        else if(y==1) wina++;
        else if(y==2) winb++;
        else if(y==3) winb++;
    }
    return;
}
int main()
{
//  freopen("rps.in","r",stdin);
//  freopen("rps.out","w",stdout);
    scanf("%d%d%d",&n,&na,&nb);
    for(int i=1;i<=na;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=nb;i++)
        scanf("%d",&b[i]);
    int nowa=1,
        nowb=1;
    while(n--){
        if(nowa>na)
            nowa=1;
        if(nowb>nb)
            nowb=1;
        Judge(a[nowa],b[nowb]);
        nowa++;
        nowb++;
    }
    printf("%d %d",wina,winb);
    return 0;
}