我的想法是用vector做出9*9的陣列

之後用三個flag去check 行、列、九宮是否有1~9
 我將行、列的檢查寫在一起，使其更快

#include<iostream>
#include<vector>
using namespace std;

int main()
{
int num;
while (cin >> num)
{
vector< vector<int>> sudoku;
sudoku.resize(9);
for (int i = 0; i < 9; i++)
sudoku[i].resize(9);

for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
if (i == 0 && j == 0)
sudoku[i][j] = num;
else
cin >> sudoku[i][j];
}

int flagr = 1;
int flagc = 1;
vector<int> checkrow(9, 0);
vector<int> checkcol(9, 0);
for (int i = 0; i < 9; i++)
{

for (int j = 0; j < 9; j++)
{

if (checkrow[sudoku[i][j] - 1] == i)
checkrow[sudoku[i][j] - 1] = i + 1;
else
{
flagr = 0;
break;
}
if (checkcol[sudoku[j][i] - 1] == i)
checkcol[sudoku[j][i] - 1] = i + 1;
else
{
flagc = 0;
break;
}
}

}

int flagb = 1;
for (int i = 0; i < 3; i++)
{
vector<int> checkb(9, 0);
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 3; k++)
{

if (checkb[sudoku[i * 3 + j][i * 3 + k] - 1] == 0)
checkb[sudoku[i * 3 + j][i * 3 + k] - 1] = 1;
else
{
flagb = 0;
break;
}
}
}
}

if ((flagb + flagc + flagr) == 3)
cout << "yes\n";
else
cout << "no\n";
}

}