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