Submission #57068706
Source Code Expand
Copy
#include <bits/stdc++.h>#define CNO cout << "NO\n"#define CYES cout << "YES\n"#define endl '\n'#define ls id << 1#define rs id << 1 | 1#define llen (mid - l + 1)#define rlen (r - mid)using namespace std;typedef long long ll;typedef unsigned int uint;typedef unsigned long long ull;typedef long double ld;typedef __int128 i128;typedef pair<int, int> pii;typedef pair<ll, ll> pll;const ll mod = 998244353;const int N = 200010;int n, arr[N];ll ans = 0;string str;
#include <bits/stdc++.h> #define CNO cout << "NO\n" #define CYES cout << "YES\n" #define endl '\n' #define ls id << 1 #define rs id << 1 | 1 #define llen (mid - l + 1) #define rlen (r - mid) using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef long double ld; typedef __int128 i128; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const ll mod = 998244353; const int N = 200010; int n, arr[N]; ll ans = 0; string str; int prime(int x) { int res = 0; for (int i = 2; i * i <= x; ++i) { while (x % i == 0) { res++; x /= i; } } if (x != 1) res++; return res; } int main() { ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); int T = 1; // cin >> T; while (T--) { cin >> n; int p = 0; for (int i = 0; i < n; ++i) { cin >> arr[i]; arr[i] = prime(arr[i]); // cerr << arr[i] << ' '; p ^= arr[i]; } if (p) { cout << "Anna" << endl; } else { cout << "Bruno" << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Dividing Game |
User | Arch_Srginit |
Language | C++ 20 (gcc 12.2) |
Score | 475 |
Code Size | 1106 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 4004 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 475 / 475 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 01_internal_00.txt, 01_internal_01.txt, 01_internal_02.txt, 01_internal_03.txt, 01_internal_04.txt, 01_internal_05.txt, 01_internal_06.txt, 01_internal_07.txt, 01_internal_08.txt, 01_internal_09.txt, 01_internal_10.txt, 01_internal_11.txt, 01_internal_12.txt, 01_internal_13.txt, 01_internal_14.txt, 01_internal_15.txt, 01_internal_16.txt, 01_internal_17.txt, 01_internal_18.txt, 01_internal_19.txt, 01_internal_20.txt, 01_internal_21.txt, 01_internal_22.txt, 01_internal_23.txt, 01_internal_24.txt, 01_internal_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3424 KB |
00_sample_01.txt | AC | 1 ms | 3416 KB |
01_internal_00.txt | AC | 6 ms | 3456 KB |
01_internal_01.txt | AC | 5 ms | 3700 KB |
01_internal_02.txt | AC | 10 ms | 3660 KB |
01_internal_03.txt | AC | 21 ms | 3868 KB |
01_internal_04.txt | AC | 21 ms | 4004 KB |
01_internal_05.txt | AC | 21 ms | 3792 KB |
01_internal_06.txt | AC | 21 ms | 3864 KB |
01_internal_07.txt | AC | 21 ms | 3816 KB |
01_internal_08.txt | AC | 21 ms | 3808 KB |
01_internal_09.txt | AC | 20 ms | 3876 KB |
01_internal_10.txt | AC | 21 ms | 3824 KB |
01_internal_11.txt | AC | 21 ms | 3804 KB |
01_internal_12.txt | AC | 20 ms | 3868 KB |
01_internal_13.txt | AC | 22 ms | 3940 KB |
01_internal_14.txt | AC | 22 ms | 3748 KB |
01_internal_15.txt | AC | 22 ms | 3956 KB |
01_internal_16.txt | AC | 11 ms | 3864 KB |
01_internal_17.txt | AC | 9 ms | 3864 KB |
01_internal_18.txt | AC | 11 ms | 3872 KB |
01_internal_19.txt | AC | 11 ms | 3948 KB |
01_internal_20.txt | AC | 21 ms | 3872 KB |
01_internal_21.txt | AC | 21 ms | 3876 KB |
01_internal_22.txt | AC | 20 ms | 3868 KB |
01_internal_23.txt | AC | 21 ms | 3868 KB |
01_internal_24.txt | AC | 21 ms | 3872 KB |
01_internal_25.txt | AC | 21 ms | 3740 KB |