#61549 (C#(csc)) No.308 素数は通れません

提出ソース

結果

問題	No.308 素数は通れません
ユーザー	紙ぺーぱー
提出日時	2015-12-01 01:20:35
言語	C#(csc) (csc 3.9.0)
結果	TLE
実行時間	-
コード長	9,167 bytes
コンパイル時間	1,063 ms
コンパイル使用メモリ	121,128 KB
実行使用メモリ	26,496 KB
最終ジャッジ日時	2024-09-14 05:59:13
合計ジャッジ時間	8,613 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	25 ms 23,596 KB
testcase_01	AC	26 ms 23,728 KB
testcase_02	AC	26 ms 26,020 KB
testcase_03	AC	25 ms 21,688 KB
testcase_04	AC	25 ms 23,732 KB
testcase_05	AC	26 ms 23,856 KB
testcase_06	AC	26 ms 25,852 KB
testcase_07	AC	25 ms 23,676 KB
testcase_08	AC	26 ms 25,644 KB
testcase_09	AC	26 ms 25,772 KB
testcase_10	AC	26 ms 23,460 KB
testcase_11	AC	25 ms 23,596 KB
testcase_12	AC	25 ms 23,932 KB
testcase_13	AC	25 ms 23,592 KB
testcase_14	AC	26 ms 23,816 KB
testcase_15	AC	25 ms 23,812 KB
testcase_16	AC	26 ms 25,900 KB
testcase_17	AC	26 ms 23,936 KB
testcase_18	AC	25 ms 23,856 KB
testcase_19	AC	26 ms 25,984 KB
testcase_20	AC	26 ms 23,684 KB
testcase_21	AC	26 ms 25,896 KB
testcase_22	AC	26 ms 25,772 KB
testcase_23	AC	25 ms 23,720 KB
testcase_24	AC	26 ms 23,604 KB
testcase_25	AC	25 ms 23,684 KB
testcase_26	AC	25 ms 23,820 KB
testcase_27	AC	25 ms 23,596 KB
testcase_28	AC	26 ms 23,728 KB
testcase_29	AC	26 ms 25,900 KB
testcase_30	AC	25 ms 23,720 KB
testcase_31	AC	26 ms 23,816 KB
testcase_32	AC	25 ms 23,808 KB
testcase_33	AC	26 ms 26,112 KB
testcase_34	AC	26 ms 25,900 KB
testcase_35	AC	26 ms 23,948 KB
testcase_36	AC	31 ms 26,232 KB
testcase_37	AC	31 ms 24,064 KB
testcase_38	AC	31 ms 24,460 KB
testcase_39	AC	31 ms 24,320 KB
testcase_40	AC	31 ms 23,940 KB
testcase_41	AC	31 ms 24,064 KB
testcase_42	AC	31 ms 21,940 KB
testcase_43	AC	32 ms 26,232 KB
testcase_44	AC	31 ms 24,368 KB
testcase_45	AC	32 ms 24,320 KB
testcase_46	AC	32 ms 24,368 KB
testcase_47	AC	31 ms 26,108 KB
testcase_48	AC	31 ms 23,940 KB
testcase_49	AC	31 ms 24,064 KB
testcase_50	AC	31 ms 23,944 KB
testcase_51	AC	32 ms 26,236 KB
testcase_52	AC	32 ms 24,196 KB
testcase_53	AC	30 ms 23,940 KB
testcase_54	AC	30 ms 24,072 KB
testcase_55	AC	31 ms 23,940 KB
testcase_56	AC	31 ms 24,320 KB
testcase_57	AC	32 ms 26,112 KB
testcase_58	AC	31 ms 23,940 KB
testcase_59	AC	31 ms 24,580 KB
testcase_60	AC	32 ms 24,064 KB
testcase_61	AC	31 ms 24,196 KB
testcase_62	AC	32 ms 24,064 KB
testcase_63	AC	32 ms 24,324 KB
testcase_64	AC	31 ms 24,196 KB
testcase_65	AC	32 ms 26,272 KB
testcase_66	AC	32 ms 24,328 KB
testcase_67	AC	31 ms 24,072 KB
testcase_68	AC	31 ms 24,068 KB
testcase_69	AC	32 ms 23,944 KB
testcase_70	AC	33 ms 24,316 KB
testcase_71	AC	32 ms 24,108 KB
testcase_72	AC	32 ms 24,068 KB
testcase_73	AC	32 ms 24,192 KB
testcase_74	AC	31 ms 24,064 KB
testcase_75	AC	32 ms 24,364 KB
testcase_76	AC	31 ms 24,448 KB
testcase_77	AC	31 ms 24,068 KB
testcase_78	AC	33 ms 26,496 KB
testcase_79	AC	32 ms 26,236 KB
testcase_80	AC	32 ms 22,196 KB
testcase_81	AC	32 ms 24,368 KB
testcase_82	AC	32 ms 26,244 KB
testcase_83	AC	32 ms 26,236 KB
testcase_84	AC	61 ms 26,248 KB
testcase_85	AC	32 ms 23,936 KB
testcase_86	AC	211 ms 24,196 KB
testcase_87	TLE	-
testcase_88	AC	31 ms 22,196 KB
testcase_89	AC	32 ms 25,988 KB
testcase_90	AC	32 ms 24,068 KB
testcase_91	AC	32 ms 25,984 KB
testcase_92	AC	31 ms 24,192 KB
testcase_93	AC	32 ms 26,244 KB
testcase_94	AC	32 ms 24,196 KB
testcase_95	AC	32 ms 23,932 KB
testcase_96	AC	32 ms 22,324 KB
testcase_97	AC	32 ms 25,860 KB
testcase_98	AC	31 ms 22,068 KB
testcase_99	AC	32 ms 24,200 KB
testcase_100	AC	32 ms 26,360 KB
testcase_101	WA	-
testcase_102	AC	32 ms 24,324 KB
testcase_103	AC	32 ms 26,364 KB
testcase_104	AC	31 ms 22,064 KB
testcase_105	AC	31 ms 24,372 KB
testcase_106	AC	32 ms 26,360 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
namespace Program
{

    public class Solver
    {
        bool[] primes = MathEx.Sieve(20000);
        public void Solve()
        {
            //Write(17, 8);

            var s = sc.Scan();

            if (s.Length <= 3)
            {
                var v = int.Parse(s);
                for (int i = 3; i < v; i++)
                {
                    var k = (v + i - 1) / i;
                    var bucket = Enumerate(k, x => new char[i]);
                    var set = new DisjointSet(v);
                    for (int j = 0; j < v; j++)
                    {
                        bucket[j / i][j % i] = (primes[j + 1]) ? 'x' : 'o';
                        if (primes[j + 1]) continue;
                        var u = (j / i - 1);

                        if (u >= 0 && !primes[j + 1 - i])
                            set.Unite(j, j - i);
                        if (j % i > 0 && !primes[j])
                            set.Unite(j, j - 1);
                    }
                    //foreach (var x in bucket) IO.Printer.Out.WriteLine(x.AsString());
                    if (set.IsUnited(0, v - 1))
                    {
                        IO.Printer.Out.WriteLine(i);
                        return;
                    }
                }
            }
            else
            {
                var v = BigInteger.Parse(s) - 8;
                if (v % 8 != 1)
                {

                    IO.Printer.Out.WriteLine(8);
                }
                else
                {
                    long u;
                    if (long.TryParse(s, out u) && isPrime(u - 8))
                    {

                        IO.Printer.Out.WriteLine(14);

                    }
                    else IO.Printer.Out.WriteLine(8);
                }

            }

        }


        static public long ModPow(long x, long n, long mod)
        {
            long r = 1;
            while (n > 0)
            {
                if ((n & 1) == 1)
                    r = r * x % mod;
                x = (x * x) % mod;
                n >>= 1;
            }
            return r;
        }
        bool suspect(long a, long s, long d, long n)
        {
            var x = ModPow(a, d, n);
            if (x == 1) return true;
            for (int r = 0; r < s; ++r)
            {
                if (x == n - 1) return true;
                x = x * x % n;
            }
            return false;
        }
        // {2,7,61,-1}                 is for n < 4759123141 (= 2^32)
        // {2,3,5,7,11,13,17,19,23,-1} is for n < 10^16 (at least)
        bool isPrime(long n)
        {
            if (n >= 100000000000000000) return true;
            for (long u = 2; u * u <= n; u++)
            {
                if (n % u == 0) return false;
            }
            return true;
            /*
            if (n <= 1 || (n > 2 && n % 2 == 0)) return false;
            var test = new int[] { 2, 3, 5, 7, 11, 13, 17, 19, 23, -1 };
            long d = n - 1, s = 0;
            while (d % 2 == 0) { ++s; d /= 2; }
            for (int i = 0; test[i] < n && test[i] != -1; ++i)
                if (!suspect(test[i], s, d, n)) return false;
            return true;
            */
        }

        public void Write(int v, int i)
        {
            var k = (v + i - 1) / i;
            var bucket = Enumerate(k, x => new char[i]);
            var set = new DisjointSet(v);
            for (int j = 0; j < v; j++)
            {
                bucket[j / i][j % i] = (primes[j + 1]) ? 'x' : 'o';
                if (primes[j + 1]) continue;
                var u = (j / i - 1);

                if (u >= 0 && !primes[j + 1 - i])
                    set.Unite(j, j - i);
                if (j % i > 0 && !primes[j])
                    set.Unite(j, j - 1);
            }
            IO.Printer.Out.WriteLine("{0} {1}", v, i);
            foreach (var x in bucket) IO.Printer.Out.WriteLine(x.AsString());

        }
        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 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, 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; }
        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 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(), 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 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); }
    }
}

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 sieve
static public partial class MathEx
{
    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;
    }
}
#endregion
#region DisjointSet
public class DisjointSet
{
    public int[] par, ranks, count;
    public DisjointSet(int n)
    {
        par = new int[n];
        count = new int[n];
        for (int i = 0; i < n; i++)
        {
            par[i] = i;
            count[i] = 1;
        }
        ranks = new int[n];
    }
    public int this[int id] { get { return (par[id] == id) ? id : this[par[id]]; } }
    public bool Unite(int x, int y)
    {
        x = this[x]; y = this[y];
        if (x == y) return false;
        if (ranks[x] < ranks[y])
        {
            par[x] = y;
            count[y] += count[x];
        }
        else
        {
            par[y] = x;
            count[x] += count[y];
            if (ranks[x] == ranks[y])
                ranks[x]++;
        }
        return true;
    }
    public int Size(int x) { return count[this[x]]; }
    public bool IsUnited(int x, int y) { return this[x] == this[y]; }

}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード