Problem:
Score : 100 points

Problem Statement

Snuke built an online judge to hold a programming contest.

When a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.
(The judge can return any two-character substring of S.)

Determine whether the judge can return the string AC as the verdict to a program.

Constraints

2 \leq |S| \leq 5

S consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.

Sample Input 1

BACD

Sample Output 1

Yes

The string AC appears in BACD as a contiguous substring (the second and third characters).

Sample Input 2

ABCD

Sample Output 2

No

Although the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.

Sample Input 3

CABD

Sample Output 3

No

Sample Input 4

ACACA

Sample Output 4

Yes

Sample Input 5

XX

Sample Output 5

No

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

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

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		List<char> L = new List<char>();
		List<int> Lidx = new List<int>();
		for(int i=0;i<N;i++) if(S[i] != 'x'){
			L.Add(S[i]);
			Lidx.Add(i);
		}
		
		if(L.Count == 0){
			Console.WriteLine(N % 2);
			return;
		}
		
		if(!IsPalindromic(L)){
			Console.WriteLine(-1);
			return;
		}
		
		int NN = L.Count;
		int l = NN/2;
		int r = NN/2;
		if(NN % 2 == 0) l--;
//		Console.WriteLine("{0} {1}",l,r);
		int ans = 0;
		while(l > 0){
			int cl = Lidx[l] - Lidx[l-1] - 1;
			int cr = Lidx[r+1] - Lidx[r] - 1;
			ans += Math.Abs(cl - cr);
			l--;
			r++;
		}
		int cl0 = Lidx[l];
		int cr0 = N - Lidx[r] - 1;
		ans += Math.Abs(cl0 - cr0);
		Console.WriteLine(ans);
	}
	
	bool IsPalindromic(List<char> L){
		int NN = L.Count;
		int l = NN/2;
		int r = NN/2;
		if(NN % 2 == 0) l--;
		while(l >= 0){
			if(L[l] != L[r]) return false;
			l--; r++;
		}
		return true;
	}
	
	int N;
	String S;
	public Sol(){
		S = rs();
		N = S.Length;
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}