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