构造神题qaq
跪vfk
http://vfleaking.blog.163.com/blog/static/1748076342013229102430789/
从此卡自然溢出hash成为出题人的基本素养
(粘个代码跑路)
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn = 210000;
int n,m;
char str[maxn];
int main()
{
str[n=1]='a';
for(int i=1;i<=15;i++)
{
for(int j=n+1;j<=n+n;j++) str[j]=str[j-n]=='a'?'b':'a';
n<<=1;
}
m=n>>1;
str[++n]='a'; for(int j=2;j<=m;j++) str[++n]='a';
str[++n]='b'; for(int j=2;j<=m;j++) str[++n]='a';
printf("%d %d\n",n,m);
for(int i=1;i<=n;i++) putchar(str[i]);
putchar('\n');
return 0;
}