結果

問題 No.407 鴨等素数間隔列の数え上げ
ユーザー 紙ぺーぱー
提出日時 2016-08-05 22:30:26
言語 C#
(csc 3.4.0-beta4-19569-03)
結果
AC  
実行時間 160 ms
コード長 5,280 Byte
コンパイル時間 1,160 ms
使用メモリ 35,908 KB
最終ジャッジ日時 2020-01-13 07:59:48

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
sample_01.txt AC 24 ms
17,468 KB
sample_02.txt AC 20 ms
17,280 KB
sample_03.txt AC 24 ms
17,464 KB
sample_04.txt AC 36 ms
18,664 KB
sample_05.txt AC 20 ms
17,532 KB
system_test1.txt AC 156 ms
35,264 KB
system_test2.txt AC 92 ms
26,632 KB
test_1_01.txt AC 20 ms
17,336 KB
test_1_02.txt AC 24 ms
17,396 KB
test_1_03.txt AC 24 ms
17,500 KB
test_1_04.txt AC 24 ms
17,476 KB
test_1_05.txt AC 24 ms
17,580 KB
test_2_01.txt AC 28 ms
17,428 KB
test_2_02.txt AC 24 ms
17,428 KB
test_2_03.txt AC 24 ms
17,508 KB
test_2_04.txt AC 24 ms
17,320 KB
test_2_05.txt AC 24 ms
17,484 KB
test_2_06.txt AC 20 ms
17,472 KB
test_2_07.txt AC 24 ms
17,472 KB
test_3_01.txt AC 36 ms
18,792 KB
test_3_02.txt AC 60 ms
22,324 KB
test_3_03.txt AC 40 ms
19,180 KB
test_3_04.txt AC 36 ms
19,008 KB
test_3_05.txt AC 48 ms
20,772 KB
test_3_06.txt AC 60 ms
22,072 KB
test_3_07.txt AC 88 ms
26,220 KB
test_3_08.txt AC 84 ms
26,244 KB
test_3_09.txt AC 32 ms
17,992 KB
test_3_10.txt AC 48 ms
21,032 KB
test_3_11.txt AC 84 ms
25,892 KB
test_3_12.txt AC 32 ms
18,804 KB
test_3_13.txt AC 72 ms
24,572 KB
test_3_14.txt AC 84 ms
26,012 KB
test_4_01.txt AC 148 ms
35,908 KB
test_4_02.txt AC 160 ms
35,704 KB
test_4_03.txt AC 140 ms
34,544 KB
テストケース一括ダウンロード
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.4.0-beta4-19569-03 (82f2e254)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
using System;
using System.Linq;
using System.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Long();
            var l = sc.Integer();
            long ans = 0;
            var primes = MathEx.SieveList(l + 1).ToArray();
            foreach (var x in primes)
            {
                var sum = x * (n - 1);
                var rem = Math.Max(0, l - sum + 1);
                ans += rem;
            }
            IO.Printer.Out.WriteLine(ans);
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }


    }
}
#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion

#region sieve list
static public partial class MathEx
{
    static public List<int> SieveList(int p)
    {
        var isPrime = new bool[p + 1];
        for (int i = 2; i <= p; i++)
            isPrime[i] = true;
        for (int i = 2; i * i <= p; i++)
        {
            if (!isPrime[i])
                continue;
            for (int j = i * i; j <= p; j += i)
                isPrime[j] = false;
        }
        var ret = new List<int>();
        for (int i = 0; i <= p; i++) if (isPrime[i]) ret.Add(i);
        return ret;
    }
}
#endregion
0