結果
問題 | No.375 立方体のN等分 (1) |
ユーザー | EmKjp |
提出日時 | 2016-06-04 23:49:01 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 231 ms / 5,000 ms |
コード長 | 3,539 bytes |
コンパイル時間 | 1,469 ms |
コンパイル使用メモリ | 114,336 KB |
実行使用メモリ | 36,360 KB |
最終ジャッジ日時 | 2024-04-20 02:05:44 |
合計ジャッジ時間 | 3,937 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
24,112 KB |
testcase_01 | AC | 25 ms
24,156 KB |
testcase_02 | AC | 51 ms
23,988 KB |
testcase_03 | AC | 25 ms
26,136 KB |
testcase_04 | AC | 25 ms
26,256 KB |
testcase_05 | AC | 26 ms
26,260 KB |
testcase_06 | AC | 27 ms
24,108 KB |
testcase_07 | AC | 30 ms
24,152 KB |
testcase_08 | AC | 45 ms
24,236 KB |
testcase_09 | AC | 30 ms
24,228 KB |
testcase_10 | AC | 32 ms
26,272 KB |
testcase_11 | AC | 32 ms
23,900 KB |
testcase_12 | AC | 34 ms
23,896 KB |
testcase_13 | AC | 34 ms
26,132 KB |
testcase_14 | AC | 100 ms
26,712 KB |
testcase_15 | AC | 39 ms
24,232 KB |
testcase_16 | AC | 36 ms
24,208 KB |
testcase_17 | AC | 159 ms
33,492 KB |
testcase_18 | AC | 111 ms
26,656 KB |
testcase_19 | AC | 39 ms
24,284 KB |
testcase_20 | AC | 33 ms
22,320 KB |
testcase_21 | AC | 36 ms
23,984 KB |
testcase_22 | AC | 231 ms
36,360 KB |
testcase_23 | AC | 37 ms
23,896 KB |
testcase_24 | AC | 33 ms
24,364 KB |
testcase_25 | AC | 50 ms
26,144 KB |
testcase_26 | AC | 36 ms
24,280 KB |
testcase_27 | AC | 39 ms
24,288 KB |
testcase_28 | AC | 32 ms
24,280 KB |
testcase_29 | AC | 33 ms
22,200 KB |
testcase_30 | AC | 34 ms
24,220 KB |
testcase_31 | AC | 37 ms
21,944 KB |
testcase_32 | AC | 33 ms
24,476 KB |
testcase_33 | AC | 37 ms
24,024 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 List<long> Divisors(long x) { List<long> ret = new List<long>(); for (long i = 1; i * i <= x; i++) { if (x % i == 0) { ret.Add(i); if (i != x / i) ret.Add(x / i); } } ret.Sort(); return ret; } public void Run() { var N = nl(); var divisors = Divisors(N); long tmin = long.MaxValue, tmax = 0; foreach (var a in divisors) { if (tmin <= a) continue; var rem = N / a; foreach (var b in Divisors(rem)) { if (tmin <= a + b) break; var c = rem / b; tmin = Math.Min(tmin, a + b + c - 3); } } tmax = N - 1; cout.WriteLine(string.Format("{0} {1}", tmin, tmax)); } } // 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; } } }