304 North Cardinal St.
Dorchester Center, MA 02124

# A String Game CodeChef Solution

## A String Game CodeChef Solution in C++14

``````#include <iostream>
using namespace std;#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

using namespace std;

struct PairHash {inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }};

// speed
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);

// alias
using ll = long long;
using ld = long double;
using ull = unsigned long long;

// constants
const ld PI = 3.14159265358979323846;  /* pi */
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 202020;
const ll mod = 1e9 + 7;

// typedef
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ld> vld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef deque<ll> dqll;
typedef deque<pll> dqpll;
typedef pair<string, string> pss;
typedef vector<pss> vpss;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;
typedef unordered_map<pll, ll, PairHash> umpll;

// macros
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define INF(a) memset(a,0x3f3f3f3f3f3f3f3fLL,sizeof(a))
#define ASCEND(a) iota(all(a),0)
#define sz(x) ll((x).size())
#define BIT(a,i) (a & (1ll<<i))
#define BITSHIFT(a,i,n) (((a<<i) & ((1ll<<n) - 1)) | (a>>(n-i)))
#define pyes cout<<"YES\n";
#define pno cout<<"NO\n";
#define endl "\n"
#define pneg1 cout<<"-1\n";
#define ppossible cout<<"Possible\n";
#define pimpossible cout<<"Impossible\n";
#define TC(x) cout<<"Case #"<<x<<": ";
#define X first
#define Y second

// utility functions
template <typename T>
void print(T &&t)  { cout << t << "\n"; }
template<typename T>
void printv(vector<T>v){ll n=v.size();rep(i,0,n){cout<<v[i];if(i+1!=n)cout<<' ';}cout<<endl;}
template<typename T>
void printvln(vector<T>v){ll n=v.size();rep(i,0,n)cout<<v[i]<<endl;}
void fileIO(string in = "input.txt", string out = "output.txt") {freopen(in.c_str(),"r",stdin); freopen(out.c_str(),"w",stdout);}
template<typename T>
template<typename T, typename U>
template<typename T, typename U>

