10.Decipher my Ciphertext

                               Decipher my Ciphertext

In the language of cryptography, ciphertext refers to a message encoded with a particular key. Plaintext refers to the original, unencoded text. In this problem, both the ciphertext and the key are simply strings of upper-case characters. The ciphertext is generated from the plaintext by “adding” corresponding characters of the plaintext and the key together. If the plaintext is shorter than the key, only some of the key will be used. Similarly, if the plaintext is shorter than the key, the key will be used multiple times.

For example, to encode the plaintext “HELLO” with the key “CAT”:

Plaintext: HELLO

Key: CATCA

Ciphertext: KFFOP

And to encode the plaintext “DOG” with the key “FIDO”:

Plaintext: DOG

Key: FID

Ciphertext: JXK

To add two letters together, use the following convention: A=1, B=2, …, Z=26. If the sum of two letters is greater than 26, subtract 26 from the sum. For example: A + E = 1 + 5 = 6 = F, and D + X = 4 + 24 = 28 = 2 = B.

Given a ciphertext/key pair, determine the corresponding plaintext.

Input Format :

Input will consist of pairs of lines, with the first line being the ciphertext and the second line being the key. Both will consist of only uppercase letters.

Output Format:

For each ciphertext/key pair, print the corresponding plaintext message.

Example:

Sample Input:

HELLO

CAT

Sample Output:

KFFOP

code:

9.Fibonacci Roots

                                Fibonacci Roots

The first two terms in the Fibonacci sequence are 0 and 1, respectively, and each subsequent term is the sum of the previous two. Using this definition to calculate the first several terms in the sequence, we get

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

Let us define the Fibonacci roots of a positive integer n to be the two smallest consecutive Fibonacci numbers whose sum is greater than or equal to n.

Input Format:

Input consists of a single integer which corresponds to n.

Assumption:

Assume that n is less than or equal to 2000.

Output Format:

Output consists of integers, separated by a space.

Sample Input 1 :

31

Sample Output 1:

13 21

Sample Input 2 :

89

Sample Output 2:

34 55

code:

8.Vowel or Consonant

                            Vowel or Consonant

Write a program to determine whether the input character is a vowel or consonant.

Input and Output Format:

Input consists of a single character.

Output consists of a string --- “Vowel” / “Consonant” / “Not an alphabet”

Refer sample input and output for formatting specifications.

All text in bold corresponds to input and the rest corresponds to output.

Sample Input and Output 1:

Enter a character

a

Vowel

Sample Input and Output 2:

Enter a character

Z

Consonant

Sample Input and Output 3:

Enter a character

#

Not an alphabet

code:

7.Anagrams

Anagrams

Write a program to find whether the 2 given strings are anagrams or not.

Anagrams are words or phrases made by mixing up the letters of other words or phrases,

Input and Output Format:

Input consists of 2 string. Assume that all characters in the string are lowercase letters or spaces and the maximum length of the string is 100.

Refer sample input and output for formatting specifications.

All text in bold corresponds to input and the rest corresponds to output.

Sample Input and Output 1:

Enter the first string

anitha

Enter the second string

amphisoft

anitha and amphisoft are not anagrams

Sample Input and Output 2:

Enter the first string

the eyes

Enter the second string

they see

the eyes and they see are anagrams

code:

6.Zero Duplicates

Zero Duplicates

Write a program that will read in a list of numbers and will then print out the same list except numbers that have already been printed will be printed as a zero instead.

Input Format:

Input consists of n+1 integers where n is the number of elements in the list. The first integer corresponds to n. The remaining n integers correspond to the elements in the list.

Assume that the maximum value of n is 100.

Output Format:

Output consists of n integers on separate lines.

code :

5.The Next Palindrome

The Next Palindrome

A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer K, write the value of the smallest palindrome larger than K to output.

Input

The first line contains an integer, which corresponds to K. Assume that K is less than 200000.

Output

Output consists of a single integer, which corresponds to the smallest palindrome larger than K.

Sample Input 1:

808

Sample Output 1:

818

code:

4.TENNIS COURT

TENNIS COURT

They sent a request to the Chairman and he readily agreed but he asked to do it with minimal expenditure. He gave them square stones.

The tennis court in the college is rectangular in shape of size n*m metres. We need to pave the court with square stones. The square stone is of size a*a.

What is the least number of stones needed to pave the tennis court? It's allowed to cover the surface larger than the Tennis Court, but the court has to be covered. It's not allowed to break the stones. The sides of stones should be parallel to the sides of the court.

Input Format:

Input consists of 3 integers. The first integer corresponds to 'n', the length of the court. The second integer corresponds to 'm', the width of the court. The third integer corresponds to 'a', the side of the square stone.

Output Format:

Output consists of ta single integer k, where k is the least number of stones needed.

code: