結果
問題 | No.1185 完全な3の倍数 |
ユーザー | uwi |
提出日時 | 2020-08-22 13:26:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 101 ms / 2,000 ms |
コード長 | 3,576 bytes |
コンパイル時間 | 3,738 ms |
コンパイル使用メモリ | 80,264 KB |
実行使用メモリ | 52,368 KB |
最終ジャッジ日時 | 2023-08-15 23:57:54 |
合計ジャッジ時間 | 9,546 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
51,788 KB |
testcase_01 | AC | 81 ms
51,480 KB |
testcase_02 | AC | 82 ms
51,712 KB |
testcase_03 | AC | 97 ms
51,252 KB |
testcase_04 | AC | 95 ms
51,364 KB |
testcase_05 | AC | 96 ms
51,484 KB |
testcase_06 | AC | 91 ms
51,432 KB |
testcase_07 | AC | 97 ms
51,376 KB |
testcase_08 | AC | 91 ms
51,452 KB |
testcase_09 | AC | 81 ms
51,220 KB |
testcase_10 | AC | 80 ms
51,764 KB |
testcase_11 | AC | 82 ms
52,236 KB |
testcase_12 | AC | 83 ms
51,544 KB |
testcase_13 | AC | 83 ms
51,460 KB |
testcase_14 | AC | 90 ms
51,376 KB |
testcase_15 | AC | 81 ms
52,272 KB |
testcase_16 | AC | 81 ms
51,560 KB |
testcase_17 | AC | 82 ms
51,344 KB |
testcase_18 | AC | 81 ms
49,800 KB |
testcase_19 | AC | 101 ms
52,012 KB |
testcase_20 | AC | 91 ms
51,472 KB |
testcase_21 | AC | 98 ms
51,496 KB |
testcase_22 | AC | 96 ms
49,688 KB |
testcase_23 | AC | 94 ms
51,264 KB |
testcase_24 | AC | 93 ms
51,492 KB |
testcase_25 | AC | 77 ms
51,428 KB |
testcase_26 | AC | 95 ms
51,252 KB |
testcase_27 | AC | 93 ms
52,080 KB |
testcase_28 | AC | 96 ms
52,180 KB |
testcase_29 | AC | 96 ms
51,460 KB |
testcase_30 | AC | 95 ms
51,504 KB |
testcase_31 | AC | 83 ms
51,928 KB |
testcase_32 | AC | 95 ms
51,736 KB |
testcase_33 | AC | 81 ms
51,560 KB |
testcase_34 | AC | 94 ms
51,268 KB |
testcase_35 | AC | 90 ms
51,552 KB |
testcase_36 | AC | 97 ms
51,532 KB |
testcase_37 | AC | 93 ms
52,168 KB |
testcase_38 | AC | 99 ms
51,772 KB |
testcase_39 | AC | 85 ms
52,368 KB |
testcase_40 | AC | 85 ms
51,808 KB |
testcase_41 | AC | 90 ms
51,808 KB |
ソースコード
package gioku2020day1; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int ans = 0; for(int i = 12;i <= 99;i+=3){ if(i <= n){ ans++; } } int[] B = {0, 3, 6, 9}; int[] a = new int[10]; do{ long num = 0; for(int i = 0;i < 10;i++){ num = num * 10 + B[a[i]]; } if(num <= 99 || num > n)continue; ans++; }while(inc(a, 4)); out.println(ans); } public static boolean inc(int[] a, int base) { int n = a.length; int i; for (i = n - 1; i >= 0 && a[i] == base - 1; i--) ; if (i == -1) return false; a[i]++; Arrays.fill(a, i + 1, n, 0); 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 D2().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)); } }