Submission #725139


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {

	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		long A = sc.nextLong();
		long B = sc.nextLong();
		System.out.println(calc(B) - calc(A - 1));
	}
	
	private static long calc(long X) {
		String s = Long.toString(X);
		
		long[][][] dp = new long[s.length() + 1][2][2];
		dp[0][0][0] = 1;
		for (int i = 0; i < s.length(); i ++) {
			for (int j = 0; j < 2; j ++) {
				int lim = j == 1 ? 9 : s.charAt(i) - '0';
				for (int k = 0; k < 2; k ++) {
					for (int d = 0; d <= lim; d ++) {
						dp[i + 1][j > 0 || d < lim ? 1 : 0][k > 0 || d == 4 || d == 9 ? 1 : 0] += dp[i][j][k];
					}
				}
			}
		}
		
		return dp[s.length()][0][1] + dp[s.length()][1][1];
	}
}



class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}

Submission Info

Submission Time
Task D - 禁止された数字
User hiromi_ayase
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 3439 Byte
Status AC
Exec Time 381 ms
Memory 20204 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 16
AC × 39
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 308 ms 20204 KB
subtask0_sample02.txt AC 294 ms 20180 KB
subtask0_sample03.txt AC 293 ms 20016 KB
subtask0_sample04.txt AC 296 ms 20100 KB
subtask1_01.txt AC 298 ms 20072 KB
subtask1_02.txt AC 295 ms 20064 KB
subtask1_03.txt AC 294 ms 20192 KB
subtask1_04.txt AC 311 ms 20144 KB
subtask1_05.txt AC 300 ms 20144 KB
subtask1_06.txt AC 296 ms 20128 KB
subtask1_07.txt AC 297 ms 20144 KB
subtask1_08.txt AC 293 ms 20140 KB
subtask1_09.txt AC 296 ms 20080 KB
subtask1_10.txt AC 297 ms 20172 KB
subtask1_11.txt AC 290 ms 20068 KB
subtask1_12.txt AC 286 ms 20072 KB
subtask1_13.txt AC 289 ms 20104 KB
subtask2_01.txt AC 303 ms 20096 KB
subtask2_02.txt AC 289 ms 20164 KB
subtask2_03.txt AC 287 ms 20104 KB
subtask2_04.txt AC 287 ms 20120 KB
subtask2_05.txt AC 288 ms 20072 KB
subtask2_06.txt AC 290 ms 20136 KB
subtask2_07.txt AC 289 ms 20144 KB
subtask2_08.txt AC 287 ms 20168 KB
subtask2_09.txt AC 288 ms 20192 KB
subtask2_10.txt AC 292 ms 20148 KB
subtask2_11.txt AC 288 ms 20148 KB
subtask2_12.txt AC 290 ms 20140 KB
subtask2_13.txt AC 295 ms 20128 KB
subtask2_14.txt AC 303 ms 20144 KB
subtask2_15.txt AC 288 ms 20120 KB
subtask2_16.txt AC 305 ms 20120 KB
subtask2_17.txt AC 330 ms 20072 KB
subtask2_18.txt AC 293 ms 20076 KB
subtask2_19.txt AC 295 ms 20144 KB
subtask2_20.txt AC 297 ms 20056 KB
subtask2_21.txt AC 317 ms 20140 KB
subtask2_22.txt AC 381 ms 20052 KB