struct Combination {
vll fac, inv;
ll n, MOD;

ll modpow(ll n, ll x, ll MOD = mod) { if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

Combination(ll _n, ll MOD = mod): n(_n + 1), MOD(MOD) {
inv = fac = vll(n,1);
rep(i,1,n) fac[i] = fac[i-1] * i % MOD;
inv[n - 1] = modpow(fac[n - 1], MOD - 2, MOD);
rrep(i,1,n - 2) inv[i] = inv[i + 1] * (i + 1) % MOD;
}

ll fact(ll n) {return fac[n];}
ll nCr(ll n, ll r) {
if(n < r or n < 0 or r < 0) return 0;
return fac[n] * inv[r] % MOD * inv[n-r] % MOD;
}
};

struct Matrix {
ll r,c;
vvll matrix;
Matrix(ll r, ll c, ll v = 0): r(r), c(c), matrix(vvll(r,vll(c,v))) {}

Matrix operator*(const Matrix& B) const {
Matrix res(r, B.c);
rep(i,0,r) rep(j,0,B.c) rep(k,0,B.r) {
res.matrix[i][j] = (res.matrix[i][j] + matrix[i][k] * B.matrix[k][j] % mod) % mod;
}
return res;
}

Matrix copy() {
Matrix copy(r,c);
copy.matrix = matrix;
return copy;
}

Matrix pow(ll n) {
assert(r == c);
Matrix res(r,r);
Matrix now = copy();
rep(i,0,r) res.matrix[i][i] = 1;
while(n) {
if(n & 1) res = res * now;
now = now * now;
n /= 2;
}
return res;
}
};

// geometry data structures
template <typename T>
struct Point {
T y,x;
Point(T y, T x) : y(y), x(x) {}
Point(pair<T,T> p) : y(p.first), x(p.second) {}
Point() {}
void input() {cin>>y>>x;}
friend ostream& operator<<(ostream& os, const Point<T>& p) { os<<p.y<<' '<<p.x<<'\n'; return os;}
Point<T> operator+(Point<T>& p) {return Point<T>(y + p.y, x + p.x);}
Point<T> operator-(Point<T>& p) {return Point<T>(y - p.y, x - p.x);}
Point<T> operator*(ll n) {return Point<T>(y*n,x*n); }
Point<T> operator/(ll n) {return Point<T>(y/n,x/n); }
bool operator<(const Point &other) const {if (x == other.x) return y < other.y;return x < other.x;}
Point<T> rotate(Point<T> center, ld angle) {
ld si = sin(angle * PI / 180.), co = cos(angle * PI / 180.);
ld y = this->y - center.y;
ld x = this->x - center.x;

return Point<T>(y * co - x * si + center.y, y * si + x * co + center.x);
}
ld distance(Point<T> other) {
T dy = abs(this->y - other.y);
T dx = abs(this->x - other.x);
return sqrt(dy * dy + dx * dx);
}

T norm() { return x * x + y * y; }
};

template<typename T>
struct Line {
Point<T> A, B;
Line(Point<T> A, Point<T> B) : A(A), B(B) {}
Line() {}

void input() {
A = Point<T>();
B = Point<T>();
A.input();
B.input();
}

T ccw(Point<T> &a, Point<T> &b, Point<T> &c) {
T res = a.x * b.y + b.x * c.y + c.x * a.y;
res -= (a.x * c.y + b.x * a.y + c.x * b.y);
return res;
}

bool isIntersect(Line<T> o) {
T p1p2 = ccw(A,B,o.A) * ccw(A,B,o.B);
T p3p4 = ccw(o.A,o.B,A) * ccw(o.A,o.B,B);
if (p1p2 == 0 && p3p4 == 0) {
pair<T,T> p1(A.y, A.x), p2(B.y,B.x), p3(o.A.y, o.A.x), p4(o.B.y, o.B.x);
if (p1 > p2) swap(p2, p1);
if (p3 > p4) swap(p3, p4);
return p3 <= p2 && p1 <= p4;
}
return p1p2 <= 0 && p3p4 <= 0;
}

pair<bool,Point<ld>> intersection(Line<T> o) {
if(!this->intersection(o)) return {false, {}};
ld det = 1. * (o.B.y-o.A.y)*(B.x-A.x) - 1.*(o.B.x-o.A.x)*(B.y-A.y);
ld t = ((o.B.x-o.A.x)*(A.y-o.A.y) - (o.B.y-o.A.y)*(A.x-o.A.x)) / det;
return {true, {A.y + 1. * t * (B.y - A.y), B.x + 1. * t * (B.x - A.x)}};
}

//@formula for : y = ax + b
//@return {a,b};
pair<ld, ld> formula() {
T y1 = A.y, y2 = B.y;
T x1 = A.x, x2 = B.x;
if(y1 == y2) return {1e9, 0};
if(x1 == x2) return {0, 1e9};
ld a = 1. * (y2 - y1) / (x2 - x1);
ld b = -x1 * a + y1;
return {a, b};
}
};

template<typename T>
struct Circle {
Point<T> center;
Circle() {}

void input() {
center = Point<T>();
center.input();
}

bool circumference(Point<T> p) {
return (center.x - p.x) * (center.x - p.x) + (center.y - p.y) * (center.y - p.y) == radius * radius;
}

bool intersect(Circle<T> c) {
T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
}

bool include(Circle<T> c) {
T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
}
};

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
all3 __exgcd(ll x, ll y) { if(!y) return {x,1,0}; auto [g,x1,y1] = __exgcd(y, x % y); return {g, y1, x1 - (x/y) * y1}; }
ll __lcm(ll x, ll y) { return x / __gcd(x,y) * y; }
ll modpow(ll n, ll x, ll MOD = mod) { n%=MOD; if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

ll dp[33][33];

ll helper(ll l, ll r, vector<usll>& us) {
if(l > r) return 0;
if(dp[l][r] != -1) return dp[l][r];
ll& res = dp[l][r] = 0;
usll now;
rrep(i,l,r) {
for(auto& len : us[i]) {
if(i + len - 1 > r) continue;
now.insert(helper(l,i-1,us) ^ helper(i + len, r, us));
}
}

while(now.count(res)) res += 1;
return res;
}

string solve(string s, vs A) {
MINUS(dp);
vector<usll> cut(sz(s));
rep(i,0,sz(s)) {
rep(j,0,sz(A)) {
if(s.substr(i,min(sz(A[j]), sz(s) - i)) == A[j]) cut[i].insert(sz(A[j]));
}
}
return helper(0,sz(s) - 1, cut) ? "Teddy" : "Tracy";
}

int main() {
Code By Sumfi
cout.precision(12);
ll tc = 1;
cin>>tc;
rep(i,1,tc+1) {
string s;
cin>>s;
ll n;
cin>>n;
vs A(n);
print(solve(s,A));
}
return 0;
}

int main()
{
int t;
cin>>t;
while (t--)
{
int n,c=0;
cin>>n;
string s;
cin>>s;
for(int i=0;i<(n+1)/2;i++)
{
if(s[i]!=s[n-i-1])
c++;
}

cout<<(c+1)/2<<endl;
}

return 0;
}``````

## A String Game CodeChef Solution in PYTH 3

``````# cook your dish here
def grundy(g):
if g in gdic:
return(gdic[g])
lg = len(g)
subg=set()
for ln,w in words:
pos = g.find(w)
while pos >= 0:
gpre = grundy(g[:pos])
gpost = grundy(g[pos+ln:])
pos = g.find(w, pos+1)
if len(subg) == 0:
gdic[g] = 0
else:
mex = 0
while mex in subg:
mex += 1
gdic[g] = mex
return gdic[g]
for _ in range(int(input())):
game = input().strip()
n = int(input())
wordset = set(input().strip() for _ in range(n))
words = [(len(w), w) for w in wordset]
gdic = {'':0}
print('Teddy' if grundy(game) > 0 else 'Tracy')``````

## A String Game CodeChef Solution in C

``````#include<stdio.h>
#include<string.h>
char d[50][50],s[100];
int t,i,j,k,n,l,g[50][50],temp[100],len[100],le,u,c=0;
int match(char a[],char b[],int len)
{
int i;
for(i=0;i<len;i++) if(a[i]!=b[i]) return 0;
return 1;
}
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%s",s);
l=strlen(s);
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%s",d[i]),len[i]=strlen(d[i]);
for(i=0;i<l;i++)
g[i][i]=0;
for(le=1;le<=l;le++){
for(i=0;i<=(l-le);i++){
j=i+le;c++;
for(k=0;k<n;k++){
if(len[k]<=le){
for(u=i;u<=(j-len[k]);u++) if(match(s+u,d[k],len[k])){
temp[g[i][u]^g[u+len[k]][j]]=c;
}
}
}
for(k=0;temp[k]==c;k++); g[i][j]=k;
}
}
printf("%s\n",(!g[0][l])?"Tracy":"Teddy");
}
}``````

