Cod sursa(job #1391217)
Utilizator | Data | 17 martie 2015 18:31:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include<fstream>
#include<math.h>
using namespace std;
bool v[2000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ long j,n,i,k=0;
f>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=sqrt(n);i++)
for(j=i;j<=n/i;j++)
v[i*j]=0;
for(i=2;i<=n;i++)
if(v[i]==1)
k++;
g<<k;
f.close();
g.close();
return 0;
}