Codeforces 145D Lucky Pair (组合计数)

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <algorithm>  
#include <queue>  
#include <set>  
#include <ctime>  
#include <cstdlib>  
using namespace std;  


#define inf 0x3f3f3f3f
#define N 1000020
#define M 1000020
#define LL long long
#define ULL unsigned long long 
#define mod 1000000007
#define ls (i << 1)
#define rs (ls | 1)
#define md (ll + rr >> 1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define B 350

int n, a[N], san[N], cnt;
int pre[N];
set<int> st;
set<int>::iterator p, q;

ULL calc() {
	LL ret = 1ull * n * (n - 1) / 2 * (n - 2) / 3 * (n - 3) / 4;
	ret += 1ull * 2 * n * (n - 1) * (n - 2) / 6;
	ret += 1ull * n * (n - 1) / 2;
	return ret;
}

bool lucky(int x) {
	while(x) {
		if(x % 10 != 4 && x % 10 != 7) return 0;
		x /= 10;
	}
	return 1;
}

int main() {
	scanf