Cod sursa(job #2116263)
Utilizator | Data | 27 ianuarie 2018 14:23:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int main()
{
int n,i,j,nr=0;
bool a[2000005];
a[1]=1;
f>>n;//cin>>n;
for(i=2;i*i<=n;i++)
{
if(a[i]==0)
for(j=i*2;j<=n;j+=i)
a[j]=1;
}
for (i=2;i<=n;i++)
if(a[i]==0)nr++;
g<<nr;//cout<<nr;
return 0;
}