-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2578.cpp
66 lines (61 loc) · 1.36 KB
/
2578.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <iostream>
#include <vector>
using namespace std;
static int N = 5;
static int M = 25;
vector<vector<int>> board(N, vector<int>(N, 0));
bool isBingo(){
int cnt_bingo = 0;
for(int i = 0; i<N; i++){
int tempX = 0;
int tempY = 0;
for(int j = 0; j<N; j++){
if(board[i][j] == 0)
tempX++;
if(board[j][i] == 0)
tempY++;
}
if(tempX == N)
cnt_bingo++;
if(tempY == N)
cnt_bingo++;
}
if(board[0][0]+board[1][1]+board[2][2]+board[3][3]+board[4][4] == 0)
cnt_bingo++;
if(board[0][4]+board[1][3]+board[2][2]+board[3][1]+board[4][0] == 0)
cnt_bingo++;
if(cnt_bingo >= 3)
return true;
else
return false;
}
void bingo(int n){
for(int i = 0; i<N; i++){
for(int j = 0; j<N; j++){
if(board[i][j] == n){
board[i][j] = 0;
break;
}
}
}
}
int main(){
vector<int> count(25, 0);
int answer = 0;
for(int i = 0; i<N; i++) {
for (int j = 0; j < N; j++) {
cin >> board[i][j];
}
}
for(int i = 0; i<M; i++){
cin >> count[i];
}
for(int i = 0; i<M; i++){
bingo(count[i]);
answer++;
if(isBingo()){
cout << answer;
break;
}
}
}