Cod sursa(job #2114507)
| Utilizator | Data | 25 ianuarie 2018 17:01:56 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
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<=n/2;i++)
{
for(int j=i;i*j<=n/2;j++)
a[i*j]++;
}
int nr=0;
for(int i=1;i<=n;i++)
{
if(a[i]==0)
nr++;
}
fout<<nr;
}
