Cod sursa(job #1583031)
Utilizator | Data | 28 ianuarie 2016 18:06:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
void read()
{
fin>>N;
}
void ciur()
{
int k=0, i=2;
while(i<N)
{
int prim=1;
for(int d=2;d<=i/2;d++)
{
if(i%d==0)
prim=0;
}
if(prim==1)
k++;
i++;
}
fout<<k;
}
int main()
{
read();
ciur();
return 0;
}