結果

問題 No.6 使いものにならないハッシュ
ユーザー ひばちひばち
提出日時 2020-01-14 18:18:32
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 30 ms / 5,000 ms
コード長 6,078 bytes
コンパイル時間 1,193 ms
コンパイル使用メモリ 121,376 KB
実行使用メモリ 26,324 KB
最終ジャッジ日時 2024-09-16 16:54:26
合計ジャッジ時間 3,347 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
25,948 KB
testcase_01 AC 25 ms
21,936 KB
testcase_02 AC 30 ms
24,240 KB
testcase_03 AC 27 ms
24,220 KB
testcase_04 AC 26 ms
24,088 KB
testcase_05 AC 26 ms
24,088 KB
testcase_06 AC 28 ms
24,016 KB
testcase_07 AC 27 ms
26,068 KB
testcase_08 AC 28 ms
24,028 KB
testcase_09 AC 28 ms
24,280 KB
testcase_10 AC 26 ms
24,324 KB
testcase_11 AC 27 ms
24,132 KB
testcase_12 AC 28 ms
26,068 KB
testcase_13 AC 27 ms
23,960 KB
testcase_14 AC 27 ms
24,016 KB
testcase_15 AC 28 ms
24,144 KB
testcase_16 AC 28 ms
21,720 KB
testcase_17 AC 29 ms
24,276 KB
testcase_18 AC 30 ms
26,044 KB
testcase_19 AC 29 ms
24,396 KB
testcase_20 AC 29 ms
26,324 KB
testcase_21 AC 27 ms
24,364 KB
testcase_22 AC 29 ms
24,148 KB
testcase_23 AC 30 ms
26,192 KB
testcase_24 AC 29 ms
24,144 KB
testcase_25 AC 28 ms
26,192 KB
testcase_26 AC 29 ms
24,408 KB
testcase_27 AC 28 ms
24,032 KB
testcase_28 AC 28 ms
23,960 KB
testcase_29 AC 29 ms
26,184 KB
testcase_30 AC 29 ms
26,064 KB
testcase_31 AC 28 ms
24,140 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.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        int K, N;
        sc.Make(out K, out N);
        var p = new List<int>();
        var calc = new List<int>();
        var use = new bool[N + 1];
        for(var i=2;i<=N;i++)
            if (!use[i])
            {
                if (i >= K)
                {
                    p.Add(i);
                    int c = i;
                    while (c>=10)
                    {
                        var a = c;
                        c = 0;
                        while (a != 0)
                        {
                            c += a % 10; a /= 10;
                        }
                    }
                    calc.Add(c);
                }
                for (var j = i << 1; j <= N; j += i)
                    use[j] = true;
            }
        use = new bool[100];
        int l = 0, res = 0,f=-1;
        for(var i = 0; i < calc.Count; i++)
        {
            if (use[calc[i]])
            {
                while (calc[i] != calc[l])
                { use[calc[l]] = false; l++; }
                l++;
            }
            use[calc[i]] = true;
            if (res <= i - l + 1)
            {
                res = i - l + 1;
                f = p[l];
            }
        }
        WriteLine(f);
    }
    
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T>
    { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T>
    { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b)
    { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f();
        return rt;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f(i);
        return rt;
    }
    public static T[] Copy<T>(this T[] A)
        => Create(A.Length, i => A[i]);
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Tie(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }
}
#endregion
0