Cod sursa(job #2023592)
Utilizator | Data | 19 septembrie 2017 09:50:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i, j, nr=0;
long int a[200000]={0};
f>>n;
for (i=2; i*i<=n; i++)
{
if (a[i]==0)
{
for (j=i*i; j<=n; j=j+i)
{
a[j]=1;
}
}
}
for (i=2; i<=n; i++)
{
if (a[i]==0)
{
nr++;
}
}
g<<nr;
return 0;
}