Submission #1964860

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


long long dp[55][3]; // 0: icchi, 1: smaller
long long A, B;

// <= N, kinshi
long long solve(long long N) {
  memset(dp, 0, sizeof(dp));
  stringstream ss;
  ss << N;
  string str = ss.str();
  
  dp[0][0] = 1;
  for (int i = 0; i < str.size(); ++i) {
    //cout << i << ": " << dp[i][0] << ", " << dp[i][1] << endl;
	int next = (int)(str[i] - '0');
	
	// 0 -> 0
	if (next != 4 && next != 9) {
	  dp[i+1][0] += dp[i][0];
	}

	// 0 -> 1, 1 -> 1
	for (int j = 0; j < 10; ++j) {
	  if (j == 4 || j == 9) continue;
	  if (j < next) dp[i+1][1] += dp[i][0];
	  dp[i+1][1] += dp[i][1];
	}
  }

  long long res = N - (dp[str.size()][0] + dp[str.size()][1]);
  return res;
}

int main() {
  while (cin >> A >> B) {
	cout << solve(B) - solve(A-1) << endl;
  }
}

Submission Info

Judge Result