Cod sursa(job #2172234)
Utilizator | Data | 15 martie 2018 15:42:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool c[2000001];
long n, i, j, p;
int main()
{
f >> n;
for( i = 2 ; i <= n; i++)
if( c[i] == 0 )
{
p++;
for( j= i+i ; j <= n ; j +=i )
c[j] = i ;
}
g << p;
return 0;
}