Cod sursa(job #961779)
Utilizator | Data | 12 iunie 2013 21:12:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
int main(void)
{ f>>n;
for(int i=2;i<=n;++i)
{
bool ok=true;
for(int j=2;j*j<=i;++j)
if(i%j==0) ok=false;
if(ok) nr++;
}
g<<nr;
return 0;
}