Cod sursa(job #1339961)
Utilizator | Data | 11 februarie 2015 13:19:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 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;
for(i=2;i<=n;++i)for(j=i;j<=n/i;++j)if(n1[i]==0){n1[i*j]=1;}j=0;
for(i=2;i<=n;++i)if(n1[i]==0)++j;
fout<<j;
return 0;
}