#20262 (C#(csc)) No.6 使いものにならないハッシュ

• 問題: No.6 使いものにならないハッシュ
• ユーザー: femto
• 提出日時: 2015-04-17 14:28:11
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 34 ms / 5,000 ms
• コード長: 4,935 bytes
• コンパイル時間: 2,158 ms
• コンパイル使用メモリ: 109,440 KB
• 実行使用メモリ: 19,296 KB
• 最終ジャッジ日時: 2024-09-16 16:25:17
• 合計ジャッジ時間: 3,246 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	29 ms; 19,200 KB
testcase_01	AC	29 ms; 19,200 KB
testcase_02	AC	34 ms; 18,912 KB
testcase_03	AC	30 ms; 18,944 KB
testcase_04	AC	30 ms; 18,920 KB
testcase_05	AC	30 ms; 19,184 KB
testcase_06	AC	33 ms; 19,044 KB
testcase_07	AC	32 ms; 19,036 KB
testcase_08	AC	32 ms; 19,044 KB
testcase_09	AC	32 ms; 19,036 KB
testcase_10	AC	28 ms; 19,072 KB
testcase_11	AC	30 ms; 18,944 KB
testcase_12	AC	33 ms; 19,048 KB
testcase_13	AC	32 ms; 18,780 KB
testcase_14	AC	32 ms; 19,044 KB
testcase_15	AC	31 ms; 19,044 KB
testcase_16	AC	33 ms; 19,036 KB
testcase_17	AC	34 ms; 18,784 KB
testcase_18	AC	34 ms; 19,036 KB
testcase_19	AC	33 ms; 18,784 KB
testcase_20	AC	32 ms; 18,792 KB
testcase_21	AC	30 ms; 18,944 KB
testcase_22	AC	33 ms; 19,048 KB
testcase_23	AC	32 ms; 19,172 KB
testcase_24	AC	33 ms; 19,296 KB
testcase_25	AC	32 ms; 19,168 KB
testcase_26	AC	34 ms; 18,920 KB
testcase_27	AC	34 ms; 19,160 KB
testcase_28	AC	32 ms; 19,044 KB
testcase_29	AC	33 ms; 19,044 KB
testcase_30	AC	33 ms; 18,912 KB
testcase_31	AC	34 ms; 18,912 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.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;

class Solution {
    int N, K;
    void calc() {
        K = ri();
        N = ri();

        var primes = sieveOfEratosthenes(N).ToArray();
        var hashes = primes.Select(conv).ToArray();

        int head = 0, tail = 0;
        while (primes [head] < K) head++;
        tail = head;


        int ans = 0, max = 0;
        var dic = new Dictionary<int, int>();
        for (;tail < primes.Length ; tail++) {
            int hash = hashes[tail];

            if (dic.ContainsKey(hash) && head <= dic[hash]) {
                head = dic [hash] + 1;
            }

            dic [hash] = tail;
            
            if (max <= tail - head + 1) {
                max = tail - head + 1;
                ans = primes[head];
            }
        }

        Console.WriteLine(ans);
    }

    static void Main(string [] args) {
        new Solution().calc();
    }
    public static List<int> sieveOfEratosthenes(int n) {
        List<int> primes = new List<int>();
        bool [] isPrime = Enumerable.Repeat(true, n + 1).ToArray();
        isPrime [0] = isPrime [1] = false;
        for (int i = 2; i <= n; i++) {
            if (isPrime [i]) {
                primes.Add(i);
                for (int j = 2 * i; j <= n; j += i) isPrime [j] = false;
            }
        }
        return primes;
    }

    int conv(int n) {
        int x = 0;
        while (n != 0) {
            x += n % 10;
            n /= 10;
        }
        if (x <= 9) return x;
        else return conv(x);
    }
    #region
    static int ri() { return int.Parse(Console.ReadLine()); }
    static int [] ria(int n) {
        if (n <= 0) { Console.ReadLine(); return new int [0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
    }
    static void rio(out int p1) { p1 = ri(); }
    static void rio(out int p1, out int p2) { var r = ria(2); p1 = r [0]; p2 = r [1]; }
    static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r [0]; p2 = r [1]; p3 = r [2]; }
    static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; }
    static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; p5 = r [4]; }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static long [] rla(int n) {
        if (n <= 0) { Console.ReadLine(); return new long [0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
    }
    static void rlo(out long p1) { p1 = rl(); }
    static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r [0]; p2 = r [1]; }
    static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r [0]; p2 = r [1]; p3 = r [2]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; p5 = r [4]; }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static double [] rda(int n) {
        if (n <= 0) { Console.ReadLine(); return new double [0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
    }
    static void rdo(out double p1) { p1 = rd(); }
    static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r [0]; p2 = r [1]; }
    static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r [0]; p2 = r [1]; p3 = r [2]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r [0]; p2 = r [1]; p3 = r [2]; p4 = r [3]; p5 = r [4]; }
    static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
    static void wa1<T>(T [] a) { Debug.WriteLine(string.Join(" ", a)); }
    static void wa2<T>(T [] [] a) {
        foreach (var row in a) {
            Debug.WriteLine(String.Join(" ", row));
        }
    }
    [DebuggerDisplay("{x} , {y}")]
    class point {
        public int x, y;
        public point(int x, int y) {
            this.x = x; this.y = y;
        }
    }
    #endregion
}

static class Extention {
    public static T [] [] ToJagArray<T>(this T [,] a) {
        int n = a.GetLength(0), m = a.GetLength(1);
        var ret = new T [n] [];
        for (int i = 0; i < n; i++) {
            ret [i] = new T [m];
            for (int j = 0; j < m; j++) {
                ret [i] [j] = a [i, j];
            }
        }
        return ret;
    }
}