結果
問題 | No.368 LCM of K-products |
ユーザー | ぴろず |
提出日時 | 2016-04-29 23:01:03 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 177 ms / 2,000 ms |
コード長 | 6,031 bytes |
コンパイル時間 | 2,381 ms |
コンパイル使用メモリ | 82,908 KB |
実行使用メモリ | 56,168 KB |
最終ジャッジ日時 | 2023-10-23 21:10:08 |
合計ジャッジ時間 | 7,270 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 152 ms
55,964 KB |
testcase_01 | AC | 157 ms
55,872 KB |
testcase_02 | AC | 148 ms
55,712 KB |
testcase_03 | AC | 159 ms
55,888 KB |
testcase_04 | AC | 177 ms
55,832 KB |
testcase_05 | AC | 153 ms
55,708 KB |
testcase_06 | AC | 57 ms
53,528 KB |
testcase_07 | AC | 57 ms
53,520 KB |
testcase_08 | AC | 57 ms
53,528 KB |
testcase_09 | AC | 58 ms
53,520 KB |
testcase_10 | AC | 58 ms
53,536 KB |
testcase_11 | AC | 57 ms
53,532 KB |
testcase_12 | AC | 70 ms
53,532 KB |
testcase_13 | AC | 139 ms
56,164 KB |
testcase_14 | AC | 154 ms
55,896 KB |
testcase_15 | AC | 160 ms
55,924 KB |
testcase_16 | AC | 155 ms
56,128 KB |
testcase_17 | AC | 146 ms
56,164 KB |
testcase_18 | AC | 163 ms
55,908 KB |
testcase_19 | AC | 120 ms
55,892 KB |
testcase_20 | AC | 144 ms
56,168 KB |
testcase_21 | AC | 118 ms
55,984 KB |
testcase_22 | AC | 159 ms
55,868 KB |
testcase_23 | AC | 58 ms
52,480 KB |
testcase_24 | AC | 56 ms
53,532 KB |
testcase_25 | AC | 62 ms
53,532 KB |
testcase_26 | AC | 61 ms
52,512 KB |
testcase_27 | AC | 64 ms
53,536 KB |
testcase_28 | AC | 58 ms
53,528 KB |
testcase_29 | AC | 63 ms
51,480 KB |
testcase_30 | AC | 72 ms
53,648 KB |
testcase_31 | AC | 71 ms
53,536 KB |
testcase_32 | AC | 74 ms
54,160 KB |
testcase_33 | AC | 127 ms
56,160 KB |
testcase_34 | AC | 152 ms
55,880 KB |
ソースコード
package no368; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.HashMap; import java.util.InputMismatchException; import java.util.Map; import java.util.NoSuchElementException; import no368.Prime.Factor; public class Main { public static final long MOD = 1000000007; public static void main(String[] args) { ArrayList<Integer> primeList = Prime.primeList((int) Math.sqrt(1e9) + 5); IO io = new IO(); int n = io.nextInt(); int k = io.nextInt(); HashMap<Integer,ArrayList<Integer>> hm = new HashMap<>(); for(int i=0;i<n;i++) { int a = io.nextInt(); for(Factor f: Prime.primeFactorF(primeList, a)) { ArrayList<Integer> al = hm.get(f.base); if (al == null) { al = new ArrayList<>(); } al.add(f.exp); hm.put(f.base, al); } } long ans = 1; for(Map.Entry<Integer,ArrayList<Integer>> e: hm.entrySet()) { ArrayList<Integer> al = e.getValue(); al.sort(Collections.reverseOrder()); int max = Math.min(k, al.size()); int sum = 0; for(int i=0;i<max;i++) { sum += al.get(i); } ans = ans * pow(e.getKey(), sum, MOD) % MOD; } System.out.println(ans); } public static long pow(long a,long n,long mod) { long res = 1; while(n > 0) { if ((n & 1) > 0) { res = (res * a) % mod; } a = (a * a) % mod; n/=2; } return res; } } class Prime { public static boolean[] isPrimeArray(int max) { boolean[] isPrime = new boolean[max+1]; Arrays.fill(isPrime, true); isPrime[0] = isPrime[1] = false; for(int i=2;i*i<=max;i++) { if (isPrime[i]) { int j = i * 2; while(j<=max) { isPrime[j] = false; j += i; } } } return isPrime; } public static ArrayList<Integer> primeList(int max) { boolean[] isPrime = isPrimeArray(max); ArrayList<Integer> primeList = new ArrayList<Integer>(); for(int i=2;i<=max;i++) { if (isPrime[i]) { primeList.add(i); } } return primeList; } public static ArrayList<Factor> primeFactorF(ArrayList<Integer> primeList,long num) { ArrayList<Factor> ret = new ArrayList<Factor>(); for(int p:primeList) { int exp = 0; while(num % p == 0) { num /= p; exp++; } if (exp > 0) { ret.add(new Factor(p,exp)); } } if (num > 1) { ret.add(new Factor((int) num,1)); } return ret; } public static class Factor { int base,exp; public Factor(int base,int exp) { this.base = base; this.exp = exp; } } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;} public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try {in.close();} catch (IOException e) {}} }