0分求助!!!

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

有头文件的
by fukaluosidego @ 2023-07-21 15:45:58


```#include<bits/stdc++.h> using namespace std; int ans=0; int bns=0; int cai(int xa,int xb){ if(xa==0&&xb==1)bns++; if(xa==0&&xb==2)ans++; if(xa==0&&xb==3)ans++; if(xa==0&&xb==4)bns++; if(xa==1&&xb==0)ans++; if(xa==1&&xb==2)bns++; if(xa==1&&xb==3)ans++; if(xa==1&&xb==4)bns++; if(xa==2&&xb==0)bns++; if(xa==2&&xb==1)ans++; if(xa==2&&xb==3)bns++; if(xa==2&&xb==4)ans++; if(xa==3&&xb==0)bns++; if(xa==3&&xb==1)bns++; if(xa==3&&xb==2)ans++; if(xa==3&&xb==4)ans++; if(xa==4&&xb==0)ans++; if(xa==4&&xb==1)ans++; if(xa==4&&xb==2)bns++; if(xa==4&&xb==3)bns++; return 0; } int main(){ int n,a,b; int A[100],B[100]; cin>>n>>a>>b; for(int i=1;i<=a;i++){ cin>>A[i]; } for(int i=1;i<=b;i++){ cin>>B[i]; } if(a>b){ int c=a; }else{ int c=b; } int l=0,h=0; for(int i=1;i<=n;i++){ l++; h++; if(l>a){ l=1; } if(h>b){ h=1; } cai(A[l],B[h]); } cout<<ans<<" "<<bns; }``` 改了下
by fukaluosidego @ 2023-07-21 16:53:03


80分
by fukaluosidego @ 2023-07-21 16:53:56


数组开小了... ------------ ```cpp #include<bits/stdc++.h> using namespace std; int ans=0; int bns=0; int cai(int xa,int xb){ if(xa==0&&xb==1)bns++; if(xa==0&&xb==2)ans++; if(xa==0&&xb==3)ans++; if(xa==0&&xb==4)bns++; if(xa==1&&xb==0)ans++; if(xa==1&&xb==2)bns++; if(xa==1&&xb==3)ans++; if(xa==1&&xb==4)bns++; if(xa==2&&xb==0)bns++; if(xa==2&&xb==1)ans++; if(xa==2&&xb==3)bns++; if(xa==2&&xb==4)ans++; if(xa==3&&xb==0)bns++; if(xa==3&&xb==1)bns++; if(xa==3&&xb==2)ans++; if(xa==3&&xb==4)ans++; if(xa==4&&xb==0)ans++; if(xa==4&&xb==1)ans++; if(xa==4&&xb==2)bns++; if(xa==4&&xb==3)bns++; return 0; } int main(){ int n,a,b; int A[201],B[201]; cin>>n>>a>>b; for(int i=1;i<=a;i++){ cin>>A[i]; } for(int i=1;i<=b;i++){ cin>>B[i]; } if(a>b){ int c=a; }else{ int c=b; } int l=0,h=0; for(int i=1;i<=n;i++){ l++; h++; if(l>a){ l=1; } if(h>b){ h=1; } cai(A[l],B[h]); } cout<<ans<<" "<<bns; } ```
by Xiao_kong @ 2023-08-01 09:15:55


```cpp #include<bits/stdc++.h> using namespace std; int df[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 main() { int n,na,nb; int ans=0,cnt=0; scanf("%d%d%d",&n,&na,&nb); int a[205],b[205]; for(int i=1;i<=na;i++) { scanf("%d",&a[i]); } for(int i=1;i<=nb;i++) { scanf("%d",&b[i]); } int i=1; int j=1; for(int c=1;c<=n;c++) { if(i>na) i=1; if(i>nb) j=1; ans+=df[a[i]][b[j]]; cnt+=df[b[j]][a[i]]; } printf("%d %d",ans,cnt); return 0; } ```
by zhw20 @ 2023-08-11 09:40:45


~~其实满分~~
by zhw20 @ 2023-08-11 09:42:32


|