結果
問題 | No.300 平方数 |
ユーザー | Tsukasa_Type |
提出日時 | 2018-03-07 13:19:31 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,217 bytes |
コンパイル時間 | 2,212 ms |
コンパイル使用メモリ | 78,488 KB |
実行使用メモリ | 55,116 KB |
最終ジャッジ日時 | 2024-10-01 21:02:12 |
合計ジャッジ時間 | 6,773 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,064 KB |
testcase_01 | AC | 51 ms
49,656 KB |
testcase_02 | AC | 79 ms
52,980 KB |
testcase_03 | AC | 53 ms
49,948 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 52 ms
49,804 KB |
testcase_08 | AC | 53 ms
49,660 KB |
testcase_09 | AC | 54 ms
50,124 KB |
testcase_10 | AC | 50 ms
50,072 KB |
testcase_11 | AC | 50 ms
50,128 KB |
testcase_12 | AC | 52 ms
49,976 KB |
testcase_13 | WA | - |
testcase_14 | AC | 60 ms
49,796 KB |
testcase_15 | AC | 80 ms
52,960 KB |
testcase_16 | WA | - |
testcase_17 | AC | 84 ms
55,080 KB |
testcase_18 | AC | 57 ms
49,788 KB |
testcase_19 | AC | 75 ms
51,104 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
ソースコード
import java.util.*; import static java.lang.System.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); public static void main(String[] args) { Long x = sc.nextLong(); double d = Math.sqrt(x); int[] ar = new int[(int)d+1]; for (int i=2; i<=d; i++) { while (x%i==0) { x /= i; ar[i]++; } } int ans = 1; for (int i=0; i<ar.length; i++) { if (ar[i]%2==1) {ans *= i;} } out.println(ans); } } class FastScanner implements Closeable { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) {this.in = in;} 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;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next());} public void close() { try {in.close();} catch (IOException e) {} } }