Cod sursa(job #2254592)
Utilizator | Data | 5 octombrie 2018 16:44:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ int n,pp,d,i,K=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++){pp=1; for(d=2;d<=i/2;d++)if(i%d==0)pp=0;
if(pp==1)K++;}
g<<K;
return 0;
}