1298 The Hardest Problem Ever

#include <iostream>
#include <string>
using namespace std;

const int MAX_N = 200 + 10;
char A[MAX_N];

int main()
{
    int Len;
    char Tmp[20];

    while ( scanf( "%s", Tmp )!= EOF )
    {
        if( strcmp( Tmp, "ENDOFINPUT" ) == 0 )
            break;

        getchar( );
        gets( A );
        Len = strlen( A );
        for ( int i = 0; i < Len; ++i )
        {
            if ( A[i] >= ‘A‘ && A[i] <= ‘Z‘ )
                 A[i] = (( ( A[i]-‘A‘) - 5 + 26 ) % 26) + ‘A‘;
        }
        gets( Tmp );
        cout << A << endl;
    }

    return 0;
}