結果

問題 No.371 ぼく悪いプライムじゃないよ
ユーザー りあんりあん
提出日時 2016-05-13 23:24:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 63 ms / 1,000 ms
コード長 6,618 bytes
コンパイル時間 2,652 ms
コンパイル使用メモリ 116,240 KB
実行使用メモリ 27,812 KB
最終ジャッジ日時 2024-06-09 19:17:37
合計ジャッジ時間 3,859 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
25,740 KB
testcase_01 AC 29 ms
25,608 KB
testcase_02 AC 29 ms
27,648 KB
testcase_03 AC 28 ms
27,676 KB
testcase_04 AC 28 ms
25,520 KB
testcase_05 AC 29 ms
27,544 KB
testcase_06 AC 30 ms
23,612 KB
testcase_07 AC 30 ms
25,736 KB
testcase_08 AC 29 ms
25,776 KB
testcase_09 AC 30 ms
27,800 KB
testcase_10 AC 28 ms
27,672 KB
testcase_11 AC 28 ms
25,756 KB
testcase_12 AC 29 ms
25,520 KB
testcase_13 AC 30 ms
25,476 KB
testcase_14 AC 30 ms
25,616 KB
testcase_15 AC 32 ms
25,348 KB
testcase_16 AC 31 ms
25,608 KB
testcase_17 AC 31 ms
25,520 KB
testcase_18 AC 32 ms
25,864 KB
testcase_19 AC 31 ms
25,596 KB
testcase_20 AC 31 ms
25,652 KB
testcase_21 AC 31 ms
25,900 KB
testcase_22 AC 30 ms
25,628 KB
testcase_23 AC 28 ms
25,624 KB
testcase_24 AC 27 ms
25,736 KB
testcase_25 AC 26 ms
25,744 KB
testcase_26 AC 63 ms
25,352 KB
testcase_27 AC 28 ms
27,424 KB
testcase_28 AC 27 ms
25,740 KB
testcase_29 AC 27 ms
27,548 KB
testcase_30 AC 28 ms
25,392 KB
testcase_31 AC 27 ms
25,604 KB
testcase_32 AC 27 ms
25,620 KB
testcase_33 AC 27 ms
25,756 KB
testcase_34 AC 29 ms
27,388 KB
testcase_35 AC 28 ms
27,644 KB
testcase_36 AC 27 ms
25,740 KB
testcase_37 AC 29 ms
25,516 KB
testcase_38 AC 29 ms
27,796 KB
testcase_39 AC 26 ms
23,604 KB
testcase_40 AC 28 ms
27,680 KB
testcase_41 AC 27 ms
27,532 KB
testcase_42 AC 27 ms
27,812 KB
testcase_43 AC 27 ms
27,500 KB
testcase_44 AC 27 ms
25,604 KB
testcase_45 AC 27 ms
25,516 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.Text;
using Point = System.Tuple<double, double>;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int m = 100000;
    static int[] minprime;
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        long l, h;
        sc.Multi(out l, out h);
        minprime = new int[m];
        for (int i = 2; i < m; i++)
            minprime[i] = i;
        for (int i = 2; i * i < m; i++)
        {
            if (minprime[i] == i)
                for (int j = i * i; j < m; j += i)
                    minprime[j] = Math.Min(minprime[j], i);
        }
        long maxprime = 1, ans = l - 1;
        for (int i = m - 1; i > 1; i--)
        {
            if (minprime[i] < maxprime) continue;
            
            var lim = Math.Max(i, l / i);
            for (long j = h / i; j >= lim; j--)
            {
                if (minp(j) >= minprime[i])
                {
                    var k = i * j;
                    if (l <= k && k <= h)
                    {
                        if (maxprime < minprime[i])
                        {
                            ans = k;
                            maxprime = minprime[i];
                            break;
                        }
                        if (maxprime == minprime[i] && ans < k)
                        {
                            ans = k;
                            break;
                        }
                    }
                }
            }
        }
        sw.WriteLine(ans);
        sw.Flush();
    }
    static long minp(long a)
    {
        if (a < m) return minprime[a];
        
        for (long i = 2; i * i <= a; i++)
        {
            if (a % i == 0) return i;
        }
        return a;
    }
    
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }

    static T[] copy<T>(T[] a)
    {
        var ret = new T[a.Length];
        for (int i = 0; i < a.Length; i++) ret[i] = a[i];
        return ret;
    }
    static T[][] copy2<T>(T[][] a)
    {
        var ret = new T[a.Length][];
        for (int i = 0; i < a.Length; i++)
        {
            ret[i] = new T[a[0].Length];
            for (int j = 0; j < a[0].Length; j++) ret[i][j] = a[i][j];
        }
        return ret;
    }
}
class Scan
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public long[][] powmat(long[][] A, long n, int M)
    {
        var E = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            E[i] = new long[A.Length];
            E[i][i] = 1;
        }
        if (n == 0) return E;
        var t = powmat(A, n / 2, M);
        if ((n & 1) == 0) return mulmat(t, t, M);
        return mulmat(mulmat(t, t, M), A, M);
    }
    public long[] mulmat(long[][] A, long[] x, int M)
    {
        var ans = new long[A.Length];
        for (int i = 0; i < A.Length; i++) for (int j = 0; j < x.Length; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % M;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B, int M)
    {
        var ans = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            ans[i] = new long[B[0].Length];
            for (int j = 0; j < B[0].Length; j++) for (int k = 0; k < B.Length; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
        }
        return ans;
    }
    public long powmod(long a, long b, long M)
    {
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2, M);
        if ((b & 1) == 0) return t * t % M;
        return t * t % M * a % M;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(long a, long b) { return a * (b / gcd(a, b)); }
    public long Comb(int n, int r)
    {
        const int M = 1000000007;
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % M;
        return result;
    }
}
0