【NOIP2015】day1第一题：生活大爆炸版 石头剪刀布

#include<cstdio>#include<cstdlib>using namespace std;#define MAXN 210int r[5][5]={0,0,1,1,0,             1,0,0,1,0,             0,1,0,0,1,             0,0,1,0,1,             1,1,0,0,0,            };int a[MAXN],b[MAXN];int main(void){    freopen("in.txt","r",stdin);    int n,na,nb;int suma=0,sumb=0;    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]);for(int i=0;i<n;i++){int c=a[i%na+1],d=b[i%nb+1];printf("%d %d %d\n",c,d,r[c][d]);suma+=r[c][d];sumb+=r[d][c];}printf("%d %d",suma,sumb);    return 0;}