POJ 3749 破译密码

/*简单的凯撒密码求明文的题目，模拟*/

/* 字符密码：包含凯撒密码、移位变换、仿射变换--------1.明文变密文（模拟）2.密文变明文（移位变换、仿射变换）*/

#include<functional>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<list>
#include<set>
#include<map>

using namespace std;

char a[210],c;

int main()
{
    while(1){
      while(cin>>a&&strcmp(a,"START")){
        if(!strcmp(a,"ENDOFINPUT")) break;
      }
      if(!strcmp(a,"ENDOFINPUT")) break;
      getchar();
      while((c=getchar())!='\n'){
        if(c>='A'&&c<='Z'){
          c-=5;
          if(c<'A') c+=26;
        }
          cout<<c;
      }
        cout<<endl;
        while(cin>>a&&strcmp(a,"END"));
    }
    return 0;
}