Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long lol;
- char a[110][110];
- vector <lol> pr;
- void build()
- {
- for (int i = 0; i<40000; i++)
- {
- bool t = true;
- for (int j = 2; j<sqrt(i); j++)
- if (i % j == 0)
- {
- t = false;
- break;
- }
- if (t)
- pr.push_back(i);
- }
- return;
- }
- lol pow_1(lol x, lol alfa)
- {
- lol res = 1;
- double res1 = 1;
- for( int i = 0; i < alfa; i++ )
- {
- res *= x;
- res1*=x;
- }
- if(res1>1e18)
- return 2e18;
- return res;
- }
- int main()
- {
- lol n, p;
- build();
- scanf("%lld%lld", &n, &p);
- int alfa = p-1;
- int i = 0;
- lol q = pow_1(pr[0], alfa);
- while (q<=n)
- {
- i++;
- q = pow_1(pr[0], alfa);
- }
- printf("%d", i);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement