Cod sursa(job #1296841)
Utilizator | Data | 21 decembrie 2014 15:40:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[1000001];
int main()
{
int n;
in>>n;
for(int i=0;i<=n;i++)
{
v[i]=0;
}
for(int i=2;i<=n;i++)
if(v[i]==0)
{
out<<i<<" ";
for(int j=2;j*i<=n;j++)
v[i*j]=1;
}
return 0;
}