Cod sursa(job #313562)
Utilizator | Data | 9 mai 2009 12:54:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream.h>
int v[2000001];
int main()
{int i,n,j;
ifstream q("ciur.in");
ofstream w("ciur.out");
q>>n;
for(i=2;i<=n;i++)
for(j=i+1;j<=n;j++)
if(j%i==0)
v[j]=1;
int np=0;
for(i=2;i<n;i++)
if(v[i]==0)
np++;
w<<np;
return 0;}