結果
問題 | No.944 煎っぞ! |
ユーザー | hiromi_ayase |
提出日時 | 2019-12-09 01:57:05 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 223 ms / 3,000 ms |
コード長 | 2,830 bytes |
コンパイル時間 | 2,733 ms |
コンパイル使用メモリ | 92,092 KB |
実行使用メモリ | 59,860 KB |
最終ジャッジ日時 | 2023-08-31 02:09:30 |
合計ジャッジ時間 | 12,395 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 189 ms
58,016 KB |
testcase_01 | AC | 205 ms
57,892 KB |
testcase_02 | AC | 198 ms
57,928 KB |
testcase_03 | AC | 199 ms
57,872 KB |
testcase_04 | AC | 194 ms
58,104 KB |
testcase_05 | AC | 189 ms
58,000 KB |
testcase_06 | AC | 200 ms
58,008 KB |
testcase_07 | AC | 192 ms
59,860 KB |
testcase_08 | AC | 200 ms
58,180 KB |
testcase_09 | AC | 199 ms
57,864 KB |
testcase_10 | AC | 79 ms
51,812 KB |
testcase_11 | AC | 132 ms
54,476 KB |
testcase_12 | AC | 115 ms
54,876 KB |
testcase_13 | AC | 67 ms
51,616 KB |
testcase_14 | AC | 132 ms
54,516 KB |
testcase_15 | AC | 108 ms
54,680 KB |
testcase_16 | AC | 69 ms
51,640 KB |
testcase_17 | AC | 69 ms
49,724 KB |
testcase_18 | AC | 138 ms
54,460 KB |
testcase_19 | AC | 137 ms
54,408 KB |
testcase_20 | AC | 223 ms
58,272 KB |
testcase_21 | AC | 219 ms
58,100 KB |
testcase_22 | AC | 202 ms
57,960 KB |
testcase_23 | AC | 198 ms
57,788 KB |
testcase_24 | AC | 201 ms
58,124 KB |
testcase_25 | AC | 199 ms
58,296 KB |
testcase_26 | AC | 196 ms
57,812 KB |
testcase_27 | AC | 205 ms
57,636 KB |
testcase_28 | AC | 67 ms
51,616 KB |
testcase_29 | AC | 65 ms
51,644 KB |
testcase_30 | AC | 209 ms
57,648 KB |
testcase_31 | AC | 203 ms
57,852 KB |
testcase_32 | AC | 195 ms
57,764 KB |
testcase_33 | AC | 204 ms
57,968 KB |
testcase_34 | AC | 201 ms
57,708 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int[] a = na(n); int sum = Arrays.stream(a).sum(); outer: for (int i = n; i >= 1; i--) { if (sum % i != 0) continue; int x = sum / i; int y = 0; for (int v : a) { y += v; if (y == x) { y = 0; } else if (y > x) { continue outer; } } System.out.println(i); return; } } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }