比直接随高明的随机方式
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s
",__LINE__,__FUNCTION__)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define fir first
#define sec second
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
if(nega==-1) return -ans;
return ans;
}
typedef pair<int,int> pii;
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i],"
"[i==(int)x.size()-1]);}
char get1(){return "aeiou"[rnd()%5];}
char get2(){return rnd()%26+97;}
signed main()
{
for(int _=1;_<=1000;_++)
{
for(int i=1;i<=7;i++)
{
char ch=rnd()%5<=1?get1():get2();
printf("%c",ch-(i==1)*32);
}
cout<<"
";
}
return 0;
}