結果

問題 No.2260 Adic Sum
ユーザー tenten
提出日時 2023-04-10 10:34:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,187 ms / 2,000 ms
コード長 2,353 bytes
コンパイル時間 2,488 ms
コンパイル使用メモリ 95,920 KB
実行使用メモリ 62,340 KB
最終ジャッジ日時 2024-10-06 07:30:56
合計ジャッジ時間 17,121 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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();
int p = sc.nextInt();
int[] values = new int[n];
for (int i = 0; i < n; i++) {
values[i] = sc.nextInt();
}
Arrays.sort(values);
int current = 1;
ArrayList<Integer> ps = new ArrayList<>();
while (current * (long)p <= 1000000000) {
current *= p;
ps.add(current);
}
long ans = 0;
for (int x : ps) {
int[] mods = new int[n];
HashMap<Integer, Integer> counts = new HashMap<>();
for (int i = 0; i < n; i++) {
mods[i] = values[i] % x;
counts.put(mods[i], counts.getOrDefault(mods[i], 0) + 1);
}
for (int i = 0; i < n; i++) {
counts.put(mods[i], counts.get(mods[i]) - 1);
ans += counts.getOrDefault(mods[i], 0);
}
}
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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0