题目:点击打开链接
题意:按照题中给出的方式生成n个数,求这n个数任意两个数的最小公倍数的最大值。
分析:由于数据看上去像是随机生成的,所以只需要选出前 100 大的数平方暴力即可。随机两个正整数互质的概率为 6/π^2,取前k个数可以用STL的nth_element。
代码:
#pragma comment(linker, "/STACK:102400000,102400000")///手动扩栈
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<string>
#include<cstdio>
#include<bitset>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<set>
#include<map>
using namespace std;
#define debug test
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
///#define ll long long
#define ll unsigned long long
#define pb push_back
#define mp make_pair
#define inf 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
typedef pair<int,int> PII;
const ll mod = 1e9+7;
const int N = 1e7+10;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qp(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
int to[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
ll a,b,c,T,tp[N];
unsigned x,y,z;
int n;
unsigned tang() {
unsigned t;
x^= x<<16;
x^= x>>5;
x^= x<<1;
t=x;
x=y;
y=z;
z = t^x^y;
return z;
}
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>T;
int k=1;
while(T--) {
cin>>n>>a>>b>>c;
x=a,y=b,z=c;
ll ans=0;
for(int i=1;i<=n;i++) tp[i]=tang();
nth_element(tp+1,tp+100,tp+n+1,greater<ll>());
for(int i=1;i<=min(100,n);i++)
for(int j=1;j<=min(100,n);j++)
ans=max(ans,tp[i]*tp[j]/__gcd(tp[i],tp[j]));
cout<<"Case #"<<k++<<": ";
cout<<ans<<endl;
}
return 0;
}