解题报告『生活大爆炸版石头剪刀布（模拟）』-CSDN博客

虽说此题难度不大，但依然有着很精妙的做法。

比如下面这位大佬的代码：

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (register int i = (a); i <= (b); i++)

int n, Na, Nb, ans = 0, bns = 0;
int a[200 + 5], b[200 + 5], 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 read() {
    int x = 0, flag = 0;
    char ch = ' ';
    while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
    if (ch == '-') {
        flag = 1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = (x << 1) + (x << 3) + ch - '0';
        ch = getchar();
    }
    return flag ? -x : x;
}

void write(int x) {
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    if (x > 9) write(x / 10);
    putchar(x % 10 + '0');
}

int main() {
    n = read(), Na = read(), Nb = read();
    rep(i, 0, Na - 1) a[i] = read();
    rep(i, 0, Nb - 1) b[i] = read();
    rep(i, 0, n - 1) {
        ans += vs[a[i % Na]][b[i % Nb]];
        bns += vs[b[i % Nb]][a[i % Na]];
    }
    write(ans);
    printf(" ");
    write(bns);
    return 0;
}