HDU 1048 - The Hardest Problem Ever

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char s[105];
const char list[]={'V','W','X','Y','Z','A','B','C','D','E','F','G'
,'H','I','J','K','L','M','N','O','P','Q','R','S'
,'T','U'};
int main()
{
while(gets(s))
{
if(strcmp(s,"ENDOFINPUT")==0) break;
while(gets(s))
{
if(strcmp(s,"END")==0) break;
for(int i=0;s[i]!='\0';i++)
{
if(s[i]<='Z'&&s[i]>='A') cout<<list[s[i]-'A'];
else cout<<s[i];
}
cout<<endl;
}
}
}