結果

問題 No.144 エラトステネスのざる
ユーザー eSeFeSeF
提出日時 2020-06-12 12:53:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 90 ms / 2,000 ms
コード長 7,426 bytes
コンパイル時間 1,386 ms
コンパイル使用メモリ 121,800 KB
実行使用メモリ 35,748 KB
最終ジャッジ日時 2024-06-24 03:48:19
合計ジャッジ時間 3,147 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
28,216 KB
testcase_01 AC 32 ms
28,388 KB
testcase_02 AC 31 ms
26,420 KB
testcase_03 AC 31 ms
26,592 KB
testcase_04 AC 32 ms
26,472 KB
testcase_05 AC 31 ms
26,164 KB
testcase_06 AC 31 ms
28,252 KB
testcase_07 AC 30 ms
26,460 KB
testcase_08 AC 30 ms
26,292 KB
testcase_09 AC 30 ms
26,204 KB
testcase_10 AC 31 ms
26,076 KB
testcase_11 AC 32 ms
26,236 KB
testcase_12 AC 30 ms
26,160 KB
testcase_13 AC 85 ms
33,592 KB
testcase_14 AC 83 ms
33,612 KB
testcase_15 AC 84 ms
33,748 KB
testcase_16 AC 87 ms
31,312 KB
testcase_17 AC 86 ms
33,604 KB
testcase_18 AC 90 ms
35,748 KB
testcase_19 AC 84 ms
33,744 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 System.Numerics;
using System.Threading;
using static System.Math;
using static System.Array;
using static AtCoder.IO_ShortCut;
using static AtCoder.Tool;
using static AtCoder.ModInt;
namespace AtCoder
{
class AC
{
const int MOD = 1000000007;
//const int MOD = 998244353;
const int INF = int.MaxValue / 2;
const long SINF = long.MaxValue / 2;
const double EPS = 1e-8;
static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };
static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };
//static List<List<int>> G = new List<List<int>>();
static List<List<Edge>> G = new List<List<Edge>>();
//static List<Edge> E = new List<Edge>();
static void Main(string[] args)
{
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw);
/*var th = new Thread(Run, 1 << 26);
th.Start();
th.Join();*/
Run();
Console.Out.Flush();
}
static void Run()
{
int Testcase = 1;
for (var _ = 0; _ < Testcase; _++) Solve();
}
static void Solve()
{
int N;
double p;
Input(out N, out p);
var prob = new double[N + 1];
Initialize(ref prob, 1.0);
double ans = 0;
for(var i = 2; i <= N; i++)
{
ans += prob[i];
for(var j = 2 * i; j <= N; j += i)
{
prob[j] *= (1 - p);
}
}
//Out_Sep(prob);
OutL(ans);
}
public struct Edge
{
public int from;
public int to;
public long dist;
public Edge(int t, long c)
{
from = -1;
to = t;
dist = c;
}
public Edge(int f, int t, long c)
{
from = f;
to = t;
dist = c;
}
}
}
struct ModInt
{
public long value;
private const int MOD = 1000000007;
//private const int MOD = 998244353;
public ModInt(long value) { this.value = value; }
public static implicit operator ModInt(long a)
{
var ret = a % MOD;
return new ModInt(ret < 0 ? (ret + MOD) : ret);
}
public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);
public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);
public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);
public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);
public static ModInt operator <<(ModInt a, int n) => (a.value << n);
public static ModInt operator >>(ModInt a, int n) => (a.value >> n);
public static ModInt operator ++(ModInt a) => a.value + 1;
public static ModInt operator --(ModInt a) => a.value - 1;
public static ModInt Modpow(ModInt a, long n)
{
var k = a;
ModInt ret = 1;
while (n > 0)
{
if ((n & 1) != 0) ret *= k;
k *= k;
n >>= 1;
}
return ret;
}
private static readonly List<long> Factorials = new List<long>() { 1 };
public static ModInt Fac(long n)
{
for (var i = Factorials.Count(); i <= n; i++)
{
Factorials.Add((Factorials[i - 1] * i) % MOD);
}
return Factorials[(int)n];
}
public static ModInt nCr(long n, long r)
{
return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));
}
public static explicit operator int(ModInt a) => (int)a.value;
}
static class IO_ShortCut
{
public static string[] _ReadSplit => Console.ReadLine().Split();
public static int[] _ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);
public static long[] _ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);
public static double[] _ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);
public static string Str => Console.ReadLine();
public static int Int => int.Parse(Console.ReadLine());
public static long Long => long.Parse(Console.ReadLine());
public static double Double => double.Parse(Console.ReadLine());
public static T Conv<T>(string input)
{
if (typeof(T).Equals(typeof(ModInt)))
{
return (T)(dynamic)(long.Parse(input));
}
return (T)Convert.ChangeType(input, typeof(T));
}
public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());
public static void Input<T, U>(out T a, out U b)
{ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); }
public static void Input<T, U, V>(out T a, out U b, out V c)
{ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); }
public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d)
{ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); }
public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
{ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); }
public static void OutL(object s) => Console.WriteLine(s);
public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));
public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));
public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));
public static void Out_One(object s) => Console.Write($"{s} ");
public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");
public static void Endl() => Console.WriteLine();
}
public static class Tool
{
static public void Initialize<T>(ref T[] array, T initialvalue)
{
array = ConvertAll(array, x => initialvalue);
}
static public void Swap<T>(ref T a, ref T b)
{
T keep = a;
a = b;
b = keep;
}
static public void Display<T>(T[,] array2d, int n, int m)
{
for (var i = 0; i < n; i++)
{
for (var j = 0; j < m; j++)
{
Console.Write($"{array2d[i, j]} ");
}
Console.WriteLine();
}
}
static public long Gcd(long a, long b)
{
if (a == 0 || b == 0) return Max(a, b);
return a % b == 0 ? b : Gcd(b, a % b);
}
static public long LPow(int a, int b) => (long)Pow(a, b);
static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;
static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0