Cod sursa(job #1569252)
Utilizator | Arvat Ovidiu Daniel iDanyel | Data | 15 ianuarie 2016 10:50:49 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i, d, prim, app = 2;
f >> n;
for(i=3;i<=n;i+=2)
{
prim=1;
d=2;
while(d<=i/2)
{
if(i%d==0) prim=0;
d++;
}
if(prim==0) app++;
}
g << app;
f.close();
g.close();
return 0;
}