結果

問題 No.1006 Share an Integer
ユーザー EmKjpEmKjp
提出日時 2020-04-19 03:29:24
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 113 ms / 2,000 ms
コード長 6,309 bytes
コンパイル時間 1,297 ms
コンパイル使用メモリ 117,848 KB
実行使用メモリ 39,916 KB
最終ジャッジ日時 2024-10-04 00:44:07
合計ジャッジ時間 3,255 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
24,940 KB
testcase_01 AC 24 ms
25,204 KB
testcase_02 AC 26 ms
25,072 KB
testcase_03 AC 25 ms
25,068 KB
testcase_04 AC 26 ms
26,980 KB
testcase_05 AC 26 ms
24,812 KB
testcase_06 AC 28 ms
26,708 KB
testcase_07 AC 28 ms
25,200 KB
testcase_08 AC 26 ms
23,216 KB
testcase_09 AC 27 ms
25,068 KB
testcase_10 AC 27 ms
25,076 KB
testcase_11 AC 79 ms
32,784 KB
testcase_12 AC 107 ms
38,808 KB
testcase_13 AC 112 ms
39,916 KB
testcase_14 AC 112 ms
37,832 KB
testcase_15 AC 99 ms
37,456 KB
testcase_16 AC 62 ms
30,748 KB
testcase_17 AC 75 ms
31,256 KB
testcase_18 AC 102 ms
37,656 KB
testcase_19 AC 98 ms
39,244 KB
testcase_20 AC 103 ms
37,960 KB
testcase_21 AC 113 ms
39,752 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {

    public void Run() {
        var x = ni();

        int minDiff = int.MaxValue;

        var dm = GetDivisorNumTable(x + 10);
        var ans = new List<(int, int)>();
        for (int a = 1; a < x; a++) {
            var b = x - a;
            var diff = Math.Abs(a - dm[a] - (b - dm[b]));
            if (diff < minDiff) {
                minDiff = diff;
                ans.Clear();
                ans.Add((a, b));
            } else if (diff == minDiff) {
                ans.Add((a, b));
            }
        }
        cout.WriteLine(string.Join("\n", ans.Select(a => $"{a.Item1} {a.Item2}")));
    }

    public int[] GetDivisorNumTable(int size) {
        var lpf = GetLowestPrimeFactorTable(size);
        var divNum = new int[size + 1];
        divNum[1] = 1;
        for (int i = 2; i <= size; i++) {
            int x = i, p = 0;
            while (x % lpf[i] == 0) {
                x /= lpf[i];
                p++;
            }
            divNum[i] = divNum[x] * (p + 1);
        }
        return divNum;
    }

    public int[] GetLowestPrimeFactorTable(int size) {
        var lpf = new int[size + 1];
        for (int i = 2; i <= size; i++) {
            if (lpf[i] > 0) continue;
            lpf[i] = i;
            for (int j = i + i; j <= size; j += i) {
                if (lpf[j] == 0) {
                    lpf[j] = i;
                }
            }
        }
        return lpf;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new InvalidOperationException();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}
0