## A String Game CodeChef Solution in JAVA

``````
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main {

static TreeSet<String> dic;
static int[][] g;
static char[] s;

static int mex(int l, int r)
{
if(l > r)
return 0;
if(g[l][r] != -1)
return g[l][r];
TreeSet<Integer> x = new TreeSet<Integer>();
for(int i = l; i <= r; ++i)
{
String t = "";
for(int j = i; j <= r; ++j)
{
t += s[j];
if(dic.contains(t))
x.add(mex(l, i - 1) ^ mex(j + 1, r));
}
}

int k = 0; while(x.contains(k)) ++k;
return g[l][r] = k;
}

public static void main(String[] args) throws IOException
{
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);

int tc = sc.nextInt();
while(tc-->0)
{
s = sc.next().toCharArray();
dic = new TreeSet<String>();
int k = sc.nextInt();
while(k-->0)
g = new int[s.length][s.length];
for(int i = 0; i < s.length; ++i)
Arrays.fill(g[i], -1);
out.println(mex(0, s.length - 1) == 0 ? "Tracy" : "Teddy");
}
out.flush();
out.close();
}

static class Scanner
{
StringTokenizer st;

public String next() throws IOException
{
while (st == null || !st.hasMoreTokens())
return st.nextToken();
}

public int nextInt() throws IOException {return Integer.parseInt(next());}

public long nextLong() throws IOException {return Long.parseLong(next());}

public String nextLine() throws IOException {return br.readLine();}

public double nextDouble() throws IOException { return Double.parseDouble(next()); }

}
}``````

## A String Game CodeChef Solution in PYTH

``````def work():
cas = int(raw_input())
for j in range(cas):
initStr = raw_input()
n = int(raw_input())
dict = set()
lth = len(initStr)
dp = [[None for i in range(lth+1)] for j in range(lth+1)]
for i in range(n):
res = solve(0, len(initStr)-1, initStr, dict, dp)
if res == 0:
print "Tracy"
else:
print "Teddy"

def solve(st, ed, initstr, dic, dp):
if st > ed:
return 0
if dp[st][ed] is not None:
return dp[st][ed]
mex = set()
for i in range(st, ed+1):
for j in range(i, ed+1):
if initstr[i:j+1] in dic:
mex.add(solve(st, i-1, initstr, dic, dp) ^ solve(j+1, ed, initstr, dic, dp))
i = 0
while True:
if i not in mex:
break
i += 1

dp[st][ed] = i
return i

work()``````

## A String Game CodeChef Solution in C#

