Cod sursa(job #2695538)
Utilizator | Data | 13 ianuarie 2021 16:39:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int main()
{
int prim,n,c=0;
cin>>n;
for(int i=2;i<=n;i++)
{
prim=1;
for(int j=2;j<=i/2;j++)
{
if(i%j==0)
prim=0;
if(prim==1)
c++;
}
}
cout<<c;
return 0;
}