Cod sursa(job #580687)
Utilizator | Data | 13 aprilie 2011 13:17:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{long long i,j,nr,suma,d,ok;
f>>nr;
suma=0;
for(i=1;i<=nr;i++)
{ok=1;
for(j=i;j<=i;j++)
{for(d=2;d<=sqrt(j);d++)
if(j%d==0) ok=0;}
if(ok==1) suma++;}
g<<suma;
}