原题目:
题目大意:找到一个最小的数,这个数有2^500500个因数
解题思路:
代码:
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip> //cout输出精度控制需要,fixed、setpercison()
#include <time.h>
using namespace std;
#define ll long long
ll A[2000000], B[2000000], C[2000000],D[2000000];
struct Math{ //自用函数模板
ll i, j;
struct NumT {
ll Rad[1000000];
void get_rad(ll x) {
ll i, j,k;
for (i = 1; i <= x; i++) {
Rad[i] = 1;
k = i;
for (j = 1; prime[j] <= i; j++) {
if (k % prime[j] == 0) {
Rad[i] *= prime[j];
while (k % prime[j] == 0) {
k = k / prime[j];
}
}
}
}
}
ll prime_pow(ll x,ll y,ll mod) {
ll ans = 1;
while (y) {
if (y & 1) {
ans = ( (ans%mod) * (x%mod) ) % mod;
}
x = ( (x%mod) * (x%mod) )%mod;
y >>= 1;
}
return ans % mod;
}
ll prime_mul(ll x, ll y, ll mod) {
ll ans = 0;
while(y) {
if (y & 1) {
ans = (ans + x) % mod;
}
x = (x + x) % mod;
y >>= 1;
}
return ans;
}
ll prime[6000000],pcnt;
bool prime_vis[100000000];
bool is_prime_MR(ll x,ll r) {
if (x == 2)return 1;
if (!(x%2))return 0;
ll i, j,k,t,X,Y;
k = x-1;
t = 0;
while (!(k&1)) {
k >>= 1;
t++;
}
srand(time(NULL));
for (i = 1; i <= r; i++) {
ll a = rand() % (x - 1) + 1;
X = prime_pow(a, k, x);
for (j = 0; j < t; j++) {
Y = prime_mul(X, X, x);
if (Y == 1 && X != 1 && X != x - 1) {
return 0;
}
X = Y;
}
if (X != 1) {
return 0;
}
}
return 1;
}
bool is_prime_Bf(ll x) {
ll i, j,k,cnt=0;
if (x == 2)return 1;
if (x % 2 == 0)return 0;
for (i = 2; i <= sqrt(x); i++) {
if (x % i == 0)return 0;
}
return 1;
}
void get_prime_Euler(ll x) {
pcnt = 0; memset(prime_vis, 0, sizeof(prime_vis));
ll i, j;
for (i = 2; i <= x; i++) {
if (prime_vis[i] == 0) {
prime[++pcnt]=i;
}
for (j = 1; j <= pcnt; j++) {
if (i * prime[j] > x)break;
prime_vis[i * prime[j]] = 1;
if (i % prime[j] == 0)break;
}
}
}
ll gcd(ll a, ll b) {
if (a < b) {
ll c = a;
a = b; b = c;
}
if (a % b == 0)return b;
else return gcd(b, a % b);
}
}NT;
}M;
ll ans1 = 0,ans2=0,flag;
void solve() {
ll i, j,k,x,y,p,q,u,v;
ll N = 500500;
u = 0;
M.NT.get_prime_Euler(100000000);
for (i = 1; i <= N; i++) {
A[i] = 1;
C[i] = 2;
B[i] = M.NT.prime[i] * M.NT.prime[i];
}
x = N;
while (1) {
flag = 0;
for (i = 1; i < x; i++) {
if (B[i] < M.NT.prime[x]) {
A[i] = A[i] + C[i];
C[i] = C[i] * 2;
B[i] = B[i] * B[i];
A[x] = 0;
C[x] = 0;
x--;
flag = 1;
break;
}
}
if (flag == 0)break;
}
for (i = 1; i <= x; i++) {
ans1 = ans1 * M.NT.prime_pow(M.NT.prime[i], A[i], 500500507);
ans1 = ans1 % 500500507;
}
printf("%lld\n", ans1);
}
int main()
{
long test;
clock_t start, finish; // clock_t为时钟计时单元数
start = clock(); // clock()返回此时CPU时钟计时单元数
solve();
finish = clock();
cout << "代码运行花费时间为:" << fixed << setprecision(8)//控制时间输出精度8位,右侧自动补0。
<< double(finish - start) / CLOCKS_PER_SEC << "s" << endl; //时间计算过程
}