Cod sursa(job #382727)
Utilizator | Data | 14 ianuarie 2010 15:20:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,div,i,x=0,ok;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(div=2;div<n;div++)
{ok=0;
for(i=2;i<=div/2;i++)
if(div%i==0)
ok=1;
if(ok==0)
x++;}
g<<x;
return 0;
}