Raj is a newbie to the programming and while learning the programming language he came to know the following rules:


· Each program must start with '{' and end with '}'.

· Each program must contain only one main function. Main function must start with ''.

· A program may or may not contain user defined function(s). There is no limitation on the number of user defined functions in the program. User defined function must start with '(' and end with ')'.

· Loops are allowed only inside the functions (this function can be either main function or user defined function(s)). Every loop must start with '{' and end with '}'.

· User defined function(s) are not allowed to be defined inside main function or other user defined function(s).

· Nested loops are allowed.

· Instructions can be anywhere inside the program.

· Number of instructions inside any user defined function must not be more than 100.



If any of the above conditions is not satisfied, then the program will generate compilation errors. Today Raj has written a few programs, but he is not sure about the correctness of the programs. Your task is to help him to find out whether his program will compile without any errors or not.




Input Format:

First line starts with T, number of test cases. Each test case will contain a single line L, where L is a program written by Raj.



Output Format:

Print "No Compilation Errors" if there are no compilation errors, else print "Compilation Errors".



Constraints:


1 ( { } ) )
{ ( { } ) }


No Compilation Errors
Compilation Errors
Compilation Errors

You are given a square matrix of dimension N. Let this matrix be called A. Your task is to rotate A in clockwise direction by S degrees, where S is angle of rotation. On the matrix, there will be 3 types of operations viz.



1.Rotation
Rotate the matrix A by angle S, presented as input in form of A S 2.Querying
Query the element at row K and column L, presented as input in form of Q K L3.Updation
Update the element at row X and column Y with value Z, presented as input in form of U X Y Z
Print the output of individual operations as depicted in Output Specification




Input Format:

Input will consist of three parts, viz.
1. Size of the matrix (N)
2. The matrix itself (A = N * N)
3. Various operations on the matrix, one operation on each line. (Beginning either with A, Q or U)

-1 will represent end of input.


Note:


•Angle of rotation will always be multiples of 90 degrees only.
•All Update operations happen only on the initial matrix. After update all the previous rotations have to be applied on the updated matrix


Output Format:

For each Query operation print the element present at K-L location of the matrix in its current state.



Constraints:


1

In a social network, online communities refer to the group of people with an interest towards the same topic. People connect with each other in a social network. A connection between Person I and Person J is represented as C I J. When two persons belonging to different communities connect, the net effect is merger of both communities which I and J belonged to.

We are only interested in finding out the communities with the member count being an even number. Your task is to find out those communities.


Input Format:

Input will consist of three parts, viz.

1. The total number of people on the social network (N)
2.Queries


•C I J, connect I and J
•Q 0 0, print the number of communities with even member-count
-1 will represent end of input.



Output Format:

For each query Q, output the number of communities with even member-count



Constraints:


1

Given a square maze (A) of dimension N, every entry (Aij) in the maze is either an open cell 'O' or a wall 'X'. A rat can travel to its adjacent locations (left, right, top and bottom), but to reach a cell, it must be open. Given the locations of R rats, can you find out whether all the rats can reach others or not?


Input Format:

Input will consist of three parts, viz.

1. Size of the maze (N)
2. The maze itself (A = N * N)
3. Number of rats (R)
4. Location of R rats (Xi, Yi)

Note:


•(Xi,Yi) will represents the location of the i-th rat.
•Locations are 1-index based.



Output Format:

Print "Yes" if the rats can reach each other, else print "No"



Constraints:


1

Alice and Bob are playing a game called "Stone Game". Stone game is a two-player game. Let N be the total number of stones. In each turn, a player can remove either one stone or four stones. The player who picks the last stone, wins. They follow the "Ladies First" norm. Hence Alice is always the one to make the first move. Your task is to find out whether Alice can win, if both play the game optimally.


Input Format:

First line starts with T, which is the number of test cases. Each test case will contain N number of stones.



Output Format:

Print "Yes" in the case Alice wins, else print "No".



Constraints:


1

The Codevita contest is going on my time will end at 11:59 on 13 august 2014
can anyone provide solution ,it could be in any language
Q)In the Byteland country a string "S" is said to super ascii string if and only if count of each character in the string is equal to its ascii value.

In the Byteland country ascii code of 'a' is 1, 'b' is 2 ...'z' is 26.

Your task is to find out whether the given string is a super ascii string or not.


Input Format:

First line contains number of test cases T, followed by T lines, each containing a string "S".



Output Format:

For each test case print "Yes" if the String "S" is super ascii, else print "No"



Constraints:


1

which book do i buy to prepare English

Hi.. any please send me tcs last 3 years placement papers on my email :- mauryashiv.11@gmail.com

could any one send me tcs last 3 years papers this week??