結果
問題 | No.811 約数の個数の最大化 |
ユーザー | EmKjp |
提出日時 | 2019-04-26 01:37:04 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 170 ms / 2,000 ms |
コード長 | 3,917 bytes |
コンパイル時間 | 2,252 ms |
コンパイル使用メモリ | 107,856 KB |
実行使用メモリ | 22,776 KB |
最終ジャッジ日時 | 2023-08-14 04:04:19 |
合計ジャッジ時間 | 4,161 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
20,900 KB |
testcase_01 | AC | 58 ms
22,752 KB |
testcase_02 | AC | 79 ms
20,740 KB |
testcase_03 | AC | 58 ms
20,864 KB |
testcase_04 | AC | 57 ms
20,732 KB |
testcase_05 | AC | 58 ms
22,764 KB |
testcase_06 | AC | 59 ms
22,776 KB |
testcase_07 | AC | 59 ms
20,704 KB |
testcase_08 | AC | 68 ms
20,724 KB |
testcase_09 | AC | 81 ms
20,648 KB |
testcase_10 | AC | 65 ms
20,780 KB |
testcase_11 | AC | 76 ms
20,680 KB |
testcase_12 | AC | 63 ms
20,792 KB |
testcase_13 | AC | 170 ms
22,736 KB |
testcase_14 | AC | 81 ms
22,752 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.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { static public long Gcd(long s, long t) { return t != 0 ? Gcd(t, s % t) : s; } static public int CountFactor(long x) { int ret = 0; for (int i = 2; i * i <= x; i++) { while (x % i == 0) { x /= i; ret++; } } if (x > 1) ret++; return ret; } static public int CountDivisors(long x) { int ret = 0; for (int i = 1; i * i <= x; i++) { if (x % i == 0) { ret++; if (i != x / i) ret++; } } return ret; } public void Run() { var N = ni(); var K = ni(); int maxDivisor = 0; int ans = 1; for (int i = 1; i < N; i++) { var g = Gcd(i, N); if (CountFactor(g) >= K) { var d = CountDivisors(i); if (maxDivisor < d) { maxDivisor = d; ans = i; } } } cout.WriteLine(ans); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public int[] ni(int n) { return NextIntArray(n); } public long nl() { return NextLong(); } public long[] nl(int n) { return NextLongArray(n); } public double nd() { return NextDouble(); } public string ns() { return Next(); } public string[] ns(int n) { return NextArray(n); } } public class Scanner { private TextReader Reader; private Queue<String> TokenQueue = new Queue<string>(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }