Cod sursa(job #2053457)
Utilizator | Data | 31 octombrie 2017 19:22:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000014];
int main()
{
int i, n, s=1, j;
in>>n;
v[1]=1;
v[0]=1;
for(i=4; i<=n; i=i+2)
v[i]=1;
for(i=3; i<=n; i=i+2)
if(!v[i])
{
for(int j=2*i; j<=n; j=j+i)
v[i]=1;
s++;
}
out<<s;
return 0;
}