Cod sursa(job #1989509)
Utilizator | Data | 7 iunie 2017 18:21:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int t,a,b;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int nrprime (int a,int limita)
{ int c=0;
for(int i=1;i<=a;i++)
if(a%i==0)
c++;
if(c==2)
return 1;
}
int main()
{ int long limita; int k=0;
f>>limita;
for(int i=2;i<limita;i++)
{if(nrprime(i,limita)==1)
k++;}
g<<k;
}