模拟--P1328 生活大爆炸版石头剪刀布 题解

P1328 生活大爆炸版石头剪刀布

这也是打表么??

#include <iostream>
using namespace std;
static const auto y = []() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
return 0;
}();
int guize[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 role1[10000];
int role2[10000]; int main() {
// freopen("C:\\Users\\Sun\\Desktop\\testdata.in","r",stdin);
int socre1 = 0;
int socre2 = 0;
int total,rount1,rount2;
cin>>total>> rount1>>rount2;
for (int j = 0; j < rount1; ++j) {
cin>>role1[j];
}
for (int j = 0; j < rount2; ++j) {
cin>>role2[j];
}
for (int i = 0; i < total; ++i) {
socre1 += guize[role1[i%rount1]][role2[i%rount2]];
socre2 += guize[role2[i%rount2]][role1[i%rount1]];
}
cout<<socre1<<" "<<socre2;
}
上一篇:【转载】SDL2.0在mfc窗口中显示yuv的一种方法


下一篇:LeetCode32 Longest Valid Parentheses