結果
問題 | No.774 tatyamと素数大富豪 |
ユーザー | uwi |
提出日時 | 2018-12-22 00:02:07 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,777 bytes |
コンパイル時間 | 4,175 ms |
コンパイル使用メモリ | 82,552 KB |
実行使用メモリ | 66,984 KB |
最終ジャッジ日時 | 2024-09-25 09:45:47 |
合計ジャッジ時間 | 15,178 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | TLE | - |
testcase_01 | AC | 57 ms
50,464 KB |
testcase_02 | AC | 54 ms
50,432 KB |
testcase_03 | AC | 209 ms
56,272 KB |
testcase_04 | AC | 104 ms
52,504 KB |
testcase_05 | AC | 58 ms
50,260 KB |
testcase_06 | AC | 53 ms
50,408 KB |
testcase_07 | AC | 53 ms
50,448 KB |
testcase_08 | AC | 55 ms
50,516 KB |
testcase_09 | AC | 335 ms
59,384 KB |
testcase_10 | AC | 92 ms
51,644 KB |
testcase_11 | AC | 233 ms
55,924 KB |
testcase_12 | AC | 1,789 ms
66,984 KB |
testcase_13 | AC | 1,277 ms
65,212 KB |
testcase_14 | AC | 203 ms
55,756 KB |
testcase_15 | AC | 285 ms
57,916 KB |
testcase_16 | AC | 209 ms
56,008 KB |
testcase_17 | AC | 175 ms
53,332 KB |
testcase_18 | AC | 213 ms
55,916 KB |
ソースコード
package adv2018; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigInteger; import java.util.Arrays; import java.util.InputMismatchException; public class Day23 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); BigInteger max = BigInteger.valueOf(-1); Arrays.sort(a); do{ StringBuilder sb = new StringBuilder(); for(int v: a)sb.append(v); BigInteger t = new BigInteger(sb.toString()); if(t.isProbablePrime(20)){ max = max.max(t); } }while(nextPermutation(a)); out.println(max); } public static boolean nextPermutation(int[] a) { int n = a.length; int i; for (i = n - 2; i >= 0 && a[i] >= a[i + 1]; i--) ; if (i == -1) return false; int j; for (j = i + 1; j < n && a[i] < a[j]; j++) ; int d = a[i]; a[i] = a[j - 1]; a[j - 1] = d; for (int p = i + 1, q = n - 1; p < q; p++, q--) { d = a[p]; a[p] = a[q]; a[q] = d; } return true; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new Day23().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }