Cod sursa(job #1275071)
Utilizator | Data | 24 noiembrie 2014 18:39:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ int n,i,d,nr,nr1;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;nr=0;nr1=0;
for(i=1;i<=n;i++)
{
for(d=2;d<=i;d++)
if(i%d==0)
nr++;
if(nr==2)
{
nr=nr1;
nr1++;
}
}
g<<nr1<<"\n";
f.close();
g.close();
return 0;
}