Submission #162125
Source Code Expand
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <utility>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
#include <vector>
using namespace std;
#define i64 int64_t
#define rep(i, n) for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v) ((i64)((v).size()))
#define bit(n) (((i64)1)<<((i64)(n)))
#define all(v) (v).begin(), (v).end()
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class ...Ts> std::ostream& operator<<(std::ostream &os, const std::tuple<Ts...> &t){ os << "("; deploy<0, std::tuple<Ts...>, Ts...>(os, t); os << ")"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> &q){ auto qq = q; os << "{"; for(; !qq.empty(); qq.pop()){ os << qq.front() << (qq.size() != 1 ? ", " : ""); } os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> &q){ auto qq = q; os << "{"; for(; !qq.empty(); qq.pop()){ os << qq.top() << (qq.size() != 1 ? ", " : ""); } os << "}"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "" : ", "); os << "}"; return os; }
#define DEBUG0() { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << std::endl; }
#define DEBUG1(var0) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << std::endl; }
#define DEBUG2(var0, var1) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << std::endl; }
#define DEBUG3(var0, var1, var2) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << std::endl; }
#define DEBUG4(var0, var1, var2, var3) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << std::endl; }
#define DEBUG5(var0, var1, var2, var3, var4) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << ", " << (#var4) << "=" << (var4) << std::endl; }
#define DEBUG6(var0, var1, var2, var3, var4, var5) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << ", " << (#var4) << "=" << (var4) << ", " << (#var5) << "=" << (var5) << std::endl; }
#define ASSERT(f) { if(!(f)){ DEBUG0(); while(true); }}
const i64 MAX = 20;
i64 dp[MAX][2][2];
i64 a[MAX];
i64 recur(i64 pos, i64 used, i64 full)
{
if(pos == -1) return used ? 1 : 0;
i64 &res = dp[pos][used][full];
if(res != -1) return res;
res = 0;
rep(t, 10)if(!full || t <= a[pos]) res += recur(pos - 1, used || (t == 4) || (t == 9), full && t == a[pos]);
return res;
}
i64 cal(i64 num)
{
rep(i, MAX){
a[i] = num % 10;
num /= 10;
}
memset(dp, -1, sizeof(dp));
return recur(MAX - 1, 0, 1);
}
int main()
{
i64 a, b;
cin >> a >> b;
cout << cal(b) - cal(a - 1) << endl;
}
Submission Info
Submission Time |
|
Task |
D - 禁止された数字 |
User |
Komaki |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
4741 Byte |
Status |
AC |
Exec Time |
26 ms |
Memory |
924 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
|
|
|
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 |
26 ms |
740 KB |
subtask0_sample02.txt |
AC |
24 ms |
748 KB |
subtask0_sample03.txt |
AC |
23 ms |
916 KB |
subtask0_sample04.txt |
AC |
23 ms |
800 KB |
subtask1_01.txt |
AC |
25 ms |
796 KB |
subtask1_02.txt |
AC |
23 ms |
920 KB |
subtask1_03.txt |
AC |
21 ms |
800 KB |
subtask1_04.txt |
AC |
21 ms |
800 KB |
subtask1_05.txt |
AC |
23 ms |
924 KB |
subtask1_06.txt |
AC |
22 ms |
800 KB |
subtask1_07.txt |
AC |
21 ms |
920 KB |
subtask1_08.txt |
AC |
21 ms |
924 KB |
subtask1_09.txt |
AC |
24 ms |
796 KB |
subtask1_10.txt |
AC |
22 ms |
796 KB |
subtask1_11.txt |
AC |
23 ms |
804 KB |
subtask1_12.txt |
AC |
23 ms |
732 KB |
subtask1_13.txt |
AC |
23 ms |
800 KB |
subtask2_01.txt |
AC |
23 ms |
784 KB |
subtask2_02.txt |
AC |
22 ms |
800 KB |
subtask2_03.txt |
AC |
22 ms |
920 KB |
subtask2_04.txt |
AC |
20 ms |
676 KB |
subtask2_05.txt |
AC |
22 ms |
676 KB |
subtask2_06.txt |
AC |
22 ms |
796 KB |
subtask2_07.txt |
AC |
23 ms |
800 KB |
subtask2_08.txt |
AC |
23 ms |
796 KB |
subtask2_09.txt |
AC |
24 ms |
924 KB |
subtask2_10.txt |
AC |
23 ms |
672 KB |
subtask2_11.txt |
AC |
23 ms |
676 KB |
subtask2_12.txt |
AC |
22 ms |
800 KB |
subtask2_13.txt |
AC |
22 ms |
800 KB |
subtask2_14.txt |
AC |
22 ms |
796 KB |
subtask2_15.txt |
AC |
23 ms |
844 KB |
subtask2_16.txt |
AC |
21 ms |
800 KB |
subtask2_17.txt |
AC |
25 ms |
796 KB |
subtask2_18.txt |
AC |
24 ms |
792 KB |
subtask2_19.txt |
AC |
23 ms |
920 KB |
subtask2_20.txt |
AC |
24 ms |
672 KB |
subtask2_21.txt |
AC |
23 ms |
800 KB |
subtask2_22.txt |
AC |
22 ms |
800 KB |