A
给出 n 个数,要求第 i 个数与第 i+1 个数与 ai 个相同
#include <iostream>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
string a, b, c;
int Maps[1005],maxsize = 0;
void cmpt(string &a, string &b,int size)
{
b = a;
b[size] = (b[size] + 1) > 'z' ? 'a' : b[size] + 1;
cout << b << endl;
a = b;
}
int main()
{
//string a, b, c;
int cases;
cin >> cases;
int t;
a = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"+ "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
while (cases--)
{
cin >> t;
maxsize = 0;
for (int i = 0; i < t; i++)
{
cin >> Maps[i];
maxsize = max(Maps[i], maxsize);
}
cout << a << endl;
for (int i = 0; i < t; i++)
{
cmpt(a, b, Maps[i]);
//a = b;
}
}
}