麻烦大佬帮忙看看,谢谢

P1328 [NOIP2014 提高组] 生活大爆炸版石头剪刀布

``` #include<iostream> using namespace std; int main(){ int n, p, q,s[210],f[210],j=0,g=0; int cnt=0, cmp=0; cin >> n >> p >> q; for (int i = 0; i < p; i++) { cin >> s[i]; } for (int i = 0; i < q; i++) { cin >> f[i]; } for (int k=0; k < n;j++,g++,k++) { if(j==p) j = 0; if(g==q) g = 0; if(s[j]==2&&(f[g]==0)){ cmp += 1; continue; } else if(f[g]==2&&(s[j]==0)){ cnt += 1; continue; } else if(s[j]==3&&((f[g]==0)||f[g]==1)){ cmp += 1; continue; } else if(f[g]==3&&((s[j]==0)||s[j]==1)){ cnt += 1; continue; } else if(s[j]==4&&((f[g]==2)||f[g]==3)){ cmp += 1; continue; } else if(f[g]==4&&((s[j]==2)||s[j]==3)){ cnt += 1; continue; } else{ if(s[j]>f[g]){ cnt+=1; continue; }else if(s[j]<f[g]){ cmp+=1; continue; } } } cout << cnt <<" "<< cmp << endl; system("pause"); return 0; } ``` 你可以参考一下,我用的方法是比较0,1,2,3,4大小的方法,排除特殊情况,要简单一些
by qhong @ 2023-07-17 13:52:09


|