Cod sursa(job #1338901)
Utilizator | Data | 10 februarie 2015 15:15:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream>
using namespace std;
int n,n1[2000001],i,j,k;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;k=-1;
for(i=2;i<=n;++i)for(j=i;j<=n/i;++j)if(n1[i]==0){n1[i*j]=1;++k;}
fout<<k;
return 0;
}