这道题是一道数学题,t秒能产生的最多字符最快可以O(1)算出(头文件快读快出省了)
int n=read();
int num[37]={0,1,2,3,4,5,6,7,8,9,10,11,12,13,15,18,21,24,28,32,36,40,45,50,55,63,72,84,96,112,128,144,160,180,200,225};
signed main(){
if(n<=35)print(num[n]);
else print(num[(n-25)%11+25]<<((n-25)/11<<1));
return~EOF;
}
证明略,反正它是对的就对了,正解可以O(1)算出吗,求助