#include <bits/stdc++.h>
using namespace std;
queue<int> w,c;
int n;
string t;
int main()
{
cin>>n>>t;
for(int i = 1; i <= n; i++)
{
if(t[i - 1] == 'W') w.push(i);
else c.push(i);
}
while(1)
{
if(w.empty() || c.empty()) break;
if(w.front() >= c.front())
{
int cf = c.front();
c.push(n + cf);
}
else
{
int wf = w.front();
w.push(n + wf);
}
w.pop();
c.pop();
}
if(w.empty()) cout<<"C"<<endl<<c.size();
else cout<<"W"<<endl<<w.size();
return 0;
}
#C. ljy 的狼人游戏
最新推荐文章于 2024-10-05 13:20:03 发布