蓝桥杯 18省Ca4-第几个幸运数

#include<bits/stdc++.h>

using namespace std;
//    clock_t start, end;
//    start = clock();
//    end = clock();
//    cout << (double) (end - start) / CLOCKS_PER_SEC << endl;
//ios::sync_with_stdio(false);
//cin.tie(nullptr);
#define  int long long
#define lowbit(x) (x&-x)
#define ispow(n) (n & (n - 1)) == 0 //O(1) 判断是否是 2^k（2的k次方）
#define rep(i, x, y) for(int i=(x);i<=(y);++i)
#define dep(i, x, y) for(int i=(x);i>=(y);--i)
#define gcd(a, b) __gcd(a,b)
const long long mod = 1e9 + 7;
const int maxn = 1e3 + 10;

int read() {
    int x = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}





set<int> d;
signed main() {
    
    int ans = 0;

    for (int i = 1; i < 59084709587505; i *= 3) {
        for (int j = 1; j < 59084709587505; j *= 5) {
            for (int k = 1; k < 59084709587505; k *= 7) {

                if (i * j * k < 59084709587505 && i * j * k > 0) {
                    ans++;

                }
            }
        }
        cout << ans << endl;

        return 0;
    }
}