115. Caesar Decoder
EasyStringModular Arithmetic
The text was encrypted by shifting each letter forward by k positions (wrapping around, keeping case). Decrypt it. Non-letters are unchanged.
Input format
Line 1: k Line 2: the encrypted text
Output format
The decrypted text.
Example 1
Input
3 Khoor, Zruog!
Output
Hello, World!
Example 2
Input
1 bcd
Output
abc
Constraints
0 ≤ k ≤ 10⁹
Read input from standard input and print the answer to standard output. Your code is judged against 4 test cases, most of them hidden.
Loading the MyLoginn IDE…