Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: A+B
Description The Now Peter is involved in the new project concerning orthogonal strings. Peter proposed that two strings Q = Q_{1}Q_{2}…Q of equal length _{n}n are called orthogonal, if P ≠ _{i}Q for each i in the range 1.._{i}n. String S of length n is called orthogonal to set of strings V = ‹V_{1}, V_{2}, …, V› (each of length _{m}n too) if S is orthogonal to V for any _{j}j in range 1..m.Peter’s task is to invent the operation of B = T is a string _{b}C = T where _{c}c = (a + b) mod M.Your task is to find the orthogonal sum of two given strings Input The first line of the input file contains two integers: The last two lines contain strings A and B consist of small letters of English alphabet. It is guaranteed that A and B are orthogonal to V.Output Output the orthogonal sum of strings Sample Input
Sample Output
Source Northeastern Europe 2007, Northern Subregion |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator