Cod sursa(job #1707467)
Utilizator | Data | 25 mai 2016 10:28:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000001],nr,i,j,n;
int main()
{
fin>>n;
for(i=2;i*i<=n;i++)
if(ciur[i]==0)
for(j=2;j*i<=n;j++)
ciur[i*j]=1,nr++;
fout<<n-nr;
return 0;
}