Start: Jan, 04, 2017 19:40:00
2016年秋季学期程序设计基础期末考试
End: Jan, 04, 2017 21:40:00
Time elapsed:
Time remaining:

Problem_ID: G
Result: Accepted
Time: 217ms
Memory: 1700kB
Author: 2016210402110
In contest: 1084

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<iomanip>
using namespace std;
typedef long long ll;
int main()
{
	int t,n,m,q,x,y,z;
	char s[101][101];
	cin>>t;
	while(t--)
	{
		scanf("%d%d",&n,&m);
		for(int i = 0 ; i < n ; i++)
			scanf("%s",s[i]);
		scanf("%d",&q);
		while(q--)
		{
			scanf("%d%d%d",&x,&y,&z);
			if(z > 0)
			{
				if(((int)s[x][y])+ (z%26) >122)
					s[x][y] = s[x][y] + (z%26) -26;
				else s[x][y] = s[x][y] + (z%26);
			}
			else
			{
				z = -z;
				if(((int)s[x][y])- (z%26) <97)
					s[x][y] = s[x][y] - (z%26) +26;
				else s[x][y] = s[x][y] - (z%26);
			}
		}
		for(int i = 0 ; i < n ; i++)
		{
			for(int j = 0 ; j < m ; j++)
				printf("%c",s[i][j]);
			printf("\n");
		}
	}
}