POJ 1298 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj1298
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int main()
{
std::ios::sync_with_stdio(false);
string start, line, end;
while (getline(cin, start) && start == "START")
{
getline(cin, line);
getline(cin, end);
// cin >> end;
// cout << "end:" << end << endl;
assert (end == "END");
for (int i = 0; i < line.size(); ++i)
{
if (line[i] >= 'A' && line[i] <= 'Z')
{
cout << (char)('A' + ((line[i] - 'A' + 26 - 5) % 26));
}
else
{
cout << line[i];
}
}
cout << endl;
}
assert (start == "ENDOFINPUT");

return 0;
}