Cod sursa(job #1047505)
Utilizator | Data | 4 decembrie 2013 16:50:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include<math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
bool v[2000001]={0};
int n,i,p,aux=0;
in>>n;
for(i=2;i<=sqrt(n);i++)
if(v[i]==0)
for(p=i+i;p<=n;p=p+i)
v[p]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
aux++;
out<<aux;
return 0;
}