Remoteland(標題爲轉載鏈接)
As the years in Remoteland have 1,000,000,007 days, their citizens just need D modulo 1,000,000,007. Note that they are interested in the largest D, not in the largest D modulo 1,000,000,007.
#include <iostream>
#include <cstdio>
using namespace std;
int const maxSize=10000000;
long long ans[10000005];
int isPrime[10000005];
int primes[maxSize],l;
void init()//用於求出在範圍之內的所有的素數,順便將範圍內的所有的合數相乘得到ans[i],ans[i]表示不小於i的所有的合數的乘積,並求模
{
ans[0] = ans[1] = 1;
l = 0;
for (int i=2; i<=maxSize; i++)
{
ans[i] = ans[i-1];//繼承i-1的ans
if (!isPrime[i])
{
primes[l++] = i;//記錄(範圍內)所有的素數
if (i < 3163)
for (int j=i*i; j<=maxSize; j+=i)//標記合數,合數爲true
isPrime[j] = true;
}
else
ans[i] = (ans[i] * i) % 1000000007;//求ans[i]
}
}
int main()
{
init();
int n;
while(~scanf("%d", &n)&& n)
{
long long num = ans[n];
for (int i=0; i<l && primes[i] <= n/2; ++i)//n/2是因爲n以內的素數範圍不會大於n/2,更準確地說是n的算術平方根
{
int cnt = 0;
int tn = n;
while(tn >= primes[i])//這裏很巧妙的求出了某一個素數在基本算數定理中的冪
{
tn /= primes[i];
cnt += tn;
}
if (cnt % 2 == 0)//由代碼上面的解釋而來
num = (num * primes[i]) % 1000000007;
}
printf("%lld\n", num);
}
return 0;
}