結果

問題 No.2479 Sum of Squares
ユーザー tentententen
提出日時 2023-09-25 13:34:32
言語 Java
(openjdk 23)
結果
AC  
実行時間 263 ms / 2,000 ms
コード長 2,937 bytes
コンパイル時間 2,665 ms
コンパイル使用メモリ 85,152 KB
実行使用メモリ 42,980 KB
最終ジャッジ日時 2024-07-18 10:40:33
合計ジャッジ時間 10,225 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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();
long k = sc.nextLong();
ArrayList<ArrayList<Long>> ans = new ArrayList<>();
for (int i = 0; i <= 10000; i++) {
ans.add(new ArrayList<>());
}
for (int i = 1; i <= 100; i++) {
ans.get(i * i).add((long)i * i);
}
for (int i = 1; i <= 10000; i++) {
if (ans.get(i).size() > 0) {
continue;
}
int max = Integer.MAX_VALUE;
int idx = 0;
for (int j = 1; j <= i - j; j++) {
if (ans.get(j).size() + ans.get(i - j).size() < max) {
max = ans.get(j).size() + ans.get(i - j).size();
idx = j;
}
}
ans.get(i).addAll(ans.get(idx));
ans.get(i).addAll(ans.get(i - idx));
}
ArrayList<Long> result = new ArrayList<>();
while (k > 10000) {
long x = getSqrt(k);
result.add(x * x);
k -= x * x;
}
result.addAll(ans.get((int)k));
System.out.println(result.size());
System.out.println(result.stream().map(x -> x.toString()).collect(Collectors.joining(" ")));
}
static long getSqrt(long x) {
long left = 0;
long right = Integer.MAX_VALUE / 2;
while (right - left > 1) {
long m = (left + right) / 2;
if (m * m > x) {
right = m;
} else {
left = m;
}
}
return left;
}
}
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