結果
問題 | No.308 素数は通れません |
ユーザー | りあん |
提出日時 | 2015-12-02 00:40:45 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,566 bytes |
コンパイル時間 | 3,525 ms |
コンパイル使用メモリ | 117,220 KB |
実行使用メモリ | 29,040 KB |
最終ジャッジ日時 | 2024-09-14 07:30:13 |
合計ジャッジ時間 | 8,785 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
18,048 KB |
testcase_01 | AC | 30 ms
18,176 KB |
testcase_02 | AC | 29 ms
18,304 KB |
testcase_03 | AC | 30 ms
18,304 KB |
testcase_04 | AC | 29 ms
18,304 KB |
testcase_05 | AC | 29 ms
18,176 KB |
testcase_06 | AC | 29 ms
18,176 KB |
testcase_07 | AC | 29 ms
18,304 KB |
testcase_08 | AC | 29 ms
18,176 KB |
testcase_09 | AC | 29 ms
18,048 KB |
testcase_10 | AC | 30 ms
18,304 KB |
testcase_11 | AC | 29 ms
18,432 KB |
testcase_12 | AC | 29 ms
18,432 KB |
testcase_13 | AC | 29 ms
18,048 KB |
testcase_14 | AC | 30 ms
18,432 KB |
testcase_15 | AC | 30 ms
18,048 KB |
testcase_16 | AC | 29 ms
18,176 KB |
testcase_17 | AC | 29 ms
18,176 KB |
testcase_18 | AC | 29 ms
18,048 KB |
testcase_19 | AC | 29 ms
18,176 KB |
testcase_20 | AC | 31 ms
18,176 KB |
testcase_21 | AC | 30 ms
18,304 KB |
testcase_22 | AC | 30 ms
18,304 KB |
testcase_23 | AC | 29 ms
18,048 KB |
testcase_24 | AC | 29 ms
18,176 KB |
testcase_25 | AC | 29 ms
18,304 KB |
testcase_26 | AC | 29 ms
18,176 KB |
testcase_27 | AC | 29 ms
18,304 KB |
testcase_28 | AC | 29 ms
18,048 KB |
testcase_29 | AC | 29 ms
18,176 KB |
testcase_30 | AC | 29 ms
18,304 KB |
testcase_31 | AC | 29 ms
18,304 KB |
testcase_32 | AC | 30 ms
18,176 KB |
testcase_33 | AC | 29 ms
18,048 KB |
testcase_34 | AC | 29 ms
18,304 KB |
testcase_35 | AC | 31 ms
18,176 KB |
testcase_36 | AC | 29 ms
18,304 KB |
testcase_37 | AC | 29 ms
18,176 KB |
testcase_38 | AC | 29 ms
18,304 KB |
testcase_39 | AC | 30 ms
18,048 KB |
testcase_40 | AC | 29 ms
18,176 KB |
testcase_41 | AC | 29 ms
18,048 KB |
testcase_42 | AC | 29 ms
17,920 KB |
testcase_43 | AC | 29 ms
18,304 KB |
testcase_44 | AC | 29 ms
18,304 KB |
testcase_45 | AC | 29 ms
18,176 KB |
testcase_46 | AC | 30 ms
18,176 KB |
testcase_47 | AC | 29 ms
18,176 KB |
testcase_48 | AC | 30 ms
18,432 KB |
testcase_49 | AC | 29 ms
18,304 KB |
testcase_50 | AC | 29 ms
18,176 KB |
testcase_51 | AC | 29 ms
18,432 KB |
testcase_52 | AC | 29 ms
18,304 KB |
testcase_53 | AC | 29 ms
18,176 KB |
testcase_54 | AC | 29 ms
18,304 KB |
testcase_55 | AC | 28 ms
18,048 KB |
testcase_56 | AC | 30 ms
17,920 KB |
testcase_57 | AC | 29 ms
18,304 KB |
testcase_58 | AC | 29 ms
18,304 KB |
testcase_59 | AC | 29 ms
18,048 KB |
testcase_60 | AC | 30 ms
18,176 KB |
testcase_61 | AC | 30 ms
18,304 KB |
testcase_62 | AC | 30 ms
18,304 KB |
testcase_63 | AC | 31 ms
18,176 KB |
testcase_64 | AC | 30 ms
18,176 KB |
testcase_65 | AC | 30 ms
18,176 KB |
testcase_66 | AC | 30 ms
18,304 KB |
testcase_67 | AC | 30 ms
18,176 KB |
testcase_68 | AC | 29 ms
18,176 KB |
testcase_69 | AC | 30 ms
18,176 KB |
testcase_70 | AC | 30 ms
18,048 KB |
testcase_71 | AC | 30 ms
18,304 KB |
testcase_72 | AC | 30 ms
18,176 KB |
testcase_73 | AC | 30 ms
18,176 KB |
testcase_74 | AC | 30 ms
18,304 KB |
testcase_75 | AC | 30 ms
18,304 KB |
testcase_76 | AC | 33 ms
18,048 KB |
testcase_77 | AC | 30 ms
18,176 KB |
testcase_78 | AC | 30 ms
18,176 KB |
testcase_79 | AC | 29 ms
18,176 KB |
testcase_80 | AC | 160 ms
17,920 KB |
testcase_81 | AC | 219 ms
18,304 KB |
testcase_82 | AC | 29 ms
18,176 KB |
testcase_83 | AC | 30 ms
18,304 KB |
testcase_84 | AC | 216 ms
18,432 KB |
testcase_85 | AC | 30 ms
18,176 KB |
testcase_86 | AC | 221 ms
18,432 KB |
testcase_87 | AC | 223 ms
18,560 KB |
testcase_88 | AC | 30 ms
18,304 KB |
testcase_89 | AC | 30 ms
18,048 KB |
testcase_90 | AC | 227 ms
20,352 KB |
testcase_91 | AC | 30 ms
18,432 KB |
testcase_92 | AC | 29 ms
18,176 KB |
testcase_93 | AC | 29 ms
18,048 KB |
testcase_94 | AC | 29 ms
18,048 KB |
testcase_95 | AC | 29 ms
18,176 KB |
testcase_96 | AC | 29 ms
18,048 KB |
testcase_97 | AC | 29 ms
18,176 KB |
testcase_98 | AC | 29 ms
18,176 KB |
testcase_99 | WA | - |
testcase_100 | WA | - |
testcase_101 | AC | 268 ms
21,120 KB |
testcase_102 | AC | 29 ms
18,304 KB |
testcase_103 | AC | 29 ms
18,048 KB |
testcase_104 | AC | 30 ms
18,048 KB |
testcase_105 | AC | 29 ms
18,304 KB |
testcase_106 | AC | 30 ms
18,176 KB |
コンパイルメッセージ
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.Generic; using System.Linq; using System.IO; using System.Text; using System.Numerics; namespace Solver { class Program { const int M = 1000000007; const double eps = 1e-9; static void Main() { var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var sc = new Scan(); var s = sc.Str; var n = BigInteger.Parse(s); if (n < 26) { var p = int.Parse(s); switch (p) { case 8: case 9: case 10: case 15: case 16: case 22: Console.WriteLine(7); return; case 18: Console.WriteLine(8); return; case 21: Console.WriteLine(19); return; case 25: Console.WriteLine(23); return; } Console.WriteLine(p - 1); return; } if (n % 8 == 1 && isprime(n - 8)) { Console.WriteLine(14); return; } sw.WriteLine(8); sw.Flush(); } static bool isprime(BigInteger n) { if (n == 1) return false; int m = 3000000; if (n <= m) m = (int)n - 1; for (int i = 2; i <= m; i++) { if (n % i == 0) return false; } long b = m; if (b * b < n) return primesub(n); return true; } static bool primesub(BigInteger n) { var p = new BigInteger(Math.Sqrt(double.Parse(n.ToString()))); for (var i = p - 10000; i < p + 10; i++) { if (n % i == 0) return false; } return true; } static string strsort(string s) { var c = s.ToCharArray(); Array.Sort(c); return string.Join("", c); } static string strswap(string s, int i, int j) { var c = s.ToCharArray(); c[i] = s[j]; c[j] = s[i]; return string.Join("", c); } static T[] copy<T>(T[] a) { var ret = new T[a.Length]; for (int i = 0; i < a.Length; i++) ret[i] = a[i]; return ret; } } class Scan { public int Int { get { return int.Parse(Console.ReadLine().Trim()); } } public long Long { get { return long.Parse(Console.ReadLine().Trim()); } } public string Str { get { return Console.ReadLine().Trim(); } } public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } } public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); } public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } } public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } } public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } } public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } } public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } } public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; } public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; } public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; } public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; } public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; } public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; } public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); } public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; } public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; } public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; } } class mymath { int M; const double eps = 1e-9; public mymath(int M) { this.M = M; } public long pow(long a, long b) { if (b == 0) return 1; if (b == 1) return a % M; long t = pow(a, b / 2); if ((b & 1) == 0) return t * t % M; else return t * t % M * a % M; } public long gcd(long a, long b) { while (b != 0) { var t = a % b; a = b; b = t; } return a; } public long lcm(int a, int b) { return (a * b) / gcd(a, b); } } }