結果
問題 | No.1514 Squared Matching |
ユーザー |
![]() |
提出日時 | 2023-06-22 17:49:55 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 3,185 ms / 4,000 ms |
コード長 | 2,549 bytes |
コンパイル時間 | 2,583 ms |
コンパイル使用メモリ | 91,820 KB |
実行使用メモリ | 252,196 KB |
最終ジャッジ日時 | 2024-06-30 00:40:25 |
合計ジャッジ時間 | 53,411 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); TreeMap<Integer, Integer> square = new TreeMap<>(); int idx = 1; int target = 1; while (target * target <= n) { square.put(target * target, idx++); target++; } int root = target - 1; int[] counts = new int[n + 1]; for (int i = 1; i <= n; i++) { counts[i] = i; } boolean[] isNotPrimes = new boolean[root + 1]; for (int i = 2; i <= root; i++) { if (!isNotPrimes[i]) { for (int j = 2; j * i <= root; j++) { isNotPrimes[j * i] = true; } long base = i * i; while (base <= n) { int x = (int)base; for (int j = 1; j * base <= n; j++) { counts[j * x] /= i * i; } base *= i * i; } } } long ans = 0; for (int i = 1; i <= n; i++) { ans += square.floorEntry(n / counts[i]).getValue(); } System.out.println(ans); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }