Translation Problem !!!

 PROBLEM 34: Translation

Problem Reference: Codeforces

The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word s from Berlandish into Birlandish as t. Help him: find out if he translated the word correctly.

Input:

The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.

Output:

If the word t is a word s, written reversely, print YES, otherwise print NO.

Solution:

1. s = input()
2. t = input()
3.  
4. s1 = s[::-1]
5. if s1 == t:
6. print("YES")
7. else:
8. print("NO")

The above solution is in python language.

Examples

input

code
edoc

output

YES

input

abb
aba

output

NO

input

code
code

output

NO

Beautiful Matrix Problem !!!

 PROBLEM 29: Beautiful Matrix

Problem Reference: Codeforces 

You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:

1. Swap two neighboring matrix rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤ i < 5).
2. Swap two neighboring matrix columns, that is, columns with indexes j and j + 1 for some integer j (1 ≤ j < 5).

You think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.

Input:

The input consists of five lines, each line contains five integers: the j-th integer in the i-th line of the input represents the element of the matrix that is located on the intersection of the i-th row and the j-th column. It is guaranteed that the matrix consists of 24 zeroes and a single number one.

Output:

Print a single integer — the minimum number of moves needed to make the matrix beautiful.

Solution: 

@author Ajay

1. 
   
2. import java.util.*;
3. public class NewClass {
5. public static void main(String arg[])
6. {
7. Scanner s = new Scanner(System.in);
8. int a[][] = new int[10][10];
9. int t = 0 ,t1 = 0;
10. for(int i = 1 ; i <= 5 ; i++)
11. {
12. for(int j = 1 ; j <= 5 ; j++)
13. {
14. a[i][j] = s.nextInt();
15. }
16. }
18. for(int i = 1 ; i <= 5 ; i++)
19. {
20. for(int j = 1 ; j <= 5 ; j++)
21. {
22. if(a[i][j] == 1)
23. {
24. if(i < 3)
25. t = 3 - i;
26. else
27. t = i - 3;
29. if(j < 3)
30. t1 = 3 - j ;
31. else
32. t1 = j - 3 ;
33. }
34. }
35. }
37. System.out.println(t+t1);
40. }
42. }

The above solution is in java language.

Examples

input

0 0 0 0 0
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0

output

3

input

0 0 0 0 0
0 0 0 0 0
0 1 0 0 0
0 0 0 0 0
0 0 0 0 0

output

1