Cod sursa(job #2362603)
Utilizator | Data | 3 martie 2019 11:17:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define NR 2000001
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long a[NR];
int main()
{
int n,i,nr=0,j;
f>>n;
for(i=1;i<=n;++i)
a[i]=1;
for(i=2;i<=n;++i)
if(a[i]==1)
{
nr++;
for(j=i+i;j<=n;j+=i)
a[j]=0;
}
g<<nr;
return 0;
}