Cod sursa(job #2444057)
Utilizator | Data | 30 iulie 2019 10:30:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int N,r=0;
ifstream A("ciur.in");
ofstream B("ciur.out");
A>>N;
for(int i=2;i<=N;i++)
if(i%2!=0 && i%3!=0 && i%5!=0)
++r;
if(N>5)
r+=3;
B<<r;
A.close();
B.close();
return 0;
}