2019 Hangzhou Electric Multi School Game 9 6684 Rikka with game [game question]

2019 Hangzhou Electric Power Co., Ltd Scene nine 6684-Rikka with Game【 Game problem 】

General meaning ：

Give a string ,R First of all ,R I want to change the dictionary order of strings to smaller ,Y I want to change the dictionary order of strings , Everyone takes turns to revise , Every time everyone has two choices , One is to change the letter of a certain digit back to a digit , such as a->b, d->e, The second is to end the game . Ask what the modified string looks like .

Ideas ：

A game problem .
If the first is a~x The letter of , If you modify it first , Then the backhand ends the game directly . If you don't modify it first , Then the backhand goes directly to add the first , Then, no matter who changes it first , The backhand will end the game directly in the next round .
If the first is y, If you modify it first, it will become z , Then the backhand will end the game directly . If you don't modify it first , If later revised , That first hand will continue to be revised into a, Then it will be modified to b, At this point, the first hand will choose to end the game . So no matter who will not modify y Of .
If the first is z , First hand will definitely be modified to a, Later modified as b, Then finish the game first .

So the conclusion is , Find the first string that is not y The characters of , If it is z It is modified to b And end the game , Otherwise, end the game directly .

Code ：

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

int main() {
    
	int t;
	char ss[1000];
	scanf("%d",&t);
	while(t--) {
    
		scanf("%s",ss);
		int lenss = strlen(ss);
		for(int i = 0; i < lenss; i++) {
    
			if(ss[i] != 'y') {
    
				if(ss[i] == 'z') {
    
					ss[i] = 'b';
					break;
				}
				else
					break;
			}
		}
		puts(ss);
	}
	return 0;
}