Cod sursa(job #1004875)
Utilizator | Data | 3 octombrie 2013 19:23:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,nr,a[2000000],j;
int main()
{
f>>n; nr=1;
for(i=2;i<=n;i++)
a[i]=0;
for(i=2;i<=n;i++)
if(a[i]==0)
for(j=i+1;j<=n;j++)
if(a[j]==0)
if(j%i==0) a[j]=1;
for(i=2;i<=n;i+=2)
if(a[i]==0) nr++;
g<<nr;
return 0;
}