Cod sursa(job #1497666)
Utilizator | Data | 7 octombrie 2015 08:41:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int main ()
{
long N,i,j,k,v[1000000];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
k=0;
fin>>N;
for(i=2;i<=N;i++)
{
v[i]=1;
}
for(i=2;i<=N;i++)
{
if(v[i]!=0)
{
k++;
j=1;
do
{
v[i*j]=0;
j++;
}while(i*j<=N);
}
}
fout<<k;
}