結果
問題 | No.300 平方数 |
ユーザー | uwi |
提出日時 | 2015-11-28 18:16:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 78 ms / 1,000 ms |
コード長 | 4,609 bytes |
コンパイル時間 | 3,855 ms |
コンパイル使用メモリ | 77,488 KB |
実行使用メモリ | 51,828 KB |
最終ジャッジ日時 | 2023-10-12 05:29:50 |
合計ジャッジ時間 | 8,594 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
51,264 KB |
testcase_01 | AC | 65 ms
51,104 KB |
testcase_02 | AC | 70 ms
51,404 KB |
testcase_03 | AC | 67 ms
51,396 KB |
testcase_04 | AC | 61 ms
49,972 KB |
testcase_05 | AC | 67 ms
51,152 KB |
testcase_06 | AC | 60 ms
50,316 KB |
testcase_07 | AC | 57 ms
50,284 KB |
testcase_08 | AC | 57 ms
49,960 KB |
testcase_09 | AC | 57 ms
50,072 KB |
testcase_10 | AC | 66 ms
51,500 KB |
testcase_11 | AC | 78 ms
51,352 KB |
testcase_12 | AC | 62 ms
50,020 KB |
testcase_13 | AC | 65 ms
50,280 KB |
testcase_14 | AC | 75 ms
51,560 KB |
testcase_15 | AC | 61 ms
49,964 KB |
testcase_16 | AC | 60 ms
49,892 KB |
testcase_17 | AC | 58 ms
50,028 KB |
testcase_18 | AC | 64 ms
51,828 KB |
testcase_19 | AC | 55 ms
50,200 KB |
testcase_20 | AC | 65 ms
51,776 KB |
testcase_21 | AC | 57 ms
50,276 KB |
testcase_22 | AC | 56 ms
50,320 KB |
testcase_23 | AC | 56 ms
49,932 KB |
testcase_24 | AC | 66 ms
51,440 KB |
testcase_25 | AC | 67 ms
51,820 KB |
testcase_26 | AC | 63 ms
50,996 KB |
testcase_27 | AC | 61 ms
50,324 KB |
testcase_28 | AC | 64 ms
50,012 KB |
testcase_29 | AC | 62 ms
50,392 KB |
testcase_30 | AC | 62 ms
49,996 KB |
testcase_31 | AC | 61 ms
49,780 KB |
testcase_32 | AC | 64 ms
51,696 KB |
testcase_33 | AC | 66 ms
51,104 KB |
testcase_34 | AC | 64 ms
50,252 KB |
testcase_35 | AC | 60 ms
49,864 KB |
testcase_36 | AC | 59 ms
49,916 KB |
testcase_37 | AC | 64 ms
51,456 KB |
testcase_38 | AC | 65 ms
51,476 KB |
testcase_39 | AC | 66 ms
51,088 KB |
testcase_40 | AC | 56 ms
50,160 KB |
testcase_41 | AC | 56 ms
50,056 KB |
testcase_42 | AC | 63 ms
51,472 KB |
testcase_43 | AC | 64 ms
51,304 KB |
testcase_44 | AC | 58 ms
50,028 KB |
testcase_45 | AC | 63 ms
51,408 KB |
ソースコード
package q8xx; 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 Q817_2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long x = nl(); int[] primes = sieveEratosthenes(1000000); for(int p : primes){ long ii = (long)p*p; if(x < ii)break; while(x % ii == 0){ x /= ii; } } out.println(x); } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new Q817_2().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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }