Cod sursa(job #655173)
Utilizator | Data | 1 ianuarie 2012 17:19:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
// ciur
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long int n,j,i,x=0;
bool ok;
f>>n;
for(i=3;i<=n;i=i+2)
{
ok=true;
for(j=2;j<=floor(i/2);j++)
if(i%j==0) ok=false;
if(ok==true) x++;
}
x++;
g<<x;
f.close();
g.close();
return 0;
}