Files
Data-Structure/Algorithm/Bit/P12141 [蓝桥杯 2025 省 A] 假红黑树.cpp
2025-09-21 12:21:50 +08:00

29 lines
445 B
C++

#include <iostream>
#include <vector>
using namespace std;
int checkbin(long long s){
int js = 0;
while(s){
js += (s & 1);
s = s>> 1;
}
return js;
}
int main(){
int n;
cin >> n;
vector<long long> s(n);
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
s[i] = ( 1 << (a - 1) ) + (b - 1);
}
for(int i = 0; i < n; i++){
if(checkbin(s[i]) % 2 == 0) cout << "BLACK" << endl;
else cout << "RED" << endl;
}
return 0;
}