結果
問題 | No.368 LCM of K-products |
ユーザー | uwi |
提出日時 | 2016-04-29 22:45:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 323 ms / 2,000 ms |
コード長 | 5,173 bytes |
コンパイル時間 | 3,785 ms |
コンパイル使用メモリ | 85,528 KB |
実行使用メモリ | 59,488 KB |
最終ジャッジ日時 | 2023-10-23 21:09:06 |
合計ジャッジ時間 | 10,728 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 268 ms
59,052 KB |
testcase_01 | AC | 302 ms
58,632 KB |
testcase_02 | AC | 171 ms
56,172 KB |
testcase_03 | AC | 277 ms
59,164 KB |
testcase_04 | AC | 273 ms
59,488 KB |
testcase_05 | AC | 259 ms
58,536 KB |
testcase_06 | AC | 57 ms
53,580 KB |
testcase_07 | AC | 65 ms
53,564 KB |
testcase_08 | AC | 58 ms
53,568 KB |
testcase_09 | AC | 58 ms
52,596 KB |
testcase_10 | AC | 59 ms
53,576 KB |
testcase_11 | AC | 59 ms
53,580 KB |
testcase_12 | AC | 75 ms
54,664 KB |
testcase_13 | AC | 223 ms
58,808 KB |
testcase_14 | AC | 288 ms
59,344 KB |
testcase_15 | AC | 285 ms
58,680 KB |
testcase_16 | AC | 257 ms
58,840 KB |
testcase_17 | AC | 246 ms
58,720 KB |
testcase_18 | AC | 323 ms
58,968 KB |
testcase_19 | AC | 148 ms
58,336 KB |
testcase_20 | AC | 238 ms
58,968 KB |
testcase_21 | AC | 128 ms
58,508 KB |
testcase_22 | AC | 263 ms
58,936 KB |
testcase_23 | AC | 59 ms
53,564 KB |
testcase_24 | AC | 57 ms
53,568 KB |
testcase_25 | AC | 63 ms
54,388 KB |
testcase_26 | AC | 57 ms
51,524 KB |
testcase_27 | AC | 78 ms
54,652 KB |
testcase_28 | AC | 61 ms
53,568 KB |
testcase_29 | AC | 79 ms
55,112 KB |
testcase_30 | AC | 74 ms
54,400 KB |
testcase_31 | AC | 64 ms
54,400 KB |
testcase_32 | AC | 74 ms
54,396 KB |
testcase_33 | AC | 165 ms
58,660 KB |
testcase_34 | AC | 249 ms
58,764 KB |
ソースコード
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q1048 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), K = ni(); int[] a = na(n); int[] primes = sieveEratosthenes(100000); long ret = 1; int mod = 1000000007; for(int p : primes){ int[] es = new int[n]; for(int i = 0;i < n;i++){ while(a[i] % p == 0){ a[i] /= p; es[i]++; } } Arrays.sort(es); int d = 0; for(int i = 0;i < K;i++){ d += es[n-1-i]; } ret = ret * pow(p, d, mod) % mod; } for(int z = 0;z < n;z++){ if(a[z] > 1){ int p = a[z]; int[] es = new int[n]; for(int i = 0;i < n;i++){ while(a[i] % p == 0){ a[i] /= p; es[i]++; } } Arrays.sort(es); int d = 0; for(int i = 0;i < K;i++){ d += es[n-1-i]; } ret = ret * pow(p, d, mod) % mod; } } out.println(ret); } public static long pow(long a, long n, long mod) { // a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } public static int[] sieveEratosthenes(int n) { if (n <= 32) { int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int i = 0; i < primes.length; i++) { if (n < primes[i]) { return Arrays.copyOf(primes, i); } } return primes; } int u = n + 32; double lu = Math.log(u); int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)]; ret[0] = 2; int pos = 1; int[] isnp = new int[(n + 1) / 32 / 2 + 1]; int sup = (n + 1) / 32 / 2 + 1; int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int tp : tprimes) { ret[pos++] = tp; int[] ptn = new int[tp]; for (int i = (tp - 3) / 2; i < tp << 5; i += tp) ptn[i >> 5] |= 1 << (i & 31); for (int j = 0; j < sup; j += tp) { for (int i = 0; i < tp && i + j < sup; i++) { isnp[j + i] |= ptn[i]; } } } // 3,5,7 // 2x+3=n int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 }; int h = n / 2; for (int i = 0; i < sup; i++) { for (int j = ~isnp[i]; j != 0; j &= j - 1) { int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27]; int p = 2 * pp + 3; if (p > n) break; ret[pos++] = p; if ((long) p * p > n) continue; for (int q = (p * p - 3) / 2; q <= h; q += p) isnp[q >> 5] |= 1 << q; } } return Arrays.copyOf(ret, pos); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q1048().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }