Cod sursa(job #1380351)
Utilizator | Data | 7 martie 2015 16:09:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main()
{int n,i,d,m=0;
in>>n;
v[i]=1;
for(d=2;d*d<=n;d++)
{if(v[i]==1)
for(i=d+d;i<=n;i=i+d)
if(v[i]==0)
m++;}
out<<m;
return 0;
}