POJ1298 The Hardest Problem Ever

#include<iostream>
#include<string>
#include<algorithm>
#define max(a,b) (a>b?a:b)
#define abs(a) ((a)>0?(a):-(a))
#define min(a,b) (a<b?a:b)
using namespace std;
const int N=105;
int n,m;
char match[30]="VWXYZABCDEFGHIJKLMNOPQRSTU";
int main()
{
string s;
while(getline(cin,s),s!="ENDOFINPUT")
{
getline(cin,s);
for(int i=0;i<s.length();i++)
{
if(s[i]<='Z'&&s[i]>='A')
s[i]=match[s[i]-'A'];
}
cout<<s<<endl;
getline(cin,s);
}

return 0;
}