Cod sursa(job #2181084)
Utilizator | Data | 21 martie 2018 13:55:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,i,j,nr=0;
bool ciur[2000001];
int main()
{
f>>n;
ciur[0]=ciur[1]=true;
for(i=2;i<=n*n;i++)
{
if(ciur[i]==false)
for(j=2*i;j<=n;j+=i)
ciur[j]=true;
}
for(i=2;i<=n;i++)
if(ciur[i]==false)
nr++;
g<<nr<<'\n';
return 0;
}