Cod sursa(job #1577867)
| Utilizator | Data | 23 ianuarie 2016 22:12:04 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include<math.h>
using namespace std;
int main()
{ int n,i,d,k=0,nr=2;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=4;i<=n;i++)
{
for(d=2;d<=sqrt(i);d++)
{if(i%d==0)
{k++;}}
if(k==0)
{nr++;}
k=0;}
if(n==1)
fout<<"0";
if(n==2)
fout<<"1";
if(n==3)
fout<<"2";
if(n>3)
fout<<nr;
fin.close();
fout.close();
return 0;
}
