Cod sursa(job #1525658)
Utilizator | Data | 15 noiembrie 2015 13:01:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{bool v[2000001];
int n,i,j,k=0;
f>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=sqrt(n);i++)
{
if(v[i]==1)
for(j=i;j<=n/i;j++)
v[i*j]=0;
}
for(i=2;i<=n;i++)
{
if(v[i]==1)
k++;}
g<<k;
return 0;
}