Submission #162556
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <queue> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <fstream> #include <stdio.h> #include <complex> using namespace std; //conversion //------------------------------------------ inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef pair<int, PII> TIII; typedef long long LL; typedef unsigned long long ULL; typedef vector<LL> VLL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) #define MT(a,b,c) MP(a, MP(b, c)) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define MOD 1000000007 LL f(LL x){ LL ret=0; if(x<10){ ret=x; if(x>=4)ret--; if(x>=9)ret--; return ret; } LL t=1,tt=0; LL k=x; while(k>=10){ k/=10; t*=10; tt++; } ret = f(x-k*t); if(k>=4)k--; if(k>=9)k--; ret += k<<(3*tt); return ret; } int main(){ LL a,b; cin>>a>>b; cout<<b-a+1-(f(b)-f(a-1))<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 禁止された数字 |
User | UminchuR |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1949 Byte |
Status | WA |
Exec Time | 25 ms |
Memory | 928 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 23 ms | 800 KB |
subtask0_sample02.txt | AC | 21 ms | 800 KB |
subtask0_sample03.txt | AC | 22 ms | 672 KB |
subtask0_sample04.txt | AC | 25 ms | 676 KB |
subtask1_01.txt | AC | 21 ms | 800 KB |
subtask1_02.txt | WA | 20 ms | 676 KB |
subtask1_03.txt | AC | 19 ms | 928 KB |
subtask1_04.txt | WA | 21 ms | 796 KB |
subtask1_05.txt | WA | 22 ms | 732 KB |
subtask1_06.txt | WA | 22 ms | 924 KB |
subtask1_07.txt | WA | 20 ms | 928 KB |
subtask1_08.txt | WA | 22 ms | 800 KB |
subtask1_09.txt | WA | 23 ms | 676 KB |
subtask1_10.txt | AC | 21 ms | 916 KB |
subtask1_11.txt | WA | 21 ms | 924 KB |
subtask1_12.txt | WA | 22 ms | 676 KB |
subtask1_13.txt | AC | 21 ms | 800 KB |
subtask2_01.txt | WA | 21 ms | 920 KB |
subtask2_02.txt | AC | 23 ms | 676 KB |
subtask2_03.txt | WA | 22 ms | 676 KB |
subtask2_04.txt | WA | 20 ms | 804 KB |
subtask2_05.txt | WA | 22 ms | 800 KB |
subtask2_06.txt | WA | 20 ms | 796 KB |
subtask2_07.txt | WA | 21 ms | 672 KB |
subtask2_08.txt | WA | 21 ms | 800 KB |
subtask2_09.txt | WA | 21 ms | 792 KB |
subtask2_10.txt | WA | 22 ms | 804 KB |
subtask2_11.txt | WA | 22 ms | 804 KB |
subtask2_12.txt | WA | 23 ms | 812 KB |
subtask2_13.txt | WA | 21 ms | 792 KB |
subtask2_14.txt | WA | 20 ms | 804 KB |
subtask2_15.txt | WA | 21 ms | 800 KB |
subtask2_16.txt | WA | 20 ms | 672 KB |
subtask2_17.txt | WA | 21 ms | 704 KB |
subtask2_18.txt | WA | 22 ms | 732 KB |
subtask2_19.txt | WA | 21 ms | 928 KB |
subtask2_20.txt | WA | 20 ms | 800 KB |
subtask2_21.txt | WA | 20 ms | 808 KB |
subtask2_22.txt | WA | 20 ms | 672 KB |