Cod sursa(job #1241408)
Utilizator | Data | 13 octombrie 2014 15:10:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
bool a[2000000];
int main()
{
int nr=0,n,i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<+n;i++)
a[i]=1;
for(i=2;i<=sqrt(n);i++)
if(a[i])
for(j=1;j<=n/i;j++)
a[i*j]=0;
for(i=2;i<=n;i++)
if(a[i])
nr++;
g<<nr<<endl;
return 0;
}