Cod sursa(job #1718089)
Utilizator | Data | 16 iunie 2016 16:51:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool x[2000001];
int main()
{
int n,i,d,nr=0;
in>>n;
for(d=2;d*d<=n;d++)
{
if(x[d]==0)
{
for(i=d+d;i<=n;i=i+d)
x[i]=1;
}
}
for(i=2;i<n;i++)
{
if(x[i]==0)
nr++;
}
out<<nr;
return 0;
}