結果

問題 No.7 プライムナンバーゲーム
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-01-17 02:59:57
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 59 ms / 5,000 ms
コード長 5,206 bytes
コンパイル時間 2,630 ms
コンパイル使用メモリ 117,836 KB
実行使用メモリ 26,240 KB
最終ジャッジ日時 2024-04-09 03:41:56
合計ジャッジ時間 4,473 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
23,272 KB
testcase_01 AC 24 ms
25,340 KB
testcase_02 AC 59 ms
24,288 KB
testcase_03 AC 26 ms
23,524 KB
testcase_04 AC 24 ms
23,652 KB
testcase_05 AC 25 ms
21,688 KB
testcase_06 AC 35 ms
23,776 KB
testcase_07 AC 33 ms
25,848 KB
testcase_08 AC 27 ms
25,812 KB
testcase_09 AC 40 ms
24,036 KB
testcase_10 AC 25 ms
23,476 KB
testcase_11 AC 31 ms
22,068 KB
testcase_12 AC 50 ms
26,240 KB
testcase_13 AC 51 ms
24,296 KB
testcase_14 AC 59 ms
24,416 KB
testcase_15 AC 57 ms
24,296 KB
testcase_16 AC 55 ms
26,192 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
//using System.Numerics;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var isprime = Sieve(n);
            var primes = new List<int>();
            for (int i = 0; i <= n; i++)
                if (isprime[i]) primes.Add(i);
            var dp = new bool?[n + 1];
            Func<int, bool> dfs = null;
            dfs = v =>
                {
                    if (v == 0 || v == 1) return true;
                    if (dp[v] != null) return dp[v].Value;
                    foreach (var p in primes)
                    {
                        if (v < p) break;
                        if (!dfs(v - p)) return (dp[v] = true).Value;
                    }
                    return (dp[v] = false).Value;
                };
            if (dfs(n))
                IO.Printer.Out.WriteLine("Win");
            else IO.Printer.Out.WriteLine("Lose");

        }
        static public bool[] Sieve(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;
                else for (int j = i * i; j <= p; j += i)
                        isPrime[j] = false;
            return isPrime;
        }

        internal IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static 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; }
        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; }
    }
}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Linq;
    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 System.Globalization.CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new System.Text.UTF8Encoding(false, true)) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        private 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); return (char)b; }
        public char[] Char(int n) { var a = new char[n]; for (int i = 0; i < n; i++) a[i] = Char(); return a; }
        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 long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), System.Globalization.CultureInfo.InvariantCulture); }
        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 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); }
        public void Flush() { str.Flush(); }

    }
}
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
0