对数能混30分

#include<bits/stdc++.h>
using namespace std;
int k;
long long n;
set<long long> s;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> k;
	if (k == 1)
	{
		cout << n;
		return 0;
	}
	for (long long a = 2; a <= n; a++)
	{
		for (long long b = k; b <= (log(n)/log(a)); b++)
		{
			s.insert(pow(a, b));
		}
	}
	cout << s.size()+1;
	return 0;
}