Cod sursa(job #1927937)
Utilizator | Data | 15 martie 2017 18:48:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int n,i,j,x[1000002],nr;
bool p[1000002];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
for(i=2;i<=n;i++)p[i]=true;
for(i=2;i*i<=n;i++)
if(p[i]==true)
for(j=i*2;j<=n;j+=i)
p[j]=false;
for(i=1;i<=n;i++)
{
if(p[i]==true)nr++;
}
g<<nr<<'\n';
return 0;
}