結果

問題 No.1312 Snake Eyes
ユーザー EmKjpEmKjp
提出日時 2020-12-09 01:04:08
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 7,676 bytes
コンパイル時間 1,266 ms
コンパイル使用メモリ 117,832 KB
実行使用メモリ 26,188 KB
最終ジャッジ日時 2024-09-18 22:37:19
合計ジャッジ時間 6,036 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
23,804 KB
testcase_01 AC 23 ms
23,672 KB
testcase_02 AC 24 ms
23,676 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 23 ms
25,772 KB
testcase_06 AC 24 ms
26,032 KB
testcase_07 AC 24 ms
23,984 KB
testcase_08 AC 24 ms
23,808 KB
testcase_09 AC 24 ms
25,968 KB
testcase_10 AC 24 ms
21,816 KB
testcase_11 AC 25 ms
23,984 KB
testcase_12 AC 24 ms
25,980 KB
testcase_13 AC 23 ms
23,736 KB
testcase_14 AC 23 ms
23,672 KB
testcase_15 AC 23 ms
25,780 KB
testcase_16 AC 22 ms
23,924 KB
testcase_17 AC 24 ms
23,724 KB
testcase_18 AC 23 ms
23,984 KB
testcase_19 AC 23 ms
23,800 KB
testcase_20 AC 22 ms
23,680 KB
testcase_21 AC 23 ms
23,732 KB
testcase_22 AC 24 ms
23,860 KB
testcase_23 AC 26 ms
24,064 KB
testcase_24 AC 24 ms
25,916 KB
testcase_25 AC 24 ms
23,740 KB
testcase_26 AC 24 ms
23,984 KB
testcase_27 AC 24 ms
25,656 KB
testcase_28 AC 25 ms
23,672 KB
testcase_29 AC 24 ms
21,556 KB
testcase_30 AC 26 ms
21,692 KB
testcase_31 AC 26 ms
26,100 KB
testcase_32 AC 24 ms
23,980 KB
testcase_33 AC 23 ms
23,932 KB
testcase_34 AC 25 ms
23,800 KB
testcase_35 AC 23 ms
23,984 KB
testcase_36 AC 24 ms
23,672 KB
testcase_37 AC 25 ms
23,872 KB
testcase_38 AC 31 ms
25,788 KB
testcase_39 AC 26 ms
23,796 KB
testcase_40 AC 24 ms
25,652 KB
testcase_41 AC 26 ms
23,860 KB
testcase_42 AC 23 ms
21,764 KB
testcase_43 AC 24 ms
23,932 KB
testcase_44 AC 24 ms
23,928 KB
testcase_45 AC 24 ms
25,720 KB
testcase_46 AC 24 ms
23,736 KB
testcase_47 AC 25 ms
26,032 KB
testcase_48 AC 43 ms
21,688 KB
testcase_49 AC 34 ms
25,664 KB
testcase_50 AC 33 ms
23,852 KB
testcase_51 AC 30 ms
24,108 KB
testcase_52 AC 36 ms
24,000 KB
testcase_53 AC 33 ms
23,988 KB
testcase_54 AC 32 ms
23,936 KB
testcase_55 AC 28 ms
25,972 KB
testcase_56 AC 37 ms
23,804 KB
testcase_57 AC 30 ms
26,188 KB
testcase_58 AC 32 ms
23,932 KB
testcase_59 AC 29 ms
23,872 KB
testcase_60 AC 29 ms
25,788 KB
testcase_61 AC 35 ms
25,660 KB
testcase_62 AC 28 ms
23,808 KB
testcase_63 AC 23 ms
23,928 KB
testcase_64 AC 24 ms
25,656 KB
testcase_65 AC 25 ms
23,676 KB
testcase_66 AC 25 ms
23,800 KB
testcase_67 AC 24 ms
26,048 KB
testcase_68 AC 24 ms
23,980 KB
testcase_69 AC 23 ms
23,980 KB
testcase_70 AC 36 ms
24,116 KB
testcase_71 AC 31 ms
23,996 KB
testcase_72 AC 28 ms
23,672 KB
testcase_73 AC 31 ms
25,656 KB
testcase_74 AC 28 ms
26,056 KB
testcase_75 AC 27 ms
25,968 KB
testcase_76 AC 416 ms
21,684 KB
testcase_77 AC 37 ms
25,900 KB
testcase_78 AC 34 ms
23,800 KB
testcase_79 AC 33 ms
23,864 KB
testcase_80 AC 33 ms
23,732 KB
testcase_81 AC 34 ms
23,928 KB
testcase_82 AC 42 ms
23,936 KB
testcase_83 AC 44 ms
25,792 KB
testcase_84 AC 34 ms
23,728 KB
testcase_85 AC 36 ms
23,552 KB
testcase_86 AC 49 ms
23,928 KB
testcase_87 AC 30 ms
23,928 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;
using System.Threading;

internal partial class Solver {
    public void Run() {
        var n = nl();
        // y = (1 + p + p^2 + .. p^x)
        // n = k * y
        // x の範囲は小さい
        // x,y を固定すると p は二分探索で求められる
        long ans = n;

        foreach (var d in Divisors(n)) {
            var k = d;
            var y = n / d;
            for (int x = 2; x < 60; x++) {
                MoveUntil(0, n, p => {
                    long v = 0;
                    double d = 0.0;
                    for (int i = 0; i < x; i++) {
                        d *= p;
                        d += 1;
                        if (d > y) return false;
                        v *= p;
                        v += 1;
                        if (v > y) return false;
                    }
                    if (v <= y) {
                        if (y == v) {
                            if (k < p) {
                                ans = Math.Min(ans, p);
                            }
                        }
                        return true;
                    } else {
                        return false;
                    }
                });
            }
        }
        cout.WriteLine(ans);
    }

    public static long MoveUntil(long ok, long ng, Predicate<long> predicate) {
        if (ok == ng) throw new Exception();
        while (Math.Abs(ok - ng) > 1) {
            var mid = (ok + ng) >> 1;
            if (predicate(mid)) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        return ok;
    }

    public static List<long> Divisors(long x) {
        var 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;
    }
}


// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }

    public static void Main() {
#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 });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }

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

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    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
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return 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 Exception();
            }
        }
        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