Cod sursa(job #1537928)
Utilizator | Data | 28 noiembrie 2015 12:05:05 | |
---|---|---|---|
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 v[200000001];
int main()
{
int i,n,k,j;
in>>n;
v[1]=1;
for(i=1; i<=n; i++)
for(i=1; i<=n; i++)
if(v[i]==0)
for(j=2; j*i<=n; j++)
v[j*i]=1;
k=0;
for(i=2; i<=n; i++)
if(v[i]==0)
k++;
out<<k;
return 0;
}