結果
| 問題 | No.368 LCM of K-products |
| ユーザー |
 ぴろず
|
| 提出日時 | 2016-04-29 23:01:03 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 176 ms / 2,000 ms |
| コード長 | 6,031 bytes |
| コンパイル時間 | 2,404 ms |
| コンパイル使用メモリ | 82,468 KB |
| 実行使用メモリ | 52,492 KB |
| 最終ジャッジ日時 | 2024-09-22 14:42:43 |
| 合計ジャッジ時間 | 7,306 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 35 |
ソースコード
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) {}}}