Cod sursa(job #2009699)
Utilizator | Data | 10 august 2017 15:21:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int Prim(int n)
{ int i;
if(n==2) return 1;
for(i=3;i<=n/2;i++)
if(n%i==0) return 0;
else return 1;
}
int main()
{
int n,i,ct;
fin>>n;
ct=0;
for(i=1;i<=n;i++)
if(Prim(i)==1 )
ct++;
fout<<ct;
return 0;
}