//...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include<bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld",&a)
#define sf2(a,b) scanf("%lld %lld",&a,&b)
#define sf3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%lld",a)
#define pf2(a,b) printf("%lld %lld",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld",a,b,c)
#define nl printf("\n")
#define ll long long
#define pb push_back
#define MPI map<int,int>mp;
#define fr(i,n) for(i=0;i<n;i++)
#define fr1(i,n) for(i=1;i<=n;i++)
#define frl(i,a,b) for(i=a;i<=b;i++)
//freopen("Input.txt","r",stdin);
//freopen("Output.txt","w",stdout);
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
main()
{
long ts,cs=1;
cin>>ts;
while(ts--)
{
string s;
cin>>s;
long ar[10]={0},i,cnt=0,f=0,sz=s.size(),sum=0;
for(i=0; i<sz; i++)
{
sum+=(s[i]-'0');
ar[(s[i]-'0')%3]++;
}
if(sum%3==0)
{
if(ar[0]%2==0)
{
f=1;
}
}
else if(sum%3==1)
{
if(ar[1]!=0)
{
if(ar[0]%2==1)
{
f=1;
}
}
else
f=1;
}
else if(sum%3==2)
{
if(ar[2]!=0)
{
if(ar[0]%2==1)
{
f=1;
}
}
else
f=1;
}
printf("Case %ld: ",cs++);
if(f==0)
{
cout<<"S"<<endl;
}
else
{
cout<<"T"<<endl;
}
}
}
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include<bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld",&a)
#define sf2(a,b) scanf("%lld %lld",&a,&b)
#define sf3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%lld",a)
#define pf2(a,b) printf("%lld %lld",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld",a,b,c)
#define nl printf("\n")
#define ll long long
#define pb push_back
#define MPI map<int,int>mp;
#define fr(i,n) for(i=0;i<n;i++)
#define fr1(i,n) for(i=1;i<=n;i++)
#define frl(i,a,b) for(i=a;i<=b;i++)
//freopen("Input.txt","r",stdin);
//freopen("Output.txt","w",stdout);
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
main()
{
long ts,cs=1;
cin>>ts;
while(ts--)
{
string s;
cin>>s;
long ar[10]={0},i,cnt=0,f=0,sz=s.size(),sum=0;
for(i=0; i<sz; i++)
{
sum+=(s[i]-'0');
ar[(s[i]-'0')%3]++;
}
if(sum%3==0)
{
if(ar[0]%2==0)
{
f=1;
}
}
else if(sum%3==1)
{
if(ar[1]!=0)
{
if(ar[0]%2==1)
{
f=1;
}
}
else
f=1;
}
else if(sum%3==2)
{
if(ar[2]!=0)
{
if(ar[0]%2==1)
{
f=1;
}
}
else
f=1;
}
printf("Case %ld: ",cs++);
if(f==0)
{
cout<<"S"<<endl;
}
else
{
cout<<"T"<<endl;
}
}
}
কোন মন্তব্য নেই:
একটি মন্তব্য পোস্ট করুন