Cod sursa(job #731310)
Utilizator | Data | 7 aprilie 2012 21:18:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
using namespace std;
int i,j,n,p[1000],nr=1;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=3;i<=n;i+=2)
if(p[i]==0)
for(j=i*i;j<=n;j=j+i*2)
p[j]=1;
for(i=3;i<=n;i+=2)
if (p[i]==0)
nr++;
g<<nr;
}