Cod sursa(job #282006)
Utilizator | Data | 16 martie 2009 18:54:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
long int n;
int ciur[2000000];
int main()
{
int k,i,j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;k=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;
}