Scribd
Upload
16 views2 pages

Leapfrog CH Source

Uploaded by

rp singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
16 views2 pages

Leapfrog CH Source

Uploaded by

rp singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include <bits/stdc++.

h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
#define Accepted 0
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fout(S,x) cout<<fixed<<setprecision(x)<<(S)<<endl
#define pb push_back
#define mp make_pair
#define present(c,x) ((c).find(x) != (c).end())
#define PI 3.141592653589793238462643383279502884197169399375105820974944
#define T() ll t;cin>>t;while(t--)
#define mem(input,b) memset(input,b,sizeof(input))
#define all(s) s.begin(),s.end()
#define lbi(input, val) (lower_bound(all(input), val) - input.begin())
#define ubi(input, val) (upper_bound(all(input), val) - input.begin())
#define ff first
#define ss second
#define pc(x) __builtin_popcount(x)
#define ln(x) (ll(log2(LD(x))))
#define dig(x) (ll(log10(LD(x)))+1)
#define ceil(input,b) (ll(ceil(LD(input)/LD(b))))
#define etm cerr << "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
<< '\n'
#define fread(input) freopen("input","r",stdin)
#define fwrite(b) freopen("b","w",stdout)
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names)
<< " : " << arg1<<" | ";__f(comma+1, args...);
}
ll MODpow(ll input,ll n,ll difference){ll res=1,y=input;while(n>0)
{if(n&1)res=(res*y)%difference;y=(y*y)%difference;n/=2;}return res%difference;}
template< class T > T _abs(T n) { return (n < 0 ? -n : n); }
template< class T > T _max(T input, T b) { return (!(input < b) ? input : b); }
template< class T > T _min(T input, T b) { return (input < b ? input : b); }
template< class T > T gcd(T input, T b) { return (b != 0 ? gcd<T>(b, input%b) :
input); }
template< class T > T lcm(T input, T b) { return (input / gcd<T>(input, b) * b); }
inline int fi(){int n=0;int ch=getchar();while(ch<'0'||
ch>'9')ch=getchar();while(ch>='0'&&ch<='9')n=(n<<3)+
(n<<1)+ch-'0',ch=getchar();return n;}
inline void fo(int input){char snum[20];int iterator=0;do{snum[iterator++]=input
%10+48;input=input/10;}while(input!=0);iterator=iterator-
1;while(iterator>=0)putchar(snum[iterator--]);putchar('\n');}
const int MOD=1e9+7,INF=1e9,MAXN=200005;
const ll INFLL =1e18;
const llu INFLLU=18446744073709551615ULL;
const ld EPS = 1e-12;
inline int inv(int input, int p = MOD) {return MODpow(input, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline void addMOD(int& input, int val, int p = MOD) {if ((input = (input + val))
>= p) input -= p;}
inline void subMOD(int& input, int val, int p = MOD) {if ((input = (input - val)) <
0) input += p;}

int main(){
freopen("input1.txt","r",stdin);
freopen("output1.txt","w",stdout);
fastio;
int tc;
cin>>tc;
for(int caseNo=1 ; caseNo<=tc ; caseNo++){
int emptyPos = 0, frogs = 0;
string arrangement;
cin >> arrangement;
for(int i=0 ; i<arrangement.size() ; i++){
if(arrangement[i] == '.')
emptyPos++;
if(arrangement[i] == 'B')
frogs++;
}

if( (emptyPos != 0 && frogs >= 2) || (emptyPos == 1 && frogs == 1) ){


printf("Case #%i: Y\n", caseNo);
continue;
}
printf("Case #%i: N\n", caseNo);
}
etm;
return Accepted;
}

You might also like