Submission #342246


Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;

class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Dictionary<long, int> dic;

    void calc()
    {
        Scanner cin = new Scanner();
        int A = cin.nextInt();
        int B = cin.nextInt();
        dic = new Dictionary<long, int>();
        for (int i = B + 1; i <= A; i++)
        {
            check(i);
        }
        long ret = 1;
        long mod = (int)1e9 + 7;
        foreach (var item in dic.Values)
        {
            ret *= item + 1;
            ret %= mod;
        }
        Console.WriteLine(ret);
    }

    void check(int a)
    {
        for (int i = 2; i * i <= a; i++)
        {
            if (a % i == 0)
            {
                int num = 0;
                while (a % i == 0)
                {
                    a /= i;
                    num++;
                }
                push(i, num);
            }
        }
        if (a != 1)
        {
            push(a, 1);
        }
    }

    void push(long a, int b)
    {
        if (dic.ContainsKey(a))
        {
            dic[a] += b;
        }
        else dic[a] = b;
    }


}




class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}


class XRand
{
    uint x, y, z, w;


    public XRand()
    {
        init();
    }

    public XRand(uint s)
    {
        init();
        init_xor128(s);
    }

    void init()
    {
        x = 314159265; y = 358979323; z = 846264338; w = 327950288;

    }

    public void init_xor128(uint s)
    {
        z ^= s;
        z ^= z >> 21; z ^= z << 35; z ^= z >> 4;
        z *= 736338717;
    }

    uint next()
    {
        uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8;
    }

    public long nextLong(long m)
    {
        return (long)((((ulong)next() << 32) + next()) % (ulong)m);
    }

    public int nextInt(int m)
    {
        return (int)(next() % m);
    }

    public long nextLong(long min, long max)
    {
        return min + nextLong(max - min + 1);
    }

    public int nextInt(int min, int max)
    {
        return min + nextInt(max - min + 1);
    }

    public int nextIntP(int a)
    {
        return (int)Math.Pow(a, nextDouble());
    }

    public int nextIntP(int min, int max)
    {
        int diff = max - min;
        return min + nextIntP(diff + 2) - 1;
    }

    public long nextLongP(long a)
    {
        return (long)Math.Pow(a, nextDouble());
    }

    public long nextLongP(long min, long max)
    {
        long diff = max - min;
        return min + nextLongP(diff + 2) - 1;
    }


    public double nextDouble()
    {
        return (double)next() / uint.MaxValue;
    }

    public double nextDoubleP(double a)
    {
        return Math.Pow(a, nextDouble());
    }
}

Submission Info

Submission Time
Task C - 約数かつ倍数
User chokudai
Language C# (Mono 2.10.8.1)
Score 100
Code Size 3682 Byte
Status AC
Exec Time 176 ms
Memory 8344 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 5 / 5 35 / 35 60 / 60
Status
AC × 4
AC × 17
AC × 33
AC × 49
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt
Subtask3 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask3_31.txt, subtask3_32.txt, subtask3_33.txt, subtask3_34.txt, subtask3_35.txt, subtask3_36.txt, subtask3_37.txt, subtask3_38.txt, subtask3_39.txt, subtask3_40.txt, subtask3_41.txt, subtask3_42.txt, subtask3_43.txt, subtask3_44.txt, subtask3_45.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 168 ms 8232 KB
subtask0_sample_02.txt AC 166 ms 8144 KB
subtask0_sample_03.txt AC 170 ms 8220 KB
subtask0_sample_04.txt AC 170 ms 8328 KB
subtask1_01.txt AC 166 ms 8200 KB
subtask1_02.txt AC 167 ms 8304 KB
subtask1_03.txt AC 169 ms 8188 KB
subtask1_04.txt AC 165 ms 8312 KB
subtask1_05.txt AC 165 ms 8244 KB
subtask1_06.txt AC 166 ms 8212 KB
subtask1_07.txt AC 167 ms 8332 KB
subtask1_08.txt AC 168 ms 8184 KB
subtask1_09.txt AC 165 ms 8200 KB
subtask1_10.txt AC 168 ms 8208 KB
subtask1_11.txt AC 164 ms 8312 KB
subtask1_12.txt AC 167 ms 8184 KB
subtask1_13.txt AC 165 ms 8184 KB
subtask1_14.txt AC 169 ms 8208 KB
subtask1_15.txt AC 165 ms 8196 KB
subtask2_16.txt AC 173 ms 8344 KB
subtask2_17.txt AC 174 ms 8216 KB
subtask2_18.txt AC 168 ms 8184 KB
subtask2_19.txt AC 169 ms 8224 KB
subtask2_20.txt AC 175 ms 8228 KB
subtask2_21.txt AC 174 ms 8284 KB
subtask2_22.txt AC 171 ms 8216 KB
subtask2_23.txt AC 171 ms 8276 KB
subtask2_24.txt AC 171 ms 8216 KB
subtask2_25.txt AC 167 ms 8340 KB
subtask2_26.txt AC 171 ms 8332 KB
subtask2_27.txt AC 168 ms 8272 KB
subtask2_28.txt AC 169 ms 8328 KB
subtask2_29.txt AC 168 ms 8276 KB
subtask2_30.txt AC 172 ms 8340 KB
subtask3_31.txt AC 171 ms 8340 KB
subtask3_32.txt AC 168 ms 8220 KB
subtask3_33.txt AC 168 ms 8340 KB
subtask3_34.txt AC 167 ms 8336 KB
subtask3_35.txt AC 170 ms 8304 KB
subtask3_36.txt AC 168 ms 8212 KB
subtask3_37.txt AC 170 ms 8340 KB
subtask3_38.txt AC 168 ms 8312 KB
subtask3_39.txt AC 170 ms 8332 KB
subtask3_40.txt AC 166 ms 8328 KB
subtask3_41.txt AC 176 ms 8316 KB
subtask3_42.txt AC 173 ms 8276 KB
subtask3_43.txt AC 169 ms 8344 KB
subtask3_44.txt AC 169 ms 8324 KB
subtask3_45.txt AC 172 ms 8344 KB