Cod sursa(job #1528932)
Utilizator | Data | 20 noiembrie 2015 11:21:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include<cmath>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
bool a[1000001];
int nr=0,n,j,i,cnt=0;
in>>n;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=sqrt(n);i++)
if(a[i]!=0)
for(j=2;j<=n;j++)
a[i*j]=0;
for(i=2;i<=n;i++)
if(a[i]==1)
cnt++;
out<<cnt;
return 0;
}