Cod sursa(job #1100315)
Utilizator | Data | 6 februarie 2014 19:50:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int b,nrdiv=0,prime=0,nr,i,h;
in>>b;
for(nr=1;nr<=b;nr++)
{
nrdiv = 0;
for(i=1;i<=nr;i++) {
if(nr%i==0)
nrdiv=nrdiv+1;
}
if(nrdiv==2)
{
prime++;
h=nr;
}
}
out<<prime<<" "<<endl;
return 0;
}