Cod sursa(job #2504585)
Utilizator | Data | 5 decembrie 2019 11:31:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,i,contor=1,d,prim;
f>>n;
for(i=3;i<=n;i=i+2)
{
prim=1;
for(d=2;d<=sqrt(i);d++)
if(i%d==0)
{
prim=0;
break;
}
if(prim==1)
contor++;
}
g<<contor;
return 0;
}