結果
問題 | No.1083 余りの余り |
ユーザー | hiromi_ayase |
提出日時 | 2020-06-19 21:48:22 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,752 bytes |
コンパイル時間 | 2,296 ms |
コンパイル使用メモリ | 85,976 KB |
実行使用メモリ | 57,872 KB |
最終ジャッジ日時 | 2024-07-03 14:17:25 |
合計ジャッジ時間 | 6,407 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
38,312 KB |
testcase_01 | AC | 71 ms
38,296 KB |
testcase_02 | AC | 67 ms
38,296 KB |
testcase_03 | AC | 65 ms
38,492 KB |
testcase_04 | WA | - |
testcase_05 | AC | 101 ms
40,012 KB |
testcase_06 | AC | 67 ms
38,484 KB |
testcase_07 | AC | 66 ms
38,492 KB |
testcase_08 | AC | 71 ms
38,044 KB |
testcase_09 | AC | 69 ms
38,584 KB |
testcase_10 | AC | 66 ms
38,016 KB |
testcase_11 | WA | - |
testcase_12 | AC | 68 ms
38,428 KB |
testcase_13 | AC | 68 ms
38,220 KB |
testcase_14 | AC | 69 ms
38,428 KB |
testcase_15 | AC | 66 ms
38,028 KB |
testcase_16 | AC | 66 ms
38,264 KB |
testcase_17 | AC | 65 ms
38,324 KB |
testcase_18 | WA | - |
testcase_19 | AC | 105 ms
39,796 KB |
testcase_20 | AC | 71 ms
38,028 KB |
testcase_21 | AC | 86 ms
39,212 KB |
testcase_22 | AC | 66 ms
38,384 KB |
testcase_23 | AC | 186 ms
43,184 KB |
testcase_24 | AC | 187 ms
42,972 KB |
testcase_25 | AC | 195 ms
42,780 KB |
testcase_26 | AC | 191 ms
42,872 KB |
testcase_27 | AC | 65 ms
38,512 KB |
testcase_28 | WA | - |
testcase_29 | AC | 66 ms
38,428 KB |
testcase_30 | AC | 66 ms
38,576 KB |
testcase_31 | AC | 76 ms
38,428 KB |
testcase_32 | AC | 69 ms
38,492 KB |
testcase_33 | AC | 189 ms
42,816 KB |
ソースコード
public class Main {private static void solve() {int n = ni();int k = ni();int[] a = na(n);int[] dp = new int[1 << n];dp[0] = k;for (int i = 0; i < (1 << n); i++) {for (int j = 0; j < n; j++) {if (((i >> j) & 1) == 0) {dp[i | (1 << j)] = Math.max(dp[i | (1 << j)], dp[i] % a[j]);}}}System.out.println(dp[(1 << n) - 1]);}public static void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic 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));}}