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
| #include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define maxn
#define put() putchar('\n')
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
using namespace std;
Tp void read(T &x){
int f=1;x=0;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();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
int sum=1;
while (y) {
if (y&1) sum=sum*x%mod;
x=x*x%mod;y>>=1;
}
return sum;
}
int n,k;
int prime[105],cnt,vis[205];
struct yyy {
int w,m,t,p;
yyy (int a=0,int b=0,int c=0,int d=0) {
w=a,m=b,t=c,p=d;
}
bool operator <(const yyy &tmp) const {
return w<tmp.w;
}
};
priority_queue<yyy>q;
signed main(void){
int i,j;
read(n),read(k);
vis[1]=1;
for (i=2;i<=127;i++) {
if (!vis[i]) {
int tot=0;
prime[++cnt]=i;
for (j=i;j<=n;j*=i) ++tot,q.push(yyy(j,cnt-1,tot,i));
}
for (j=i;j<=127;j+=i) vis[j]=1;
}
k--;
while (k--) {
auto tmp=q.top();q.pop();
if (tmp.t>1) {
for (i=1;i<=tmp.m;i++) q.push(yyy(tmp.w/tmp.p*prime[i],i,tmp.t-1,tmp.p));
}
}
printf("%lld",q.top().w);
return 0;
}
|