-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1742C.cpp
More file actions
124 lines (110 loc) · 1.62 KB
/
1742C.cpp
File metadata and controls
124 lines (110 loc) · 1.62 KB
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<climits>
#include<cstdint>
using namespace std;
#define ll long long int
#define test int t; cin>>t; while(t--)
void solve()
{
int r=0, b=0;
char m[8][8];
for(int i=0; i<8; i++)
{
for(int j=0; j<8; j++)
cin>>m[i][j];
//cout<<endl;
}
for(int i=0; i<8; i++)
{
for(int j=0; j<8; j++)
{
//for red
if(m[i][j]=='R')
r++;
else
r=0;
if(r==8)
{
cout<<"R"<<endl;
break;
}
}
if(r==8)
break;
}
for(int i=0; i<8; i++)
{
for(int j=0; j<8; j++)
{
//for blue
if(m[j][i]=='B')
b++;
else
b=0;
if(b==8)
{
cout<<"B"<<endl;
break;
}
}
if(b==8)
break;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
test
solve();
}
/*
4
....B...
....B...
....B...
RRRRRRRR
....B...
....B...
....B...
....B...
RRRRRRRB
B......B
B......B
B......B
B......B
B......B
B......B
RRRRRRRB
RRRRRRBB
.B.B..BB
RRRRRRBB
.B.B..BB
.B.B..BB
RRRRRRBB
.B.B..BB
.B.B..BB
........
........
........
RRRRRRRR
........
........
........
........
*/