Submission #1368856

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;

bool isprime[10000];
long long now=1;
vector<int> prime;
int main(){
	for(int i=2;i<10000;i++){
		if(!isprime[i]){
			for(int j=2;i*j<10000;j++){
				isprime[i*j]++;
			}
			prime.push_back(i);
		}
	}
	int i=0;
	for(int k=0;k<100;k++){
	now=1;
	while(1){
		if(now*prime[i]>1e9) break;
		else{
			now*=prime[i];
		}
		i++;
	}
	while(now*2<1e9){
		now*=2;
	}
	cout<<now<<endl;
	}
	return 0;
}

Submission Info

Judge Result