Submission #163387
Source Code Expand
#include <iostream> #include <queue> #include <set> #include <map> #include <string> #include <sstream> using namespace std; typedef long long int ll; ll A, B; map<ll, ll> dp; ll f(ll n) { stringstream ss; if (dp.find(n) != dp.end()) return dp[n]; if (n <= 3) { return 0; } else if (n < 9) { return 1; } else if (n == 9) { return 2; } ll ret = 0; for (int i = 0; i <= 9; i++) { if (i <= n%10) { if (i == 4 || i == 9) { ret += (n / 10) + 1; } else { ret += f(n/10); } } else { if (i == 4 || i == 9) { ret += (n / 10); } else { ret += f((n/10)-1); } } } dp[n] = ret; return ret; } int main(int argc, const char * argv[]) { cin >> A >> B; ll x = f(B) - f(A-1); cout << x << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 禁止された数字 |
User | nida_001 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 813 Byte |
Status | AC |
Exec Time | 24 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 | 22 ms | 788 KB |
subtask0_sample02.txt | AC | 21 ms | 920 KB |
subtask0_sample03.txt | AC | 21 ms | 692 KB |
subtask0_sample04.txt | AC | 22 ms | 792 KB |
subtask1_01.txt | AC | 21 ms | 888 KB |
subtask1_02.txt | AC | 22 ms | 796 KB |
subtask1_03.txt | AC | 21 ms | 892 KB |
subtask1_04.txt | AC | 21 ms | 800 KB |
subtask1_05.txt | AC | 22 ms | 748 KB |
subtask1_06.txt | AC | 21 ms | 792 KB |
subtask1_07.txt | AC | 21 ms | 912 KB |
subtask1_08.txt | AC | 22 ms | 916 KB |
subtask1_09.txt | AC | 23 ms | 792 KB |
subtask1_10.txt | AC | 21 ms | 916 KB |
subtask1_11.txt | AC | 21 ms | 792 KB |
subtask1_12.txt | AC | 24 ms | 920 KB |
subtask1_13.txt | AC | 23 ms | 916 KB |
subtask2_01.txt | AC | 24 ms | 916 KB |
subtask2_02.txt | AC | 24 ms | 788 KB |
subtask2_03.txt | AC | 22 ms | 800 KB |
subtask2_04.txt | AC | 24 ms | 840 KB |
subtask2_05.txt | AC | 23 ms | 924 KB |
subtask2_06.txt | AC | 20 ms | 916 KB |
subtask2_07.txt | AC | 20 ms | 912 KB |
subtask2_08.txt | AC | 23 ms | 924 KB |
subtask2_09.txt | AC | 21 ms | 808 KB |
subtask2_10.txt | AC | 22 ms | 916 KB |
subtask2_11.txt | AC | 20 ms | 920 KB |
subtask2_12.txt | AC | 22 ms | 916 KB |
subtask2_13.txt | AC | 20 ms | 916 KB |
subtask2_14.txt | AC | 20 ms | 916 KB |
subtask2_15.txt | AC | 22 ms | 924 KB |
subtask2_16.txt | AC | 22 ms | 808 KB |
subtask2_17.txt | AC | 21 ms | 920 KB |
subtask2_18.txt | AC | 21 ms | 916 KB |
subtask2_19.txt | AC | 19 ms | 916 KB |
subtask2_20.txt | AC | 21 ms | 916 KB |
subtask2_21.txt | AC | 21 ms | 920 KB |
subtask2_22.txt | AC | 22 ms | 916 KB |