摘要： 令x=lcm/gcd将x分解质因数->Pollard rho方法枚举将x分解为两个互素的数相乘代码：#include<ctime>#include<iostream>#include<fstream>using namespace std;long long factor[1000],fac_top = -1;//计算两个数的gcdlong long gcd(long long a,long long b){ if(a==0) return b; long long c; while(b!=0) { c=b; b=a%b; a=c; } return 阅读全文

摘要： 两次筛选。代码：#include<iostream>#include<fstream>#include<cmath>using namespace std;long long a[47001];long long b[47001];long long c[1000001];int mark[1000001];void read(){// ifstream cin("in.txt"); long long i,j,k,top=0,top2; long long s,t,n1,n2,n3,n4; b[0]=2; for(i=4;i<=4 阅读全文

摘要： 模板题。代码：#include<ctime>#include<iostream>using namespace std;long long factor[100],fac_top = -1;//计算两个数的gcdlong long gcd(long long a,long long b){ if(a==0) return b; long long c; while(b!=0) { c=b; b=a%b; a=c; } return a;}//ret = (a*b)%n (n<2^62)long long muti_mod(long long a,long long 阅读全文