Cod sursa(job #1241393)
Utilizator | Data | 13 octombrie 2014 14:48:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool c[2000001];
int main()
{
int nr=0,i,j,n;
in>>n;
for(i=2;i<=sqrt(n);i++)
if(!c[i])
for(j=i*i;j<=n;j+=i)
c[j]=true;
for(i=2;i<=n;i++)
if(!c[i])
nr++;
out<<nr;
return 0;
}