Cod sursa(job #1365895)
Utilizator | Data | 28 februarie 2015 16:29:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int n,i,j,nr,nr_tot=0;
in>>n;
for(i=1; i<=n/2; i++)
{
nr=0;
for(j=1; j<=n; j++)
{
if(i%j==0)nr++;
}
if(nr==2)nr_tot++;
}
out<<nr_tot;
return 0;
}