题目:点击打开链接
题意:中文题
分析:对于所有满足m^k<=n的m,都有m<=n^(1/k),故可以从求满足m^k<=n的个数转化为求m<=n^(1/k)的个数。其中指数k必须为质数,因为合数可以拆成质数之积,产生重复计算,如2^4=4^2。尽管考虑了质因子,但是4^3=8^2,因为他们都等于2^6,因此要对指数应用容斥原理。pi为各个质数,有ans=∑n^(1/pi)-∑n^(1/(pi*pj))+∑n^(1/(pi*pj*pk))-...因为2^60>1e18,所以pi*pj*pk不超过60即可,因为2*3*5*7刚好大于60,所以最多有三个集合交。本题还要考虑精度。
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <map>
#define sqr(x) ((x)*(x))
#define PR pair<int,int>
#define MP make_pair
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
const ll INF = 1e18;
const int inf=0x3f3f3f3f;
const int M=100010;
const int N=15;
const ll MOD=1000000007;
const double eps=1e-3;
const double pi=acos(-1.0);
using namespace std;
ll n,ans;
int prime[18]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59};
void dfs(int idx,int num,int flag)//idx为质数的编号,num是得到的指数的倒数,flag是表示几个集合交
{
if(num>=60) return;
for(int i=idx;i<18;i++)
{
ll p=(ll)(pow(n,1.0/(num*prime[i]))+eps);
if(flag%2) ans+=p;
else ans-=p;
if(p==1) return;
dfs(i+1,num*prime[i],flag+1);
}
}
int main()
{
while(~scanf("%I64d",&n))
{
ans=0;
dfs(0,1,1);
printf("%I64d\n",ans);
}
}