[Coursera]数据结构基础_Week3_栈与队列_Q1

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

int main()
{
int N;
cin >> N;
cin.get();
while (N--)
{
char s;
s=cin.get();
while (s != '\n') {
if (s >= 'a'&&s <= 'y')
s += 1;
else if (s >= 'A'&&s <= 'Y')
s += 1;
else if (s == 'z')
s = 'a';
else if (s == 'Z')
s = 'A';
cout << s;
s=cin.get();
}
cout << endl;
}
return 0;
}