Cod sursa(job #1291068)
| Utilizator | Data | 12 decembrie 2014 10:10:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, k;
int main()
{
fin>>n;
for(int i=2;i<=n;i++)
{
int ok=1;
for(int d=2;d*d<=i;d++)
{
if(i%d==0)
ok=0;
}
if(ok==1)
k++;
}
fout<<k;
return 0;
}
