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

最新推荐文章于 2024-10-03 23:33:17 发布

jdklll

最新推荐文章于 2024-10-03 23:33:17 发布

阅读量75

点赞数

本文链接：https://blog.csdn.net/jdklll/article/details/123191889

版权

#include <bits/stdc++.h>
using namespace std;

int sit[5][5] = {0,-1, 1, 1,-1
			   , 1, 0,-1, 1,-1
			   ,-1, 1, 0,-1, 1
			   ,-1,-1, 1, 0, 1
			   , 1, 1,-1,-1, 0};
int a[210], b[210];

int main()
{
	int i, j, t;
	int n, na, nb;
	int suma = 0, sumb = 0;
	scanf("%d%d%d", &n, &na, &nb);

	for (i = 0; i < na; i++)
		scanf("%d", &a[i]);
	for (i = 0; i < nb; i++)
		scanf("%d", &b[i]);

	i = 0; j = 0;
	while (n--)
	{
		if (sit[a[i]][b[j]] == 1) suma ++;
		else if (sit[a[i]][b[j]] == -1) sumb ++;
		if (++i == na) i = 0;
		if (++j == nb) j = 0;
	}
	printf ("%d %d\n", suma, sumb);

	return 0;
}