結果

問題 No.368 LCM of K-products
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-04-29 22:34:10
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,479 bytes
コンパイル時間 1,341 ms
コンパイル使用メモリ 114,304 KB
実行使用メモリ 146,548 KB
最終ジャッジ日時 2024-10-04 18:14:45
合計ジャッジ時間 7,249 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 220 ms
52,736 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 652 ms
84,480 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 28 ms
18,816 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 28 ms
19,072 KB
testcase_12 AC 29 ms
19,200 KB
testcase_13 AC 126 ms
41,216 KB
testcase_14 AC 299 ms
74,972 KB
testcase_15 WA -
testcase_16 AC 279 ms
74,924 KB
testcase_17 AC 181 ms
48,748 KB
testcase_18 AC 362 ms
83,532 KB
testcase_19 AC 52 ms
24,704 KB
testcase_20 AC 164 ms
44,864 KB
testcase_21 AC 42 ms
22,144 KB
testcase_22 AC 335 ms
80,244 KB
testcase_23 AC 28 ms
18,816 KB
testcase_24 AC 28 ms
18,816 KB
testcase_25 AC 29 ms
18,944 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 30 ms
19,072 KB
testcase_31 AC 29 ms
18,944 KB
testcase_32 WA -
testcase_33 AC 83 ms
37,376 KB
testcase_34 AC 65 ms
28,032 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.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number=System.Int64;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n=sc.Integer();
            var k=sc.Integer();
            var a=sc.Integer(n);
            var b=Enumerate(n, x=>MathEx.GetFactors(a[x]));
            var primes=new List<long>();
            foreach (var map in b)
            {
                foreach (var kv in map)
                {
                    primes.Add(kv.Key);
                }
            }
            primes=primes.Distinct().ToList();
            const long MOD=1000000007;
            long ans=1;
            foreach (var p in primes)
            {
               var cnt=new List<int>();
                for(int i=0;i<n;i++)
                        cnt.Add(b[i][p]);
               cnt.Sort();
               var min=cnt.Take(k).Sum();
               cnt.Reverse();
               var max=cnt.Take(k).Sum();
               ans=(ans*MathEx.ModPow(p,max-min,MOD))%MOD;
            }
            IO.Printer.Out.WriteLine(ans);
            
        }
        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; }
    }
}
static public partial class MathEx
{
    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;
    }
}
#region HashMap
    public class HashMap<K, V> : Dictionary<K, V>
    //where V : new()
    {
        public HashMap() : base() { }
        public HashMap(int cap) : base(cap) { }
        new public V this[K i]
        {
            get
            {
                V v;
                return TryGetValue(i, out v) ? v :
                    base[i] = default(V);
                //base[i] = new V();
            }
            set { base[i] = value; }
        }
    }
    #endregion
#region Factors
public static partial class MathEx
{
    static public HashMap<Number,int> GetFactors(Number v)
    {
        var ret = new HashMap<Number,int>();
        for (Number i = 2; i * i <= v; i++)
        {
            if (v % i != 0) continue;
            while (v % i == 0)
            {
                ret[i]++; v /= i;
            }
        }
        if (v > 1) ret[v]++;
        return ret;
    }
}
#endregion

#region main
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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, 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 string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') 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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        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); }
    }
}
#endregion
0