Submission #3041908

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

#define REP(i,n) for(int i = 0; i < int(n); i++)
#define REREP(i,n) for(int i = int(n - 1); i >= 0; i--)
#define FOR(i, m, n) for(int i = int(m);i < int(n);i++)
#define REFOR(i, m, n) for(int i = int(n - 1);i >= int(m);i--)
#define ALL(obj) (obj).begin(),(obj).end()
#define fi first 
#define se second

#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VD vector<double>
#define VVD vector<vector<double>>
#define VVVD vector<vector<vector<double>>>
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VVVL vector<vector<vector<ll>>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define VVVB vector<vector<vector<bool>>>
#define VS vector<string>
#define VVS vector<vector<string>>
#define VVVS vector<vector<vector<string>>>

#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<ll,ll>
#define VPII vector<pair<int,int>>
#define VVPII vector<vector<pair<int,int>>>
#define VVVPII vector<vector<vector<pair<int,int>>>>
#define VPLL vector<pair<ll,ll>>
#define VVPLL vector<vector<pair<ll,ll>>>
#define VVVPLL vector<vector<vector<pair<ll,ll>>>>

const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;


void YN(bool flag) {
	cout << ((flag) ? "YES" : "NO") << endl;
}

void Yn(bool flag) {
	cout << ((flag) ? "Yes" : "No") << endl;
}

void yn(bool flag) {
	cout << ((flag) ? "yes" : "no") << endl;
}

ll sum(ll K) {
	VL pow10(19,1),pow8(19,1);
	FOR(i, 1, 19) pow10[i] = pow10[i-1] * 10;
	FOR(i, 1, 19) pow8[i] = pow8[i - 1] * 8;
	
	string S = to_string(K);
	int N = S.size();
	
	ll ret = 0;
	bool flg = false;

	REP(i, N) {
		if (S[i] == '9'){ret += 9 * pow10[N - (i + 1)] - 8 * pow8[N - (i + 1)]; flg = true;}
		if (S[i] == '8') ret += 8 * pow10[N - (i + 1)] - 7 * pow8[N - (i + 1)];
		if (S[i] == '7') ret += 7 * pow10[N - (i + 1)] - 6 * pow8[N - (i + 1)];
		if (S[i] == '6') ret += 6 * pow10[N - (i + 1)] - 5 * pow8[N - (i + 1)];
		if (S[i] == '5') ret += 5 * pow10[N - (i + 1)] - 4 * pow8[N - (i + 1)];
		if (S[i] == '4'){ret += 4 * pow10[N - (i + 1)] - 4 * pow8[N - (i + 1)]; flg = true;}
		if (S[i] == '3') ret += 3 * pow10[N - (i + 1)] - 3 * pow8[N - (i + 1)];
		if (S[i] == '2') ret += 2 * pow10[N - (i + 1)] - 2 * pow8[N - (i + 1)];
		if (S[i] == '1') ret += 1 * pow10[N - (i + 1)] - 1 * pow8[N - (i + 1)];
		if (S[i] == '0') continue;

		if (flg) {
			string cnt = "0";
			FOR(j, i + 1, N) cnt += S[j];
			ret += stol(cnt) + 1;
			break;
		}
	}
	return ret;
}

int main() {
	ll A, B; cin >> A >> B;
	cout << sum(B) - sum(A - 1) << endl;
	return 0;
}

Submission Info

Judge Result