Cod sursa(job #2504583)
Utilizator | Data | 5 decembrie 2019 11:29:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,b=0,prim;
f>>n;
for(int i=2;i<=n;i++)
{
prim=0;
for(int d=2;d<=trunc(sqrt(i));d++)
{
if(i%d==0)
prim++;
}
if(prim==0)
b++;
}
g<<b;
return 0;
}