Cod sursa(job #832941)
Utilizator | Data | 11 decembrie 2012 18:37:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,i,j,v[1000],nr=0;
int main()
{
fin>>N;
for(i=2;i<=N;i++)
{
if(v[i]==0){
nr++;
for(j=i+i;j<=N;j=j+i)
v[j]=1;
}
}
fout<<nr;
return 0;
}