Cod sursa(job #1812494)
| Utilizator | Data | 22 noiembrie 2016 10:09:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int Prim(int n)
{
int i;
if(n<2) return 0;
if(n==2) return 1;
if(n%2==0) return 0;
for(i=3;i*i<=n;i+=2)
if(n%i==0) return 0;
return 1;
}
int main()
{
int n,i,cnt;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
cnt = 0;
for(i=1;i<=n;++i)
if(Prim(i)) cnt++;
fout<<cnt<<"\n";
fin.close();
fout.close();
return 0;
}