``````using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ProgrammingContest.CodeChef.Contest.December_2010_Challenge
{
class A_String_Game
{
static string[] dic;
static string s;
static List<int>[] ends;
static int[,] memo;

static int grundy(int a, int b)
{
if (a > b) return 0;
if (memo[a, b] >= 0) return memo[a, b];
//Console.WriteLine(s.Substring(a, b - a + 1));
List<int> g = new List<int>();
for (int i = a; i <= b; i++)
for (int j = 0; j < ends[i].Count && ends[i][j] <= b; j++)
{
int g1 = grundy(a, i - 1),
g2 = grundy(ends[i][j] + 1, b);
//Console.WriteLine("{0} {1}: {2} {3} ({4})", s1, s2, g1, g2, s);
}
for (int i = 0; ; i++) if (!g.Contains(i)) return memo[a, b] = i;
g.Sort();
for (int i = 0; i < g.Count; i++) if (g[i] != i) return memo[a, b] = i;
return memo[a, b] = g.Count;
}

public static void Main()
{
//Scanner scanner = Scanner.FromString(input);
Scanner scanner = Scanner.FromConsole();
int t = scanner.NextInt();
while (t-- > 0)
{
s = scanner.NextString();
int n = scanner.NextInt();
dic = scanner.NextStrings(n);
ends = new List<int>[s.Length];
memo = new int[s.Length, s.Length];
for (int i = 0; i < s.Length; i++)
for (int j = 0; j < s.Length; j++)
memo[i, j] = -1;
for (int i = 0; i < s.Length; i++) ends[i] = new List<int>();
for (int i = 0; i < dic.Length; i++)
{
for (int j = -1; (j = s.IndexOf(dic[i], j + 1)) >= 0; )
{
}
}
for (int i = 0; i < s.Length; i++) ends[i].Sort();

Console.WriteLine(grundy(0, s.Length-1) != 0 ? "Teddy" : "Tracy");
}
}

static string input = @"3
codechef
2
code
chef
foo
1
bar
mississippi
4
ssissi
mippi
mi
ppi
";

#region Scanner
public class Scanner : IDisposable
{
const int MAX_BUFFER_SIZE = 1024 * 1024 * 16;
const string DELIMITER = " \r\n\t";

int pos = 0, len = 0;
bool endStream = false;
int BufferSize = MAX_BUFFER_SIZE;
char[] buffer = new char[MAX_BUFFER_SIZE];

public enum Option { Buffering, NoBuffering }

{
this.stream = stream;
if (bufferingOption == Option.NoBuffering) BufferSize = 1;
}

{
pos = 0;
endStream = len == 0;
}

void SkipDelimiter()
{
while (!endStream && IsDelimiter(Peek())) NextChar();
}

static bool IsDelimiter(char c)
{
return DELIMITER.Contains(c);
}

bool Continue(char c)
{
return !endStream && !IsDelimiter(c);
}

char Peek()
{
return buffer[pos];
}

public char NextChar()
{
return buffer[pos++];
}

public string NextString()
{
SkipDelimiter();
StringBuilder res = new StringBuilder();
for (char c = NextChar(); Continue(c); c = NextChar()) res.Append(c);
return res.ToString();
}

public int NextInt()
{
SkipDelimiter();
int res = 0;
char c = NextChar();
int sign = 1;
if (c == '-') { sign = -1; c = NextChar(); }
for (; Continue(c); c = NextChar())
res = res * 10 + (c - '0');
return sign * res;
}

public long NextLong()
{
SkipDelimiter();
long res = 0;
char c = NextChar();
long sign = 1;
if (c == '-') { sign = -1; c = NextChar(); }
for (; Continue(c); c = NextChar())
res = res * 10 + (c - '0');
return sign * res;
}

public double NextDouble()
{
return double.Parse(NextString());
}

public int[] NextInts(int n)
{
int[] res = new int[n];
for (int i = 0; i < n; i++) res[i] = NextInt();
return res;
}

public long[] NextLongs(int n)
{
long[] res = new long[n];
for (int i = 0; i < n; i++) res[i] = NextLong();
return res;
}

public double[] NextDoubles(int n)
{
double[] res = new double[n];
for (int i = 0; i < n; i++) res[i] = NextDouble();
return res;
}

public string[] NextStrings(int n)
{
string[] res = new string[n];
for (int i = 0; i < n; i++) res[i] = NextString();
return res;
}

public static Scanner FromString(string s)
{
return new Scanner(new System.IO.StreamReader(new System.IO.MemoryStream(Encoding.ASCII.GetBytes(s))), Option.Buffering);
}

public static Scanner FromFile(string path)
{
}

public static Scanner FromConsole()
{
return new Scanner(Console.In, Option.Buffering);
}

public void Dispose()
{
stream.Close();
}
}
#endregion
}
}``````
##### A String Game CodeChef Solution Review:

In our experience, we suggest you solve this A String Game CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the A String Game CodeChef Solution.

Find on CodeChef

##### Conclusion:

I hope this A String Game CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.

Keep Learning!