P1328 [NOIP2014 提高组] 生活大爆炸版石头剪刀布
题目链接
题目思路
用二维数组存每种情况的得分情况,然后枚举来计算分数
#include <iostream>
using namespace std;
int main()
{
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 n, na, nb;
cin >> n >> na >> nb;
int a[na], b[nb];
for (int i = 0; i < na; i++)
cin >> a[i];
for (int i = 0; i < nb; i++)
cin >> b[i];
int wa = 0, wb = 0;
for (int i = 0; i < n; i++)
{
wa += vs[a[i % na]][b[i % nb]];
wb += vs[b[i % nb]][a[i % na]];
}
cout << wa << " " << wb << endl;
return 0;
}
孤独本是常态

浙公网安备 33010602011771号