处女座和测试（一）（素数筛选）

链接：https://ac.nowcoder.com/acm/contest/327/H

2个a,b质数相乘的因数的因数有1,a,b,a*b

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;

ll a[4005],cnt,q[4000005];

void solve(){
	for(int i = 1;i<=100000;++i)
	q[i] = i;
	for(int i = 2;i<=100000;++i){
		if(q[i] == i){
			a[cnt++] = i;
			if(cnt >= 4001)
			return;
			for(int j = i*i;j<=100000;j+=i)
			q[j] = 0;
		}
	}
}

int main(){
	cnt = 0;
	solve();
	for(int i = 0;i<2000;++i){
		//cout<<cnt<<endl;
		cout<<a[i]*a[4000-i]<<endl;
	}
	return 0;
}