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

https://www.luogu.com.cn/problem/P1328

---

模拟

---

橙色题

---

代码:  

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200 + 10;
int n, na, nb, a[MAXN], b[MAXN], cnta, cntb;
int vs[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()
{
    cin >> n >> na >> nb;
    for(int i = 0; i < na; i++) cin >> a[i];
    for(int i = 0; i < nb; i++) cin >> b[i];
    for(int i = 0; i < n; i++)
    {
        cnta += vs[a[i % na]][b[i % nb]]; //周期循环 
        cntb += vs[b[i % nb]][a[i % na]]; //用取余很巧妙地让a数组和b数组不会超过边界
        //注意两个人的a数组和b数组位置不一样

    }
    cout << cnta << " " << cntb << endl;
    return 0;
}

 

 

标签：NOIP2014,int,na,nb,cin,++,vs,P1328,剪刀
来源： https://www.cnblogs.com/2elaina/p/16452552.html