結果
| 問題 | No.407 鴨等素数間隔列の数え上げ |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-08-05 22:27:55 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,445 bytes |
| コンパイル時間 | 3,505 ms |
| コンパイル使用メモリ | 110,848 KB |
| 実行使用メモリ | 41,728 KB |
| 最終ジャッジ日時 | 2024-11-07 00:21:52 |
| 合計ジャッジ時間 | 6,502 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 24 ms
23,040 KB |
| testcase_01 | AC | 24 ms
17,792 KB |
| testcase_02 | AC | 24 ms
17,536 KB |
| testcase_03 | AC | 408 ms
22,912 KB |
| testcase_04 | AC | 24 ms
17,536 KB |
| testcase_05 | TLE | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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.Integer();
var l = sc.Integer();
long ans = 0;
var primes = MathEx.SieveList(l + 1);
for (int z = 0; z <= l; z++)
{
var rem = l - z;
rem /= (n - 1);
var c = primes.UpperBound(rem);
ans += c;
}
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
#region BinarySearch for List
static public partial class Algorithm
{
static private int binarySearch<T>(this IList<T> a, int idx, int len, T v, Comparison<T> cmp, bool islb)
{
int l = idx;
int h = idx + len - 1;
while (l <= h)
{
int i = l + ((h - l) >> 1);
int ord;
if (a[i] == null || v == null) return -1;
else ord = cmp(a[i], v);
if (ord < 0) l = i + 1;
else if (ord == 0)
{
if (!islb) l = i + 1;
else h = i - 1;
}
else h = i - 1;
}
return l;
}
static public int UpperBound<T>(this IList<T> a, int idx, int len, T v, Comparison<T> cmp) { return binarySearch(a, idx, len, v, cmp, false); }
static public int UpperBound<T>(this IList<T> a, int idx, int len, T v) where T : IComparable<T> { return UpperBound(a, idx, len, v, Comparer<T>.Default.Compare); }
static public int UpperBound<T>(this IList<T> a, T v) where T : IComparable<T> { return UpperBound(a, 0, a.Count, v, Comparer<T>.Default.Compare); }
static public int UpperBound<T>(this IList<T> a, T v, IComparer<T> cmp) { return UpperBound(a, 0, a.Count, v, cmp.Compare); }
static public int UpperBound<T>(this IList<T> a, T v, Comparison<T> cmp) { return UpperBound(a, 0, a.Count, v, cmp); }
static public int LowerBound<T>(this IList<T> a, int idx, int len, T value, Comparison<T> cmp) { return binarySearch(a, idx, len, value, cmp, true); }
static public int LowerBound<T>(this IList<T> a, int idx, int len, T value) where T : IComparable<T> { return LowerBound(a, idx, len, value, Comparer<T>.Default.Compare); }
static public int LowerBound<T>(this IList<T> a, T val) where T : IComparable<T> { return LowerBound(a, 0, a.Count, val, Comparer<T>.Default.Compare); }
static public int LowerBound<T>(this IList<T> a, T val, IComparer<T> cmp) { return LowerBound(a, 0, a.Count, val, cmp.Compare); }
static public int LowerBound<T>(this IList<T> a, T v, Comparison<T> cmp) { return LowerBound(a, 0, a.Count, v, cmp); }
}
#endregion