Programming & Computer Science Answers

You are working as a software developer in a company named Blue Moons, Inc. Your
team has been assigned the task of developing software that would assist the users to store
and retrieve personal information. According to the requirement specifications, the
software should provide the functionality to store contact details of various people. It
should also enable the user to store the details of meetings and appointments. In addition,
the software should display reminders to alert the user for meetings and appointments.
As the software is required to assist the user for storing and retrieving personal
information, it has been named as Personal Assistant.

The Personal Assistant software should be designed to meet the following specifications:
 When the application is executed, a menu with the following options should be
displayed:
 Contact details
 Meetings/appointments
On selecting either of the preceding options, a submenu with the following options
should be displayed:
 Add new record
 Delete record


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. Every cell in the maze will contain a survival probability P.

Your task is to find the number of ways to place maximum number of rats, such that they are not able to reach other and at the same time their minimum survival probability is at least PS. As the result can be long, take modulus of the result with 1000000007

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<=T<=100

1<=|S|<=400, S will contains only lower case alphabets ('a'-'z').


Sample Input and Output

SNo. Input Output
1
2
bba
scca


Yes
No
Expert's answer

1<=T<=100

1<=|S|<=60, S will contains only lower case alphabets ('a'-'z')

Given a Fibonacci sequence (http://en.wikipedia.org/wiki/Fibonacci_number), start cancelling every Lth element. Wrap around and continue the cancellation until only one element remains. As the Fibonacci number will overflow in a traditional data type, take modulus of the number with 1000000007.

Design an ER diagram for the following situation:

An organization has two types of employees, salaried and wage earning. Both the types of
employees have some common properties, such as employee code, employee name, and
employee address. However, the salaried employees have other additional properties: basic,
allowance, and House Rent Allowance (HRA). The wage earning employees have distinct
properties that are daily wage and overtime.

Zeze has developed a new game called 2D-Zombie World. The objective of the game is to kill all zombies within a certain distance subject to certain conditions. More formally,

N represents the total number of zombies
D defines the Euclidean distance the player can move
P represents the initial energy level a player starts with
(X, Y) represents the position of the player
Ei defines the energy of the i-th zombie
(Xi, Yi) represents the position of the i-th zombie


If player's energy is equal to or greater than a zombie's energy AND the zombie is reachable in the 2D-space measured by the Euclidean distance, then the player is said to be capable of defeating the zombie.

Your task is to find out how many zombies a player can defeat.

Problem : Trace the Rats

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<=N<=350

Aij = {'O','X'}

1<=R<=N*N

1<=Xi<=N

1<=Yi<=N


Sample Input and Output
SNo. Input Output
1
3
O O X
O X O
O O X
4
1 1
1 2
2 1
3 2

Yes

2
3
O O X
O X O
O O X
4
1 1
1 2
2 1
2 3

No

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<=T<=1000

1<=N<=10000