All submissions for this problem are available.
Tanish loves alphabets. He loves alphabets so much that he ignores all other characters.
Also, whenever he is given an alphabet he gives the next alphabet in alphabetical order in same case.
For example, for a-b,for d-e,for z-a.
Given a string guess what would be Tanish's answer.
- The first line of the input contains an integer N denoting the number of strings. N strings follow.
- For each string, output a single line containing Tanish's answer.
- 1 ≤ N ≤ 20
- 1 ≤ |s| ≤ 100 where |s| is the length of the string.
Input: 4 nun123 1234 retA34 ^ 56az Output: ovo sfuB ba
Example For the second string, there is no output as there are no alphabets.
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, PYP3, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.