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"
using namespace std;

using int64 = long long;
using i64 = int64;

template<typename T>
using p_que = priority_queue<T>;
template<typename T>
using rp_que = priority_queue<T, vector<T>, greater<T>>;

constexpr int INF = (1 << 30) - 1;
constexpr int64 INF64 = (1ll << 60) - 1;

#define rep(i, N) for(int i=0;i<(int)(N);++i)
#define rep1(i, N) for(int i=1;i<=(int)(N);++i);
#define fs first
#define sc second
#define e_b emplace_back
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	return os << "P(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os << "[";
	for (auto& e : v) os << e << ", ";
	return os << "]";
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& m) {
	os << "{" << endl;
	for (auto& e : m) os << "(" << e.first << ", " << e.second << ")" << endl;
	return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& s) {
	os << "{" << endl;
	for (auto& e : s) os << ", " << e << endl;
	return os << "}";
}

template<typename T>
vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

int64 gcd(int64 x, int64 y) {
	if (x == 0 || y == 0) return 0;
	int64 r;
	while ((r = y % x) != 0) {
		y = x;
		x = r;
	}
	return x;
}
int64 lcm(int64 x, int64 y) {
	if (x == 0 || y == 0) return 0;
	return x / gcd(x, y) * y;
}

int dx[] = { -1, 0, 1, 0 };
int dy[] = { 0, 1, 0, -1 };

void Main();
signed main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(30);
	Main();
}

/*----------------------------Insert from here!----------------------------*/

map< int64_t, int > prime_factor(int64_t n) {
	map< int64_t, int > ret;
	for (int64_t i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			ret[i]++;
			n /= i;
		}
	}
	if (n != 1) ret[n] = 1;
	return ret;
}

struct UnionFind {
	vector< int > data;

	UnionFind(int sz) {
		data.assign(sz, -1);
	}

	bool unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y) return (false);
		if (data[x] > data[y]) swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return (true);
	}

	int find(int k) {
		if (data[k] < 0) return (k);
		return (data[k] = find(data[k]));
	}

	int size(int k) {
		return (-data[find(k)]);
	}
};

/*----------------------------Insert above here----------------------------*/

//const int MOD = 998244353;
//const int MOD = 1e9 + 7;

void 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 <iostream>
using namespace std;

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

C++: #include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define MMP(a, b, c) make_pair(make_pair(a, b), c)
#define MAX 1000000000
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define PI 3.14159265359

#include <boost/multiprecision/cpp_int.hpp>
namespace boost_multiprecision = boost::multiprecision;
#define CINT boost_multiprecision::cpp_int

int main(){
    iostream::sync_with_stdio(false);
    
    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;
    
    return 0;
}

C++: #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//vector<vector<int> > dp;
//vector<vector<vector<int> > > vvvi;
//dp=vector<vector<int> >(N, vector<int>(M,0));
//vector<pair<int,int> > v;
//v.push_back(make_pair(x,y));
//priority_queue<int,vector<int>, greater<int> > q2;



signed main(){
cin.tie(0);
ios::sync_with_stdio(false);

	int H, A, B;
	cin >> H >> A >> B;
	int n = H;
	map<int,bool> ret;
	for (int i = 1; i*i <= n; ++i)
	{
		if (n%i == 0)
		{
			ret[i]=true;
			if (i*i != n)
			{
				ret[n / i] = true;
			}
		}
	}
	int ans = 0;
	eFOR(i, A, B) {
		if (ret[i])ans++;
	}
	cout << ans << endl;
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll H,A,B; cin >> H >> A >> B;
    ll ans = 0;

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

    cout << ans << endl;

    return 0;

}

C++: #include "bits/stdc++.h"

#pragma warning(disable:4996)
using namespace std;


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

C++: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;


int main(){

	int H,A,B;

	scanf("%d %d %d",&H,&A,&B);

	int ans = 0;

	for(int i = A; i <= B; i++){

		if(H%i == 0)ans++;
	}

	printf("%d\n",ans);

	return 0;
}

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

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

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

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

C++: #include <iostream>
#include <algorithm>

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<iostream>
using namespace std;

int main()
{
    int h, a, b, cnt = 0;

    cin >> h >> a >> b;

    for( int i = a; i <= b; i++ )
        if( h % i == 0 )
            cnt++;
    cout << cnt << endl;

    return 0;
}

C++: #include <iostream>

using namespace std;

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

  cout << num << endl;
  return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int h,a,b,x,y,ans,cnt,i;
	scanf("%d %d %d",&h,&a,&b);
	for(i=a;i<=b;i++){
		ans=h%i;
		if(ans==0){
			cnt++;
		}
	}
	printf("%d\n",cnt);
	return 0;
}

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

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