f(n)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 471 Accepted Submission(s): 283
Problem Description
This time I need you to calculate the f(n) . (3<=n<=1000000)
f(n)= Gcd(3)+Gcd(4)+…+Gcd(i)+…+Gcd(n).
Gcd(n)=gcd(C[n][1],C[n][2],……,C[n][n-1])
C[n][k] means the number of way to choose k things from n some things.
gcd(a,b) means the greatest common divisor of a and b.
f(n)= Gcd(3)+Gcd(4)+…+Gcd(i)+…+Gcd(n).
Gcd(n)=gcd(C[n][1],C[n][2],……,C[n][n-1])
C[n][k] means the number of way to choose k things from n some things.
gcd(a,b) means the greatest common divisor of a and b.
Input
There are several test case. For each test case:One integer n(3<=n<=1000000). The end of the in put file is EOF.
Output
For each test case:
The output consists of one line with one integer f(n).
The output consists of one line with one integer f(n).
Sample Input
3 26983
Sample Output
3 37556486
思路:此题做了好久..................两个难点,一个找出规律,另一个是优化时间。
找规律直接推理我还真一点思路都没有....打了前面几项的表才看出来的规律。
规律是 当n的质因子只有一个时,Gcd(n)=p(质因子) 否则为1
优化时间主要是devide函数(找质因子),不能从2到sqrt(n)遍历,会炸掉。
我们在素数筛选时找到了1~1000000间的所有素数,我们每次只要枚举素数就可以了,且当某个素数的平方大于n时及时退出
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define LL long long
LL prime[1000010];
LL notprime[1000010];
LL f[1000010];
int num;
void init()
{
num=0;
for(LL i=2; i*i<=1000000; i++)
{
if(!notprime[i])
{
prime[++num]=i;
for(LL j=i*i; j<=1000000; j+=i)
notprime[j]=1;
}
}
}
LL devide(LL n)
{
LL cnt=0,k;
for(LL i=1; i<=num&&prime[i]*prime[i]<=n; i++)
{
if(n%prime[i]==0)
{
cnt++;
if(cnt>2) return 1;
k=prime[i];
while(n%prime[i]==0)
n/=prime[i];
}
}
if(cnt==1&&n==1) return k;
if(cnt==0&&n>1) return n;
return 1;
}
void get()
{
f[2]=0;
for(LL i=3; i<=1000000; i++)
{
if(!notprime[i]) f[i]=f[i-1]+i;
else f[i]=f[i-1]+devide(i);
}
}
int main()
{
LL n;
init();
get();
while(scanf("%lld",&n)!=EOF)
printf("%lld\n",f[n]);
return 0;
}
后面自己又想到了另外一种做法,31msAC
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define LL long long
int prime[1000010];
int notprime[1000010];
LL f[1000010];
void init()
{
for(LL i=2; i*i<=1000000; i++)
{
if(!notprime[i])
{
for(LL j=i*i; j<=1000000; j+=i)
notprime[j]=1;
for(LL j=i; j<=1000000; j*=i)
prime[j]=i;
}
}
}
void get()
{
f[2]=0;
for(LL i=3; i<=1000000; i++)
{
if(!notprime[i]) f[i]=f[i-1]+i;
else if(prime[i]) f[i]=f[i-1]+prime[i];
else f[i]=f[i-1]+1;
}
}
int main()
{
LL n;
init();
get();
while(scanf("%lld",&n)!=EOF)
printf("%lld\n",f[n]);
return 0;
}