結果

問題 No.6 使いものにならないハッシュ
ユーザー clocklnclockln
提出日時 2020-07-21 17:13:31
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 76 ms / 5,000 ms
コード長 4,589 bytes
コンパイル時間 1,731 ms
コンパイル使用メモリ 64,236 KB
実行使用メモリ 22,816 KB
最終ジャッジ日時 2023-10-14 23:25:28
合計ジャッジ時間 4,799 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
20,664 KB
testcase_01 AC 54 ms
20,736 KB
testcase_02 AC 76 ms
20,804 KB
testcase_03 AC 58 ms
20,776 KB
testcase_04 AC 59 ms
20,808 KB
testcase_05 AC 59 ms
20,712 KB
testcase_06 AC 66 ms
22,716 KB
testcase_07 AC 62 ms
22,740 KB
testcase_08 AC 65 ms
20,784 KB
testcase_09 AC 59 ms
20,656 KB
testcase_10 AC 51 ms
22,784 KB
testcase_11 AC 58 ms
20,764 KB
testcase_12 AC 67 ms
20,800 KB
testcase_13 AC 55 ms
22,704 KB
testcase_14 AC 59 ms
20,856 KB
testcase_15 AC 63 ms
22,672 KB
testcase_16 AC 57 ms
20,740 KB
testcase_17 AC 66 ms
22,740 KB
testcase_18 AC 72 ms
22,816 KB
testcase_19 AC 71 ms
20,792 KB
testcase_20 AC 66 ms
22,800 KB
testcase_21 AC 54 ms
20,804 KB
testcase_22 AC 67 ms
20,684 KB
testcase_23 AC 66 ms
20,664 KB
testcase_24 AC 63 ms
20,796 KB
testcase_25 AC 59 ms
20,764 KB
testcase_26 AC 72 ms
20,776 KB
testcase_27 AC 65 ms
20,776 KB
testcase_28 AC 60 ms
18,696 KB
testcase_29 AC 73 ms
18,580 KB
testcase_30 AC 67 ms
20,760 KB
testcase_31 AC 68 ms
20,836 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Math;
 
public class Solve{
    static public int mod = 1000000007;
    static public string al = "abcdefghijklmnopqrstuvwxyz";
    public static void Main(){
        // 方針
        //
        var k = rint();
        var n = rint();
        var list = new List<int>();
        if(k <= 2) list.Add(2);
        for(int i=Max(k,3);i<=n;i++){
            if(i%2 == 0) continue;
            var checker = true;
            for(int j=3;j*j<=i;j+=2){
                if(i%j == 0){
                    checker = false;
                    break;
                }
            }
            if(checker) list.Add(i);
        }
        var hash = new int[list.Count];
        for(int i=0;i<list.Count;i++){
            var temp = list[i];
            while(temp > 0){
                hash[i] += temp%10;
                temp /= 10;
                hash[i] = hash[i]%10 + hash[i]/10;
            }
        }
        
        var l = 0;
        var ans = 0;
        var count = 0;
        var dic = new Dictionary<int,bool>();
        for(int r=0;r<list.Count;r++){
            if(!dic.ContainsKey(hash[r])){
                dic.Add(hash[r],true);
                if(dic.Count >= count){
                    count = dic.Count;
                    ans = list[l];
                }
            }else{
                if(dic.Count >= count){
                    count = dic.Count;
                    ans = list[l];
                }
                dic.Remove(hash[l]);
                l++;
                r--;
            }
        }

        WriteLine(ans);
        
	
	
    }
    public static void swap(ref int a,ref int b){int temp = a;a= b;b = temp;}
    static void charswap(ref char a,ref char b){char temp = a;a= b;b = temp;}
    static int ncr(int n,int r){if(n<r)return 0;r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    static int square2(int a,int b){long output = 1;var list = new List<long>();int sh = 1;long n = a;list.Add(a);while(sh < b){sh *= 2;n = n*n%mod;list.Add(n);}for(int i=list.Count-1;i>=0;i--){if(b > sh){b -= sh;sh /= 2;output = output*list[i]%mod;}}return (int)output;}
    //各種読取
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static char[] chara(){ string[] a=stra();string b="";for(int i=0;i<a.Length;i++){b+=a[i];}return b.ToCharArray();}
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = double.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
    static void WriteArray(int[,] a,int b,int c){for(int i=0;i<b;i++){for(int j=0;j<c;j++){if(j!=0) Write(" ");Write(a[i,j]);}WriteLine();}}
}
0