Cod sursa(job #2035373)
Utilizator | Data | 9 octombrie 2017 11:47:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur(int n)
{
return (n%2==0 || n%3==0 || n%5==0 || n%7==0) && (n!=3 && n!=2 && n!=5 && n!=7);
}
int main()
{
int a,nr=0;
in>>a;
for(int i=2;i<a;i++)
if(ciur(i))
nr++;
out<<nr;
return 0;
}