Cod sursa(job #2504598)
Utilizator | Data | 5 decembrie 2019 11:38:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,nr=0,d,i;
bool prim=1;
f>>n;
for(i=1;i<=n;i++)
{
if(i<2)
{
prim=0;
}
else
{
for(d=2;d<=sqrt(i);d++)
{
if(i%d!=0)
{
nr++;
break;
}
}
}
}
g<<nr;
return 0;
}