Go: package main

import "fmt"

func main() {
	var h, a, b int
	fmt.Scanln(&h, &a, &b)
	hNum := 0
	for ; a <= b; a++ {
		if h%a == 0 {
			hNum++
		}
	}
	fmt.Println(hNum)
}

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;

int main(){
	int h,a,b;cin>>h>>a>>b;
	int cnt=0;
	for(int i=a;i<=b;i++){
		if(h%i==0)cnt++;
	}
	cout<<cnt<<endl;
}

C++: #include "bits/stdc++.h"
using namespace std;

int main() {
	int H,A,B; cin>>H>>A>>B;
	int ans=0;
	for(int i=A; i<=B; ++i){
		if(H%i==0){
			++ans;
		}
	}
	cout<<ans<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x).end()
const int INF = 1e18, MOD = 1e9 + 7;
template<class T>
bool chmax(T& a, T b){return (a = max(a, b)) == b;}
template<class T>
bool chmin(T& a, T b){return (a = min(a, b)) == b;}
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for(int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for(auto&& i: n)
signed main() {
    INCANT;
    int a, b, c, res = 0;
    cin>>a>>b>>c;
    rep(i, b, c + 1){
        if(a%i==0) res++;
    }
    cout<<res<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
    int h, a, b;
    cin >> h >> a >> b;
    
    int count = 0;
    for( int i = a; i <= b; i++ ){
        if( h % i == 0 ){
            count++;
        }
    }
    
    cout << count << endl;
}

C++: #include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define ull unsigned long long
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,j,n) for(int i = j; i < n; i++)
#define RFOR(i,j,n) for(int i = j-1; i >= n; i--)
#define PREC(n) fixed << setprecision(n)
#define print_array(v) REP(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
using namespace std;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int H, A, B;
	cin >> H >> A >> B;
	int res = 0;
	FOR(i, A, B+1) res += (H % i == 0 ? 1 : 0);
	cout << res << endl;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#define Cout2(x, y) cout << (x) << " " << (y) << endl
#define dump(x) cerr << #x << " = " << (x) << endl;
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
const int inf = 1e9;
const double pi = acos(-1.0);

vector<int> DivAll(int n) {
	vector<int> ret;
	int i = 1;
	for (; i*i < n; i++)
		if (n%i == 0)ret.push_back(i);
	bool flag = i * i == n;
	if (flag)ret.push_back(i);
	for (i = ret.size() - 1 - flag; i >= 0; --i)
		ret.push_back(n / ret[i]);
	return ret;
}

int main() {
	int h, a, b; cin >> h >> a >> b;
	VI div = DivAll(h);
	int ans = 0;
	for (auto n : div) {
		if (a <= n && n <= b)ans++;
	}
	Cout(ans);
}

C++: #include <iostream>
using namespace std;
int main(void){
int a,n,o,p=0;
cin>>o>>a>>n;
for(int i=a;i<=n;i++){
    if(o%i==0){
       p++; 
    }
}
cout<<p<<endl;

}

C++: #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;

int main() {
  int H, A, B, res = 0;
  cin >> H >> A >> B;

  for(int i=A; i<=B; ++i) {
    if(H%i==0) ++res;
  }

  cout << res << endl;

  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int n, a, b; cin >> n >> a >> b;
	int ans = 0;
	for (int i = a; i <= b; i++) {
		if (n % i == 0) ans++;
	}
	cout << ans << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    long H ,A ,B,n;
    n = 0;
    cin >> H >> A >> B;
    //cout << "runnning" <<endl;
    for(int i = A;i <= B; i++){
        if(H % i == 0){
            n++;
            //cout << i << " ";
            if (H / i <= B && H / i != i){
                n++;
                B = H / i - 1;
                //cout << H / i <<" ";
            }
            
        }
    }
    //cout<<endl;
    cout << n <<endl;
    return 0;
}