Cod sursa(job #1677262)
Utilizator | Data | 6 aprilie 2016 14:10:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
bool A[2000000];
long n,i,j,nr=0;
int main()
{ ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
A[i]=true;
for(i=2;i*i<=n;i++)
if(A[i])
for(j=2*i;j<=n;j+=i)
A[j]=false;
for(i=2;i<=n;i++)
if(A[i])nr++;
g<<nr;
return 0;
}