惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

宝玉的分享
宝玉的分享
小众软件
小众软件
J
Java Code Geeks
I
InfoQ
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
腾讯CDC
L
LangChain Blog
博客园 - 司徒正美
量子位
Y
Y Combinator Blog
C
Check Point Blog
T
Tailwind CSS Blog
D
DataBreaches.Net
Blog — PlanetScale
Blog — PlanetScale
N
Netflix TechBlog - Medium
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
F
Fortinet All Blogs
云风的 BLOG
云风的 BLOG
A
About on SuperTechFans
B
Blog RSS Feed
酷 壳 – CoolShell
酷 壳 – CoolShell
大猫的无限游戏
大猫的无限游戏
V
V2EX
阮一峰的网络日志
阮一峰的网络日志

Shiroha白羽的博客

Golang 踩坑 —— interface 为参数的时候传 nil 指针 Codeforces Round 925 (Div. 3) Codeforces Round 924 (Div. 2) Codeforces Round 923 (Div. 3) Codeforces Round 922 (Div. 2) Codeforces Round 921 (Div. 2) Educational Codeforces Round 161 (Rated for Div. 2) Codeforces Round 920 (Div. 3) Codeforces Round 919 (Div. 2) Hello 2024 Codeforces Round 918 (Div. 4) 个人备份的常用 macOS 清理命令 Codeforces Round 917 (Div. 2) Pinely Round 3 (Div. 1 + Div. 2) Educational Codeforces Round 160 (Rated for Div. 2) Codeforces Round 915 (Div. 2) Codeforces Round 914 (Div. 2) Codeforces Round 913 (Div. 3) Educational Codeforces Round 159 (Rated for Div. 2) Codeforces Round 912 (Div. 2) Codeforces Round 911 (Div. 2) CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Educational Codeforces Round 158 (Rated for Div. 2) Codeforces Round 910 (Div. 2) Codeforces Round 909 (Div. 3) Codeforces Round 908 (Div. 2) Educational Codeforces Round 157 (Rated for Div. 2) C++自定义的字面量 Codeforces Round 907 (Div. 2) Codeforces Round 916 (Div. 3)
Good Bye 2023
Shiroha · 2024-03-03 · via Shiroha白羽的博客

有两个人玩游戏,每次可以选择一个数组中的两个值,移除它们两个并添加一个 $\left \lfloor \frac{a_i + a_j}{2} \right \rfloor \times 2$

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#define int long long

void solve() {
vector<vector<int>> data(12);
data[1] = {9};
data[3] = {169, 196, 961};
data[5] = {16384, 31684, 36481, 38416, 43681};
data[7] = {1493284, 3214849, 3912484, 4239481, 4293184, 4932841, 9132484};
data[9] = {236759769, 297769536, 369677529, 526977936, 677925369, 769729536, 773562969, 796763529, 927567936, 956293776, 993762576};
data[11] = {
10948273956, 12395704896, 12899053476, 13056947289, 13769849025, 14909875236, 15072963984, 15890367249, 16385792049, 16795382409, 17250983649, 17592308496, 17805432969, 17869540329,
18096437529, 18543902976, 19036548729, 19936875204, 23897140569, 24091385796, 24196735809, 24371580996, 27939456801, 28347109956, 29137465809, 29163075984, 30524981796, 30896147529,
30965792841, 31489567209, 31528974096, 31829057649, 31899746025, 31957640289, 34507892169, 34860997521, 37869549201, 37918604529, 38495617209, 39276501489, 39564790281, 39784690521,
40217895936, 42513078969, 42750938169, 43596187209, 43608715929, 45192807396, 47031295689, 48913072569, 48963510729, 49218753609, 49327965801, 49918730625, 49956273081, 50329781649,
50473912896, 50824997136, 51436879209, 52349897601, 54197236809, 58396172409, 58730129649, 59380429761, 59438927601, 59632174809, 62391547089, 63975102489, 65378910249, 68135094729,
69713425089, 70152938496, 71489390625, 71985963204, 72153480996, 72195390864, 72953469801, 74902931856, 75318960249, 76921358409, 78031952964, 79495238601, 79542613089, 79910243856,
80319527649, 80356941729, 84701953296, 84703699521, 84992073156, 85970931264, 86293175049, 86939471025, 87965034921, 90127845369, 90163874529, 90248571396, 90372985641, 91302478569,
91534687209, 91625473809, 91987250436, 92305984761, 92504789316, 94829507136, 94971830625, 95971083264, 96438197025, 98015329476, 99270365184, 99764381025, 99853472016
};
int _;
cin >> _;
for (int tc = 0; tc < _; ++tc) {
int n;
cin >> n;
if (n <= 11) for (int i = 0; i < n; ++i) cout << data[n][i] << endl;
else for (int i = 0; i < n; ++i) {
cout << data[11][i];
for (int j = 11; j < n; ++j) cout << '0';
cout << endl;
}
}
}