-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path1.cpp
46 lines (40 loc) · 1.19 KB
/
1.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
#include <bits/stdc++.h>
#define f first
#define s second
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
signed main(){
freopen("input.txt", "r", stdin);
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
string nxt;
int ans =0;
while(getline(cin, nxt)){
int r = 0;
for(int i = 0; i < 7; i++){
if(nxt[i] == 'B'){
r |= (1 << 7-i-1);
}
}
int c = 0;
for(int i = 7; i < 10; i++){
if(nxt[i] == 'R'){
c |= (1 << 10-i-1);
}
}
ans = max(ans, 8 * r + c);
}
cout << ans << endl;
return 0;
}