Submission #1455181

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
vector<int> p,m;
priority_queue<int> Q;
int main(){
	for(int i=2;p.size()<205;i++){
		bool ok=true;
		for(int j=0;j<p.size();j++)if(i%p[j]==0)ok=false;
		if(ok)p.push_back(i);
	}
	Q.push(3456);Q.push(4608);Q.push(6912);Q.push(9216);
	Q.push(13824);Q.push(20736);Q.push(27648);Q.push(41472);
	Q.push(82944);Q.push(124416);Q.push(2304);Q.push(165888);
	for(int i=0;i<99;i++){
		int k=p[i+2]*p[199-i];
		while(Q.top()*k>1000000000){Q.pop();}
		cout<<k<<" "<<Q.top()<<" "<<k*Q.top()<<endl;
	}
	cout<<512*512*729*5<<endl;
	return 0;
}

Submission Info

Judge Result