TOj 3070. Encryption【水题】

3070. Encryption

---

Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 2882 Accepted Runs: 1310

---

You must have heard of an ancient encryption called Caesar cipher or 'shift cipher'. That is, given the plaintext and a number D, you should replace every character c in the plaintext with another character which is D places after c in the alphabet. For example, if D = 2, you should replace 'a' with 'c', replace 'b' with 'd', ... replace 'y' with 'a', and replace 'z' with 'b'.

Given the plaintext and D, you should output the cipher text.

Input

The first line is an integer T, the number of test cases. Then T cases follows.

Each case contains only one line, consists of the plaintext and the number D, separated by a space. You can assume there are only lower case letters in the plaintext, and the length is no more than 100. 0 ≤ D < 26.

Output

Output one line for each test case, indicating the cipher text.

Sample Input

2
tjucs 1
abcd 0

Sample Output

ukvdt
abcd

密码加密的一种方式，直接模拟就行了，注意取余

#include<bits/stdc++.h>
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		char x[1005];int n;
		scanf("%s%d",x,&n);
		for(int i=0;x[i]!=0;++i)
		{
			x[i]-='a';
			x[i]=(x[i]+n)%26;
			x[i]+='a';
			printf("%c",x[i]);
		}
		printf("\n");
	}
	return 0;
}