Noip 2014 生活大爆炸版石头剪刀布

模拟。

#include<cstdio>using namespace std;int n,na,nb,la,lb,ansa,ansb;int a[300][300],A[300],B[300];int main(){scanf("%d",&n);scanf("%d",&na); scanf("%d",&nb);for (int i=1;i<=na;i++) scanf("%d",&A[i]);for (int i=1;i<=nb;i++) scanf("%d",&B[i]);a[0][0]=0;a[0][1]=0;a[0][2]=1;a[0][3]=1;a[0][4]=0;a[1][0]=1;a[1][1]=0;a[1][2]=0;a[1][3]=1;a[1][4]=0;a[2][0]=0;a[2][1]=1;a[2][2]=0;a[2][3]=0;a[2][4]=1;a[3][0]=0;a[3][1]=0;a[3][2]=1;a[3][3]=0;a[3][4]=1;a[4][0]=1;a[4][1]=1;a[4][2]=0;a[4][3]=0;a[4][4]=0;for (int i=1;i<=n;i++){++la;++lb;if (la>na) la=1;if (lb>nb) lb=1;ansa+=a[A[la]][B[lb]];ansb+=a[B[lb]][A[la]];}printf("%d %d",ansa,ansb);return 0;}