#695929 (C++14) No.1666 累乗数

• 問題: No.1666 累乗数
• ユーザー: inksamurai
• 提出日時: 2021-09-03 23:05:22
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,104 ms / 2,000 ms
• コード長: 1,962 bytes
• コンパイル時間: 1,350 ms
• コンパイル使用メモリ: 169,976 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-12-15 17:08:53
• 合計ジャッジ時間: 19,072 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#include <bits/stdc++.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end());
#define rep(i,n) for(int i=0;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define vec(...) vector<__VA_ARGS__>
#define _3sSOzgI ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
//eodefine
using namespace std;
using pii=pair<int,int>;
using vi=vec(int);
const int mxn=12000;
vi rabbits={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61};
const int m=sz(rabbits);
ll prod[1048576];
vi cand;
void slv(){
    int n;
    cin>>n;
    auto findmagic=[&](ll g,ll x){
        ll l=1,r=x,c=-1;
        if(g>=60){
            return c=1;
        }
        while(l<=r){
            ll m=(l+r)/2;
            ll jj=g;
            ll y=1;
            bool pok=1;
            while(jj>0){
                if(y>x/m){
                    pok=0;
                    break;
                }
                y*=m;
                jj=jj-1;
            }
            if(pok){
                c=m;
                l=m+1;
            }else{
                r=m-1;
            }
        }
        return c;
    };
    auto f=[&](ll x){
        ll sum=0;
        for(auto msk : cand){
            ll g=1;
            bool caughtone=0;
            g=prod[msk];
            int k=__builtin_popcount(msk);
            ll up;
            if(g<60) up=findmagic(g,x);
            else up=1;
            if(k%2) sum+=up;
            else sum-=up;
        }
        sum+=2380;
        // printf("%lld\n",sum);
        return sum;
    };
    // f(10);2
    ll l=0,r=997995681331086344,c=-1;
    while(l<=r){
        ll m=(l+r)/2;
        if(f(m)>=n){
            r=m-1;
        }else{
            c=m;
            l=m+1;
        }
    }
    printf("%lld\n",c+1);
    // cout<<c+1<<"\n";
}
int main(){
_3sSOzgI;
    int sum=0;
    crep(msk,1,(1<<m)){
        int k=__builtin_popcount(msk);
        if(k>4){
            if(k%2) sum+=1;
            else sum-=1;
        }else{
            prod[msk]=1;
            rep(i,m){
                if(msk&(1<<i)){
                    prod[msk]*=rabbits[i];
                }
            }
            cand.pb(msk);
        }
    }
    // cout<<sum<<"\n";
    // slv();
    // cout<<sum<<"\n";
    int t;
    cin>>t;
    rep(cs,t){
        slv();
    }
//  
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX