Cod sursa(job #1860753)
Utilizator | Data | 28 ianuarie 2017 12:52:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <bits/stdc++.h>
using namespace std;
long long i,j,n,k;
int main(){
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for (i=2;i<=n;i++)
if (i%2==0 ||i%3==0 || i%7==0 || i%5==0) k++;
cout<<n-1-k+4;
return 0;
}