結果
問題 | No.2 素因数ゲーム |
ユーザー | ひばち |
提出日時 | 2019-11-12 19:27:47 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 27 ms / 5,000 ms |
コード長 | 5,224 bytes |
コンパイル時間 | 3,387 ms |
コンパイル使用メモリ | 113,664 KB |
実行使用メモリ | 18,176 KB |
最終ジャッジ日時 | 2024-09-19 06:33:04 |
合計ジャッジ時間 | 4,337 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
18,048 KB |
testcase_01 | AC | 23 ms
17,792 KB |
testcase_02 | AC | 24 ms
17,664 KB |
testcase_03 | AC | 22 ms
18,048 KB |
testcase_04 | AC | 22 ms
17,664 KB |
testcase_05 | AC | 23 ms
17,536 KB |
testcase_06 | AC | 27 ms
17,920 KB |
testcase_07 | AC | 24 ms
17,920 KB |
testcase_08 | AC | 24 ms
17,792 KB |
testcase_09 | AC | 23 ms
17,792 KB |
testcase_10 | AC | 24 ms
17,792 KB |
testcase_11 | AC | 23 ms
17,664 KB |
testcase_12 | AC | 23 ms
17,664 KB |
testcase_13 | AC | 24 ms
17,920 KB |
testcase_14 | AC | 23 ms
17,920 KB |
testcase_15 | AC | 24 ms
17,920 KB |
testcase_16 | AC | 24 ms
17,920 KB |
testcase_17 | AC | 25 ms
17,664 KB |
testcase_18 | AC | 24 ms
18,048 KB |
testcase_19 | AC | 23 ms
17,920 KB |
testcase_20 | AC | 23 ms
17,792 KB |
testcase_21 | AC | 24 ms
18,048 KB |
testcase_22 | AC | 24 ms
17,792 KB |
testcase_23 | AC | 24 ms
17,792 KB |
testcase_24 | AC | 24 ms
18,176 KB |
testcase_25 | AC | 22 ms
17,920 KB |
testcase_26 | AC | 22 ms
18,048 KB |
testcase_27 | AC | 23 ms
17,792 KB |
testcase_28 | AC | 23 ms
17,792 KB |
testcase_29 | AC | 24 ms
17,664 KB |
testcase_30 | AC | 23 ms
17,664 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Runtime.CompilerServices; using System.Text; using static Template; using static System.Console; using static System.Convert; using static System.Math; using Pi = Pair<int, int>; using Number = System.Int64; class Solver { public void Solve() { var num = Input.num; var res = 0; foreach (var v in Factorize(num).Values) res ^= v; WriteLine(res == 0 ? "Bob" : "Alice"); } public static Dictionary<long, int> Factorize(long num) { var dic = new Dictionary<long, int>(); for (var i = 2L; i * i <= num; i++) { var ct = 0; while (num % i == 0) { ct++; num /= i; } if (ct != 0) dic[i] = ct; } if (num != 1) dic[num] = 1; return dic; } } #region Template public class Template { [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmin<T>(ref T num, T val) where T : IComparable<T> { if (num.CompareTo(val) == 1) { num = val; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmax<T>(ref T num, T val) where T : IComparable<T> { if (num.CompareTo(val) == -1) { num = val; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void swap<T>(ref T v1, ref T v2) { var t = v2; v2 = v1; v1 = t; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<T> f) => Enumerable.Repeat(0, n).Select(_ => f()).ToArray(); public static void Fail() => Fail("No"); public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); } static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var p = new Solver(); for (var i = 1; i > 0; --i) p.Solve(); Console.Out.Flush(); } } public class Input { public static string read => Console.ReadLine().Trim(); public static int[] ar => read.Split(' ').Select(int.Parse).ToArray(); public static int num => Convert.ToInt32(read); public static long[] arL => read.Split(' ').Select(long.Parse).ToArray(); public static long numL => Convert.ToInt64(read); public static char[][] grid(int h) => Create(h, () => read.ToCharArray()); public static int[] ar1D(int n) => Create(n, () => num); public static long[] arL1D(int n) => Create(n, () => numL); public static string[] strs(int n) => Create(n, () => read); public static int[][] ar2D(int n) => Create(n, () => ar); public static long[][] arL2D(int n) => Create(n, () => arL); public static List<T>[] edge<T>(int n) => Create(n, () => new List<T>()); public static void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); } public static void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); } public static void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); } public static void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); } public static void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); } private static Queue<string> sc = new Queue<string>(); public static T Next<T>() { if (sc.Count == 0) foreach (var item in ReadLine().Split(' ')) sc.Enqueue(item); return (T)Convert.ChangeType(sc.Dequeue(), typeof(T)); } public const int MOD = 1000000007; } public class Pair<T1, T2> : IComparable<Pair<T1, T2>> { public T1 v1; public T2 v2; public Pair() { v1 = default(T1);v2 = default(T2); } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2> p) { var c = Comparer<T1>.Default.Compare(v1, p.v1); if (c == 0) c = Comparer<T2>.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; } public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>> { public T3 v3; public Pair() : base() { v3 = default(T3); } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2, T3> p) { var c = base.CompareTo(p); if (c == 0) c = Comparer<T3>.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; } #endregion