#246834 (C++14) No.2 素因数ゲーム

• 問題: No.2 素因数ゲーム
• ユーザー: akusyounin2412
• 提出日時: 2018-03-24 18:11:04
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 970 ms / 5,000 ms
• コード長: 1,721 bytes
• コンパイル時間: 996 ms
• コンパイル使用メモリ: 117,152 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-08 00:50:42
• 合計ジャッジ時間: 15,552 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	120 ms; 5,376 KB
testcase_07	AC	135 ms; 5,376 KB
testcase_08	AC	123 ms; 5,376 KB
testcase_09	AC	962 ms; 5,376 KB
testcase_10	AC	809 ms; 5,376 KB
testcase_11	AC	394 ms; 5,376 KB
testcase_12	AC	382 ms; 5,376 KB
testcase_13	AC	772 ms; 5,376 KB
testcase_14	AC	72 ms; 5,376 KB
testcase_15	AC	225 ms; 5,376 KB
testcase_16	AC	560 ms; 5,376 KB
testcase_17	AC	829 ms; 5,376 KB
testcase_18	AC	929 ms; 5,376 KB
testcase_19	AC	565 ms; 5,376 KB
testcase_20	AC	710 ms; 5,376 KB
testcase_21	AC	968 ms; 5,376 KB
testcase_22	AC	874 ms; 5,376 KB
testcase_23	AC	444 ms; 5,376 KB
testcase_24	AC	970 ms; 5,376 KB
testcase_25	AC	721 ms; 5,376 KB
testcase_26	AC	472 ms; 5,376 KB
testcase_27	AC	254 ms; 5,376 KB
testcase_28	AC	533 ms; 5,376 KB
testcase_29	AC	436 ms; 5,376 KB
testcase_30	AC	401 ms; 5,376 KB

ソースコード

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum, last, ans, cnt,a[100000010];
struct Edge { LL to, cost,mon; };
string str;
bool f = 0;
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
vector<Edge>vec[10000];

int main() {
	cin >> n;
	m = n;
	for (int i = 2; i <= m; i++) {
		while (n%i == 0) {
			n /= i;
			a[i]++;
		}
	}
	rep(i, m)sum ^= a[i + 1];
	while (sum > 0) {
		if (sum % 2 == 1)ans++;
		sum >>= 1;
	}
	cout << (ans !=0 ? "Alice" : "Bob") << endl;
	return 0;
}