結果
問題 | No.713 素数の和 |
ユーザー |
![]() |
提出日時 | 2020-05-09 14:30:00 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 4,942 bytes |
コンパイル時間 | 955 ms |
コンパイル使用メモリ | 109,696 KB |
実行使用メモリ | 18,944 KB |
最終ジャッジ日時 | 2024-07-05 18:33:36 |
合計ジャッジ時間 | 1,757 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 6 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections;using System.Collections.Generic;using System.IO;using System.Linq;class Program{static void Main(string[] args){var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };Console.SetOut(sw);Solve();Console.Out.Flush();}static void Solve(){var N = sc.ReadInt();var primes = SieveOfEratosthenes(N);var ans = primes.Sum();Console.WriteLine(ans);}static Scanner sc = new Scanner();static List<int> SieveOfEratosthenes(int n){var p = new List<int>();var s = new List<int>();if (n < 2) return p;// 素数候補を列挙する[2..n]for (int i = 2; i <= n; i++) { s.Add(i); };// √n以下の素数候補についてふるい落としを行うwhile (s[0] * s[0] <= n){var prime = s[0]; // 先頭要素は素数p.Add(prime); // 先頭を素数リストへs.RemoveAt(0); // 先頭要素削除// ふるい落としs.RemoveAll(x => x % prime == 0);}// 残りの探索リストを素数リストに追加p.AddRange(s);return p;}}class Scanner{string[] S = new string[0];int Index = 0;char[] Separators = new char[] { ' ' };public string Next(){if (this.Index < this.S.Length) return this.S[this.Index++];var line = "";while (line == "") line = Console.ReadLine();this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries);if (this.S.Length == 0) return this.Next();this.Index = 0;return this.S[this.Index++];}public string ReadStr(){return this.Next();}public char ReadChar(){return this.Next()[0];}public int ReadInt(){return int.Parse(this.Next());}public uint ReadUInt(){return uint.Parse(this.Next());}public long ReadLong(){return long.Parse(this.Next());}public double ReadDouble(){return double.Parse(this.Next());}public Tuple<int, int> ReadTup(int add = 0){return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add);}public Tuple<long, long> ReadTupLong(int add = 0){return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add);}public Tuple<int, int, int> ReadTup3(int add = 0){return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);}public Tuple<int, int, int, int> ReadTup4(int add = 0){return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);}public int[] ReadIntArray(int n){var array = new int[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadInt();}return array;}public long[] ReadLongArray(int n){var array = new long[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadLong();}return array;}public double[] ReadDoubleArray(int n){var array = new double[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadDouble();}return array;}public char[] ReadCharArray(int n){var array = new char[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadChar();}return array;}public string[] ReadStrArray(int n){var array = new string[n];for (int i = 0; i < array.Length; i++){array[i] = this.ReadStr();}return array;}public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0){var array = new Tuple<long, long>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTupLong(add);}return array;}public Tuple<int, int>[] ReadTupArray(int n, int add = 0){var array = new Tuple<int, int>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTup(add);}return array;}public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0){var array = new Tuple<int, int, int>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTup3(add);}return array;}public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0){var array = new Tuple<int, int, int, int>[n];for (int i = 0; i < n; i++){array[i] = this.ReadTup4(add);}return array;}}