PTA L1-072(C++)

Jarvis_stu

已于 2022-11-06 15:00:03 修改

阅读量254

点赞数

文章标签： c++ 算法数据结构

于 2022-11-06 14:56:34 首次发布

本文链接：https://blog.csdn.net/m0_73678116/article/details/127715900

版权

#include<iostream>
using namespace std;

int num[3][3];//创建二维数组
int mark[10];//判断哪一个数字没有出现
int praise[19]={10000,36,720,360,80,252,108,72,54,180,72,180,119,36,306,1080,144,1800,3600};

int main()
{

    for (int i = 0; i < 3; i++)
    {
        for (int j = 0; j < 3; j++)
        {
            cin >> num[i][j];
            mark[num[i][j]] = 1;
        }
    }
    
    int know;//找出最开始知道的数字
    for (int i = 1; i <= 9; i++) if (mark[i] == 0) know = i;
    
    for (int i = 0; i < 3; i++)
    {
        int x, y; cin >> x >> y;
        cout << num[x-1][y-1]<<endl;
    }

    int sum = 0;
    int choice; cin >> choice;
    if (choice <= 3)
    {
        for (int i = 0; i < 3; i++)
        {
            if (num[choice - 1][i] != 0) sum += num[choice - 1][i];
            else sum += know;
        }
    }
    else if (choice <= 6)
    {
        for (int i = 0; i < 3; i++)
        {
            if (num[i][choice-4] != 0) sum += num[i][choice-4];
            else sum += know;
        }
    }
    else if (choice == 7)
    {
        for (int i = 0; i < 3; i++)
        {
            if (num[i][i] != 0) sum += num[i][i];
            else sum += know;
        }
    }
    else if (choice == 8)
    {
        int index = 2;
        for (int i = 0; i < 3; i++)
        {
            if (num[i][index] != 0) sum += num[i][index];
            else sum += know;
            index--;
        }
    }
    cout<<praise[sum-6];
    return 0;
}