4fd800b3a8 2011-02-23 kinaba: #include <iostream> 4fd800b3a8 2011-02-23 kinaba: #include <sstream> 4fd800b3a8 2011-02-23 kinaba: #include <iomanip> 4fd800b3a8 2011-02-23 kinaba: #include <vector> 4fd800b3a8 2011-02-23 kinaba: #include <string> 4fd800b3a8 2011-02-23 kinaba: #include <map> 4fd800b3a8 2011-02-23 kinaba: #include <set> 4fd800b3a8 2011-02-23 kinaba: #include <algorithm> 4fd800b3a8 2011-02-23 kinaba: #include <numeric> 4fd800b3a8 2011-02-23 kinaba: #include <iterator> 4fd800b3a8 2011-02-23 kinaba: #include <functional> 4fd800b3a8 2011-02-23 kinaba: #include <complex> 4fd800b3a8 2011-02-23 kinaba: #include <queue> 4fd800b3a8 2011-02-23 kinaba: #include <stack> 4fd800b3a8 2011-02-23 kinaba: #include <cmath> 4fd800b3a8 2011-02-23 kinaba: #include <cassert> 4fd800b3a8 2011-02-23 kinaba: #include <cstring> 4fd800b3a8 2011-02-23 kinaba: using namespace std; 4fd800b3a8 2011-02-23 kinaba: typedef long long LL; 4fd800b3a8 2011-02-23 kinaba: typedef complex<double> CMP; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: typedef long long LL; 4fd800b3a8 2011-02-23 kinaba: LL gcd(LL a, LL b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: while(a) 4fd800b3a8 2011-02-23 kinaba: swap(a, b%=a); 4fd800b3a8 2011-02-23 kinaba: return b; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: LL lcm(LL a, LL b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: return a/gcd(a,b)*b; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: class TheAlmostLuckyNumbers { public: 4fd800b3a8 2011-02-23 kinaba: void genLuck(vector<LL>& v) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: // lucky numbers 4fd800b3a8 2011-02-23 kinaba: vector<LL> u; 4fd800b3a8 2011-02-23 kinaba: for(int d=1; d<=10; ++d) 4fd800b3a8 2011-02-23 kinaba: genLuck(d, u); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: // filtering 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<u.size(); ++i) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: for(int j=0; j<i; ++j) 4fd800b3a8 2011-02-23 kinaba: if( u[i] % u[j] == 0 ) 4fd800b3a8 2011-02-23 kinaba: goto next; 4fd800b3a8 2011-02-23 kinaba: v.push_back( u[i] ); 4fd800b3a8 2011-02-23 kinaba: next:; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: sort(v.begin(), v.end()); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: void genLuck(int d, vector<LL>& v) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: // d-digit lucky numbers 4fd800b3a8 2011-02-23 kinaba: for(int b=0; b<(1<<d); ++b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: LL n = 0; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<d; ++i) 4fd800b3a8 2011-02-23 kinaba: n = n*10 + (b&(1<<i) ? 4 : 7); 4fd800b3a8 2011-02-23 kinaba: v.push_back(n); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: long long count(long long a, long long b) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: vector<LL> v; 4fd800b3a8 2011-02-23 kinaba: genLuck(v); 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: static const int M = 16; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: // inclusion-exclusion 4fd800b3a8 2011-02-23 kinaba: LL cnt = 0; 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: for(int m=1; m<(1<<M); ++m) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: int bc = 0; 4fd800b3a8 2011-02-23 kinaba: LL n = 1; 4fd800b3a8 2011-02-23 kinaba: for(int i=0; i<M; ++i) 4fd800b3a8 2011-02-23 kinaba: if( m & (1<<i) ) 4fd800b3a8 2011-02-23 kinaba: ++bc, n=lcm(n, v[i]); 4fd800b3a8 2011-02-23 kinaba: cnt += (bc&1) ? (b/n-(a-1)/n) : -(b/n-(a-1)/n); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: // sieve 4fd800b3a8 2011-02-23 kinaba: vector<LL> aml; // almost lucky numbers 4fd800b3a8 2011-02-23 kinaba: for(int i=M; i<v.size() && v[i]<=b; ++i) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: LL u = v[i]; 4fd800b3a8 2011-02-23 kinaba: for(LL s=a%u?(a/u+1)*u:a; s<=b; s+=u) 4fd800b3a8 2011-02-23 kinaba: { 4fd800b3a8 2011-02-23 kinaba: for(int k=0; k<M; ++k) 4fd800b3a8 2011-02-23 kinaba: if( s%v[k]==0 ) 4fd800b3a8 2011-02-23 kinaba: goto next; 4fd800b3a8 2011-02-23 kinaba: aml.push_back(s); 4fd800b3a8 2011-02-23 kinaba: next:; 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: if( aml.size() > 10000000 ) { 4fd800b3a8 2011-02-23 kinaba: sort(aml.begin(), aml.end()); 4fd800b3a8 2011-02-23 kinaba: aml.erase(unique(aml.begin(), aml.end()), aml.end()); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: sort(aml.begin(), aml.end()); 4fd800b3a8 2011-02-23 kinaba: aml.erase(unique(aml.begin(), aml.end()), aml.end()); 4fd800b3a8 2011-02-23 kinaba: return cnt + aml.size(); 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: }; 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: // BEGIN CUT HERE 4fd800b3a8 2011-02-23 kinaba: #include <ctime> 4fd800b3a8 2011-02-23 kinaba: double start_time; string timer() 4fd800b3a8 2011-02-23 kinaba: { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); } 4fd800b3a8 2011-02-23 kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) 4fd800b3a8 2011-02-23 kinaba: { os << "{ "; 4fd800b3a8 2011-02-23 kinaba: for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it) 4fd800b3a8 2011-02-23 kinaba: os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; } 4fd800b3a8 2011-02-23 kinaba: void verify_case(const long long& Expected, const long long& Received) { 4fd800b3a8 2011-02-23 kinaba: bool ok = (Expected == Received); 4fd800b3a8 2011-02-23 kinaba: if(ok) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl; 4fd800b3a8 2011-02-23 kinaba: cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } } 4fd800b3a8 2011-02-23 kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock(); 4fd800b3a8 2011-02-23 kinaba: #define END verify_case(_, TheAlmostLuckyNumbers().count(a, b));} 4fd800b3a8 2011-02-23 kinaba: int main(){ 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: CASE(0) 4fd800b3a8 2011-02-23 kinaba: long long a = 1LL; 4fd800b3a8 2011-02-23 kinaba: long long b = 10LL; 4fd800b3a8 2011-02-23 kinaba: long long _ = 3LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(1) 4fd800b3a8 2011-02-23 kinaba: long long a = 14LL; 4fd800b3a8 2011-02-23 kinaba: long long b = 14LL; 4fd800b3a8 2011-02-23 kinaba: long long _ = 1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(2) 4fd800b3a8 2011-02-23 kinaba: long long a = 1LL; 4fd800b3a8 2011-02-23 kinaba: long long b = 100LL; 4fd800b3a8 2011-02-23 kinaba: long long _ = 39LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(3) 4fd800b3a8 2011-02-23 kinaba: long long a = 1234LL; 4fd800b3a8 2011-02-23 kinaba: long long b = 4321LL; 4fd800b3a8 2011-02-23 kinaba: long long _ = 1178LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(4) 4fd800b3a8 2011-02-23 kinaba: long long a = 1LL; 4fd800b3a8 2011-02-23 kinaba: long long b = 10000000000LL; 4fd800b3a8 2011-02-23 kinaba: long long _ = -1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: CASE(5) 4fd800b3a8 2011-02-23 kinaba: long long a = 10000000000LL; 4fd800b3a8 2011-02-23 kinaba: long long b = 10000000000LL; 4fd800b3a8 2011-02-23 kinaba: long long _ = -1LL; 4fd800b3a8 2011-02-23 kinaba: END 4fd800b3a8 2011-02-23 kinaba: 4fd800b3a8 2011-02-23 kinaba: } 4fd800b3a8 2011-02-23 kinaba: // END CUT HERE