結果

問題 No.944 煎っぞ!
ユーザー OlandOland
提出日時 2019-12-07 16:06:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 116 ms / 3,000 ms
コード長 7,166 bytes
コンパイル時間 2,313 ms
コンパイル使用メモリ 75,104 KB
実行使用メモリ 65,532 KB
最終ジャッジ日時 2023-08-26 20:12:59
合計ジャッジ時間 7,524 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 110 ms
65,152 KB
testcase_01 AC 107 ms
64,828 KB
testcase_02 AC 105 ms
64,688 KB
testcase_03 AC 108 ms
64,916 KB
testcase_04 AC 107 ms
64,968 KB
testcase_05 AC 105 ms
65,044 KB
testcase_06 AC 103 ms
64,900 KB
testcase_07 AC 110 ms
65,044 KB
testcase_08 AC 110 ms
65,204 KB
testcase_09 AC 110 ms
64,920 KB
testcase_10 AC 59 ms
61,108 KB
testcase_11 AC 89 ms
63,548 KB
testcase_12 AC 75 ms
63,128 KB
testcase_13 AC 52 ms
61,184 KB
testcase_14 AC 78 ms
62,484 KB
testcase_15 AC 82 ms
62,844 KB
testcase_16 AC 53 ms
61,012 KB
testcase_17 AC 53 ms
61,076 KB
testcase_18 AC 87 ms
62,836 KB
testcase_19 AC 90 ms
63,116 KB
testcase_20 AC 116 ms
65,532 KB
testcase_21 AC 114 ms
65,216 KB
testcase_22 AC 104 ms
64,084 KB
testcase_23 AC 105 ms
64,428 KB
testcase_24 AC 105 ms
63,928 KB
testcase_25 AC 104 ms
63,960 KB
testcase_26 AC 104 ms
64,044 KB
testcase_27 AC 109 ms
64,268 KB
testcase_28 AC 51 ms
61,104 KB
testcase_29 AC 52 ms
61,156 KB
testcase_30 AC 114 ms
65,240 KB
testcase_31 AC 105 ms
64,116 KB
testcase_32 AC 107 ms
63,912 KB
testcase_33 AC 107 ms
65,000 KB
testcase_34 AC 107 ms
65,092 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    boolean[] exist = new boolean[(int)1e7+1];
    int sum = 0;
    
    void solve() {
        int n = in.nextInt();
        exist[0] = true;
        for(int i = 0; i < n; i++){
            sum += in.nextInt();
            exist[sum] = true;
        }
        
        int max = 1;
        for(long i = 1; i * i <= sum; i++){
            if(sum % i != 0) continue;
            int d = (int)i;
            if(isOk(d)){
                out.println(sum / d);
                return;
            }
            if(isOk(sum / d)){
                max = d;
            }
        }
        out.println(max);
    }
    
    boolean isOk(int d){
        int now = sum;
        while(now != 0){
            if(!exist[now]){
                return false;
            }
            now -= d;
        }
        return true;
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "output.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0