题解,但是打表(doge)

陈志轩  •  7个月前


首先需要打表代码(

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[114];
signed main(){
	for (int i = 1;i <= 100;i++){
		a[i] += 2 * i + 1;
		a[i % 100 + 1] += a[i] / 2;
		a[i] /= 2;
	}
	cout<<"{"<<a[1];
	for (int i = 2;i <= 100;i++){
		cout<<","<<a[i];
	}
	cout<<"}";
	return 0;
}

然后输出了这个玩意:

{200,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,99,101,103,105,107,109,111,113,115,117,119,121,123,125,127,129,131,133,135,137,139,141,143,145,147,149,151,153,155,157,159,161,163,165,167,169,171,173,175,177,179,181,183,185,187,189,191,193,195,197,199}

然后带到程序里:

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[114] = {114514,200,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,99,101,103,105,107,109,111,113,115,117,119,121,123,125,127,129,131,133,135,137,139,141,143,145,147,149,151,153,155,157,159,161,163,165,167,169,171,173,175,177,179,181,183,185,187,189,191,193,195,197,199};
signed main(){
	//注:数组第一个数是占位用的,可以不管他
	for (int i = 1;i <= 100;i++){
		cout<<a[i]<<'\n';
	}
	return 0;
}

A啦(doge)

注:图片里7分钟前的AC记录是正常解法(


评论:


陈志轩  •  7个月前


陈志轩  •  7个月前

new bee! 翻译:新的蜜蜂 O(shit) 别误会,是时间复杂度。


陈未一  •  3个月前