团体程序设计天梯赛 L1-072 刮刮彩票

最新推荐文章于 2024-09-26 09:13:29 发布

簡訫37

最新推荐文章于 2024-09-26 09:13:29 发布

阅读量155

点赞数 1

文章标签： c++

本文链接：https://blog.csdn.net/qq_63125992/article/details/122899342

版权

#include<iostream>
using namespace std;
int main()
{
	int arry[4][4], srry[6];
	int a, b;
	for (int i = 1; i < 4; i++)
		for (int j = 1; j < 4; j++)
		{
			cin >> arry[i][j];
			if (arry[i][j] == 0)
			{
				arry[i][j] = 9;
				a = i; b = j;
			}
		}
     bool pt;
	for (int i = 1; i < 4; i++)
		for (int j = 1; j < 4; j++)
		{
			pt = false;
			if (i !=a|| j!=b)
				if (arry[i][j]==arry[a][b])
				{
					arry[a][b]--; pt = true;
				}
			if (pt) { i = 0; break; }
		}
	for (int i = 0; i < 6; i++)
		cin >> srry[i];
	int n, sum;
	cin >> n;
	for (int i = 0; i < 6; i += 2)
		cout << arry[srry[i]][srry[i + 1]] << endl;
	if (n <= 3)
		sum = arry[n][3] + arry[n][1] + arry[n][2];
	else if (n <= 6)
		sum = arry[3][n-3] + arry[1][n-3] + arry[2][n-3];
	else if (n == 7)
		sum = arry[3][3] + arry[1][1] + arry[2][2];
	else
		sum = arry[1][3] + arry[2][2] + arry[3][1];
	int sg[19] = {10000,36,720,360,80,252,108,72,54,180,72,180,119,36,306,1080,144,1800,3600};
	cout << sg[sum-6];
}