Codechef Code Crunch 2013 Dumbledore Army

Dumbledore Army Problem code: MRIU13

Submit My Submissions All Submissions

 

Problem description.

Alice and Bob are being held at Azkaban(Prison). They want to escape and join Dumbledore's Army.
Alice wants to tell Bob about the details of the plan but wants to keep their escape plan from Dementors(the guards).
So Alice encrypts the message before passing the chits to Bob's cell.
However Bob was careless and he disposed the chits in his cell's waste paper bin.
The clever Dementor found the chits but couldn't make out what they said.
So he hired a computer programmer to decode the message for him. Please help the Dementor to decypher the message.
The code key that Alice used for this simple coding is a one for one character substitution based upon a single arithmetic manipulation of the printable portion of the ASCII character set.

Input

The Encrypted message in a single line. The maximum number of charaters in a message is 100.
(DO NOT PRINT ANY PROMPT MESSAGE TO ENTER THE ENCRYPTED MESSAGE.)

Output

The decrypted message in a single line. (Do not print any other message other than the decrypted message.)

Example

SAMPLE INPUT 1
[YHUZMVYT'[V'HUPTHN\Z'MVYT3
SAMPLE OUTPUT 1
TRANSFORM TO ANIMAGUS FORM,

SAMPLE INPUT 2
HUK'LZJHWL'^OLU'[OL`'IYPUN'MVVK5
SAMPLE OUTPUT 2
AND ESCAPE WHEN THEY BRING FOOD.

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 10005
#define mod 1000000007
#define ll long long
#define INF 0x7fffffff
int n, m;
char s[maxn];
int main(){
    int cas = 1;
    int t;
    /*scanf("%d", &t);
    while (t--){
        scanf("%d", &n);
        printf("%I64d\n", f[n]);
    }*/
    while (~scanf("%s", s)){
        for (int i = 0; i < strlen(s); i++)printf(i == n - 1 ? "%c\n" : "%c", s[i] - 7);
    }
    return 0;
}