Cod sursa(job #2114513)
Utilizator | Data | 25 ianuarie 2018 17:04:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000003];
int main()
{
a[1]++;
int n;
fin>>n;
for(int i=2;i<=sqrt(n);i++)
{
for(int j=i;i*j<=n;j++)
a[i*j]++;
}
int nr=0;
for(int i=1;i<=n;i++)
{
if(a[i]==0)
nr++;
}
fout<<nr;
}