1 solutions
-
0
C++ :
#include <cstdio> using namespace std; int rs[20][20],n,na,nb,a[20010],b[20010],ra,rb; int cal(int a,int b){ if(a%b==0){ return b; } return a%b; } int main(){ rs[0][2]=1; rs[0][3]=1; rs[1][0]=1; rs[1][3]=1; rs[2][1]=1; rs[2][4]=1; rs[3][2]=1; rs[3][4]=1; rs[4][0]=1; rs[4][1]=1; 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=1;i<=n;i++){ int ta=cal(i,na); int tb=cal(i,nb); ra+=rs[a[ta]][b[tb]]; rb+=rs[b[tb]][a[ta]]; } printf("%d %d\n",ra,rb); return 0; }
- 1
Information
- ID
- 18444
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By