Cod sursa(job #279686)
| Utilizator |  Roti Andrei andreir |
Data | 12 martie 2009 22:11:27 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int *ciur;
int main()
{
ciur=new int[2000000];
long int i,j,n,k;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++)
ciur[i]=0;
for(i=2;i<=n;i++)
for(j=2;i*j<n;j++)
ciur[j*i]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
k++;
fout<<k;
return 0;
}