結果

問題 No.1185 完全な3の倍数
ユーザー uwiuwi
提出日時 2020-08-22 13:26:58
言語 Java21
(openjdk 21)
結果
AC  
実行時間 139 ms / 2,000 ms
コード長 3,576 bytes
コンパイル時間 3,669 ms
コンパイル使用メモリ 84,968 KB
実行使用メモリ 39,016 KB
最終ジャッジ日時 2024-11-24 09:19:21
合計ジャッジ時間 9,928 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 135 ms
38,656 KB
testcase_01 AC 116 ms
38,512 KB
testcase_02 AC 110 ms
38,748 KB
testcase_03 AC 122 ms
38,892 KB
testcase_04 AC 138 ms
38,704 KB
testcase_05 AC 123 ms
38,512 KB
testcase_06 AC 120 ms
38,764 KB
testcase_07 AC 131 ms
38,456 KB
testcase_08 AC 132 ms
39,004 KB
testcase_09 AC 114 ms
38,912 KB
testcase_10 AC 100 ms
38,636 KB
testcase_11 AC 103 ms
38,744 KB
testcase_12 AC 115 ms
38,356 KB
testcase_13 AC 118 ms
38,596 KB
testcase_14 AC 111 ms
38,948 KB
testcase_15 AC 100 ms
38,864 KB
testcase_16 AC 102 ms
38,176 KB
testcase_17 AC 102 ms
38,920 KB
testcase_18 AC 116 ms
38,340 KB
testcase_19 AC 117 ms
38,436 KB
testcase_20 AC 136 ms
38,816 KB
testcase_21 AC 131 ms
38,736 KB
testcase_22 AC 132 ms
38,752 KB
testcase_23 AC 120 ms
38,660 KB
testcase_24 AC 128 ms
38,376 KB
testcase_25 AC 118 ms
38,564 KB
testcase_26 AC 119 ms
38,572 KB
testcase_27 AC 112 ms
38,436 KB
testcase_28 AC 116 ms
39,000 KB
testcase_29 AC 113 ms
38,672 KB
testcase_30 AC 128 ms
38,892 KB
testcase_31 AC 102 ms
38,796 KB
testcase_32 AC 138 ms
38,948 KB
testcase_33 AC 115 ms
38,656 KB
testcase_34 AC 134 ms
38,756 KB
testcase_35 AC 138 ms
39,016 KB
testcase_36 AC 122 ms
38,708 KB
testcase_37 AC 134 ms
38,792 KB
testcase_38 AC 139 ms
39,008 KB
testcase_39 AC 113 ms
38,880 KB
testcase_40 AC 122 ms
38,424 KB
testcase_41 AC 100 ms
38,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
}
0