提出 #57073953

---

ソースコード 拡げる

#include <bits/stdc++.h>
// 针对于线上比赛的 C++ 语言模板
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;

//#undef ONLINE_JUDGE // 如果是交互要改动这里
#define int long long

#ifndef ONLINE_JUDGE
#define endl '\n'
#define debug(x, ...) printf(x, __VA_ARGS__)
#else
#define debug(x, ...)
#endif

void clear() {
	// 请在这里完善初始化代码
}

int n, a[100005], dp[1005][1005][2];
vector<int> frc[100005];

int dfs(int i, int now, int who) {
	if (i == n + 1) return 0;
	//if (dp[i][now][who] != -1) return dp[i][now][who];
	if (now == 1) {
		return dfs(i + 1, a[i + 1], who);
	}
	int ans = 0;
	for (auto j : frc[now]) {
		ans |= !dfs(i, j, who ^ 1);
	}
	return dp[i][now][who] = ans;
}
/*
1 1 2 2
*/
void solve() {
	cin >> n;
	int solve = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i]; int tot = 0;
		for (int j = 2; j * j <= a[i]; ++j) {
			while (a[i] %j == 0) {
				a[i] /= j;
				++tot;
			}
		}
		if (a[i] > 1) ++tot;
		solve ^= tot;
	}
	if (solve) cout << "Anna\n";
	else cout << "Bruno\n"; 
	// 请在这里完善代码
}
/*
2 3 4 6
*/

signed main() {
	#ifdef ONLINE_JUDGE
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	#endif
	int tc = 1;
	//cin >> tc; // 若不启用多测，请注释该内容
	while (tc--) {
		clear();
		solve();
	}
	return 0;
}

提出情報

ジャッジ結果