結果
問題 | No.944 煎っぞ! |
ユーザー | hiromi_ayase |
提出日時 | 2019-12-09 01:57:05 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 246 ms / 3,000 ms |
コード長 | 2,830 bytes |
コンパイル時間 | 2,156 ms |
コンパイル使用メモリ | 91,820 KB |
実行使用メモリ | 46,168 KB |
最終ジャッジ日時 | 2024-06-11 01:13:42 |
合計ジャッジ時間 | 10,311 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 208 ms
46,168 KB |
testcase_01 | AC | 210 ms
45,760 KB |
testcase_02 | AC | 202 ms
45,588 KB |
testcase_03 | AC | 202 ms
45,808 KB |
testcase_04 | AC | 216 ms
45,836 KB |
testcase_05 | AC | 208 ms
46,024 KB |
testcase_06 | AC | 189 ms
45,744 KB |
testcase_07 | AC | 210 ms
46,108 KB |
testcase_08 | AC | 245 ms
45,908 KB |
testcase_09 | AC | 246 ms
45,840 KB |
testcase_10 | AC | 101 ms
39,372 KB |
testcase_11 | AC | 165 ms
42,156 KB |
testcase_12 | AC | 150 ms
40,192 KB |
testcase_13 | AC | 74 ms
38,756 KB |
testcase_14 | AC | 136 ms
42,144 KB |
testcase_15 | AC | 103 ms
40,024 KB |
testcase_16 | AC | 73 ms
38,620 KB |
testcase_17 | AC | 77 ms
38,668 KB |
testcase_18 | AC | 135 ms
42,224 KB |
testcase_19 | AC | 137 ms
42,288 KB |
testcase_20 | AC | 205 ms
45,996 KB |
testcase_21 | AC | 215 ms
46,156 KB |
testcase_22 | AC | 211 ms
46,108 KB |
testcase_23 | AC | 198 ms
45,908 KB |
testcase_24 | AC | 209 ms
46,084 KB |
testcase_25 | AC | 210 ms
45,824 KB |
testcase_26 | AC | 208 ms
46,064 KB |
testcase_27 | AC | 198 ms
46,068 KB |
testcase_28 | AC | 74 ms
38,712 KB |
testcase_29 | AC | 74 ms
38,708 KB |
testcase_30 | AC | 222 ms
46,072 KB |
testcase_31 | AC | 207 ms
45,796 KB |
testcase_32 | AC | 200 ms
46,028 KB |
testcase_33 | AC | 216 ms
46,048 KB |
testcase_34 | AC | 192 ms
46,064 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)); } }