結果

問題 No.774 tatyamと素数大富豪
コンテスト
ユーザー AreTrash
提出日時 2019-01-24 02:48:00
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 771 ms / 2,000 ms
コード長 5,391 bytes
コンパイル時間 975 ms
コンパイル使用メモリ 111,744 KB
実行使用メモリ 53,376 KB
最終ジャッジ日時 2024-09-16 04:34:35
合計ジャッジ時間 4,841 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 14
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;

namespace No774
{
    public class Program
    {
        void Solve(StreamScanner ss, StreamWriter sw)
        {
            //---------------------------------
            var N = ss.Next(int.Parse);
            var A = ss.Next(BigInteger.Parse, N);

            var sos = new SortedSet<BigInteger>();
            do
            {
                var n = (BigInteger)0;
                foreach (var a in A)
                {
                    if (a >= 10) n *= 100;
                    else n *= 10;
                    n += a;
                }
                sos.Add(n);
            }
            while (MathX.NextPermutation(A));

            foreach (var n in sos.Reverse())
            {
                if (!MillerRabin.IsPrime(n)) continue;
                sw.WriteLine(n);
                return;
            }

            sw.WriteLine(-1);
            //---------------------------------
        }

        static void Main()
        {
            var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput()));
            var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false};
            new Program().Solve(ss, sw);
            sw.Flush();
        }
    }

    public static partial class MathX
    {
        public static void Swap<T>(ref T left, ref T right)
        {
            var tmp = left;
            left = right;
            right = tmp;
        }

        //https://stackoverflow.com/questions/11208446/generating-permutations-of-a-set-most-efficiently
        //by Sani Singh Huttunen
        public static bool NextPermutation<T>(T[] items) where T : IComparable<T>
        {
            var x = -1;
            for (var i = items.Length - 2; i >= 0; i--)
            {
                if (items[i].CompareTo(items[i + 1]) >= 0) continue;
                x = i;
                break;
            }

            if (x < 0) return false;

            var y = -1;
            for (var i = items.Length - 1; i >= 0; i--)
            {
                if (items[x].CompareTo(items[i]) >= 0) continue;
                y = i;
                break;
            }

            Swap(ref items[x], ref items[y]);
            for (int i = x + 1, j = items.Length - 1; i < j; i++, j--)
            {
                Swap(ref items[i], ref items[j]);
            }

            return true;
        }
    }

    public static class MillerRabin
    {
        const int RandomTestCount = 30;

        static readonly BigInteger[] BasePrimes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,};
        static readonly BigInteger[] WitnessRanges =
        {
            2047,
            1373653,
            25326001,
            118670087467, //3215031751が例外
            2152302898747,
            3474749660383,
            341550071728321,
            341550071728321,
            3825123056546413051,
            3825123056546413051,
            3825123056546413051,
            BigInteger.Parse("318665857834031151167461"),
            BigInteger.Parse("3317044064679887385961981"),
        };

        public static bool IsPrime(BigInteger n)
        {
            if (n < 2 || n == 3215031751) return false;
            if (n < 42) return BasePrimes.Contains(n);
            if (BasePrimes.Any(p => n % p == 0)) return false;

            var d = n - 1;
            while ((d & 1) == 0) d >>= 1;

            for (var i = 0; i < BasePrimes.Length; i++)
            {
                if (!MillerRabinTest(n, d, BasePrimes[i])) return false;
                if (n < WitnessRanges[i]) return true;
            }

            //n > 3.3e24
            var random = new Random();
            for (var i = 0; i < RandomTestCount; i++)
            {
                if (!MillerRabinTest(n, d, random.Next(1, int.MaxValue))) return false;
            }
            return true;
        }

        static bool MillerRabinTest(BigInteger n, BigInteger d, BigInteger a)
        {
            a = BigInteger.ModPow(a, d, n);
            if (a == 1 || a == n - 1) return true;

            while ((d <<= 1) < n - 1)
            {
                a = a * a % n;
                if (a == n - 1) return true;
            }

            return false;
        }
    }

    public class StreamScanner
    {
        static readonly char[] Sep = {' '};
        readonly Queue<string> buffer = new Queue<string>();
        readonly TextReader textReader;

        public StreamScanner(TextReader textReader)
        {
            this.textReader = textReader;
        }

        public T Next<T>(Func<string, T> parser)
        {
            if (buffer.Count != 0) return parser(buffer.Dequeue());
            var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries);
            foreach (var nextString in nextStrings) buffer.Enqueue(nextString);
            return Next(parser);
        }

        public T[] Next<T>(Func<string, T> parser, int x)
        {
            var ret = new T[x];
            for (var i = 0; i < x; ++i) ret[i] = Next(parser);
            return ret;
        }

        public T[][] Next<T>(Func<string, T> parser, int x, int y)
        {
            var ret = new T[y][];
            for (var i = 0; i < y; ++i) ret[i] = Next(parser, x);
            return ret;
        }
    }
}
0