#393520 (C#(csc)) No.917 Make One With GCD

• 問題: No.917 Make One With GCD
• ユーザー: EmKjp
• 提出日時: 2019-10-25 22:51:57
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 62 ms / 2,000 ms
• コード長: 4,650 bytes
• コンパイル時間: 4,614 ms
• コンパイル使用メモリ: 105,328 KB
• 実行使用メモリ: 22,832 KB
• 最終ジャッジ日時: 2023-09-06 16:40:30
• 合計ジャッジ時間: 8,238 ms
• ジャッジサーバーID （参考情報）: judge14 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	60 ms; 20,552 KB
testcase_01	AC	57 ms; 22,708 KB
testcase_02	AC	57 ms; 22,780 KB
testcase_03	AC	58 ms; 20,720 KB
testcase_04	AC	58 ms; 18,808 KB
testcase_05	AC	59 ms; 20,792 KB
testcase_06	AC	58 ms; 20,588 KB
testcase_07	AC	60 ms; 20,680 KB
testcase_08	AC	58 ms; 20,664 KB
testcase_09	AC	60 ms; 20,660 KB
testcase_10	AC	60 ms; 20,620 KB
testcase_11	AC	59 ms; 20,756 KB
testcase_12	AC	59 ms; 20,736 KB
testcase_13	AC	59 ms; 20,776 KB
testcase_14	AC	59 ms; 18,672 KB
testcase_15	AC	61 ms; 20,916 KB
testcase_16	AC	62 ms; 22,792 KB
testcase_17	AC	61 ms; 20,628 KB
testcase_18	AC	58 ms; 20,776 KB
testcase_19	AC	60 ms; 22,644 KB
testcase_20	AC	61 ms; 22,792 KB
testcase_21	AC	61 ms; 20,788 KB
testcase_22	AC	61 ms; 20,588 KB
testcase_23	AC	60 ms; 18,688 KB
testcase_24	AC	60 ms; 20,556 KB
testcase_25	AC	61 ms; 20,560 KB
testcase_26	AC	61 ms; 20,788 KB
testcase_27	AC	61 ms; 20,732 KB
testcase_28	AC	61 ms; 20,760 KB
testcase_29	AC	60 ms; 18,716 KB
testcase_30	AC	61 ms; 22,716 KB
testcase_31	AC	60 ms; 20,948 KB
testcase_32	AC	60 ms; 22,704 KB
testcase_33	AC	61 ms; 22,832 KB
testcase_34	AC	58 ms; 22,820 KB
testcase_35	AC	61 ms; 20,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.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {

    public static long Gcd(long s, long t) {
        return t != 0 ? Gcd(t, s % t) : s;
    }

    Dictionary<long, long> memo = new Dictionary<long, long>();

    long dfs(int[] a, int pos, int gcd = 0) {
        if (pos == a.Length) {
            return gcd == 1 ? 1 : 0;
        }
        var key = 1L * (gcd + 1) * 100 + pos;
        if (!memo.ContainsKey(key)) {
            var ans = 0L;

            ans += dfs(a, pos + 1, gcd);
            ans += dfs(a, pos + 1, gcd == 0 ? a[pos] : (int)Gcd(gcd, a[pos]));

            memo[key] = ans;
        }
        return memo[key];
    }


    public void Run() {
        var n = ni();
        var a = ni(n);
        memo.Clear();
        var ans = dfs(a, 0);
        cout.WriteLine(ans);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        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 {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

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

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

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    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 (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}