Cod sursa(job #2093461)
Utilizator | Data | 23 decembrie 2017 18:42:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ int n,i,d,k=0,a;
f>>n;
for(i=2;i<=n;i++)
{a=1;
for(d=2;d<=i/2;d++)
{if(i%d==0){a=0;break;}}
if(a==1)k++;}
g<<k;
f.close();
g.close();
return 0;}