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>
#include <assert.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;

	return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int 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<iostream>
#include<vector>
#include<algorithm>
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,s,e) for(int i=s;i<e;i++)

using namespace std;

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(void){
	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;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(a,n) rep(i,0,n){ cout<<(i ? " ":"")<<a[i]; }cout<<endl;
#define pprint(a,m,n) rep(j,0,m){ print(a[j],n); }
const int mod = 1e9+7;
const int size=1e5;
const int INF=1e9;
int main(){
	int H,A,B;cin>>H>>A>>B;
	int cnt=0;
	rep(i,A,B+1){
		if(H%i==0) cnt++;
	}cout<<cnt<<endl;
	return 0;
}

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

int main(){
    int H,A,B;cin >> H >> A >> B;
    LL ans = 0;
    for(int a = A;a <= B;a++){
        if(H%a == 0)ans++;
    }
    cout<<ans<<endl;
}
//2t+2

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);(i)++)
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);(i)++)
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);(i)--)
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);(i)--)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& input, vector<T>& v) { for (auto& elemnt : v)input >> elemnt; return input; }

int main() {
    init();
    
    int h, a, b;
    cin >> h >> a >> b;

    int ans = 0;
    eFOR(i, a, b)if (h % i == 0)ans++;
    cout << ans << "\n";
}

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

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

	cin >> h >> a >> b;

	for (int i = 0; i <= b - a; i++) {
		if (h % (a + i) == 0)
			n++;
	}

	cout << n << endl;
	
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
  int T,A,B,ans=0;
  cin>>T>>A>>B;
  for(int i = A; A<=B;A++){
      if(T%A==0)ans++;}
      cout<<ans<<endl;
  
}

C++: #define _USE_MATH_DEFINES

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>

using namespace std;

typedef pair<long long int, long long int> P;

long long int INF = 1e18;
long long int MOD = 1e9 + 7;

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 += 1;
		}
	}
	
	cout << ans << endl;
	
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
using namespace std;

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 <iostream>
using namespace std;
int main(void){
    int h,a,b,x;
    x=0;
    cin>>h>>a>>b;
    for(int i=a;a<=b;a++){
        if(h%a==0)x++;
    }
    cout<<x<<endl;
}

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

using namespace std;
using llong = long long;
using ldbl = long double;
using P = pair<llong, llong>;

#define BE(x) x.begin(), x.end()

const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;

int main(){
	llong 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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define MOD 1000000007
#define INF 9223372036854775807

signed main(){
  int x=0,y=0,z=0,w=0;
  std::cin >> x>>y>>z;
  for(int i=y;i<=z;i++){
    if(x%i==0)w++;
  }
  std::cout << w << '\n';
}

C++: #include <iostream>
using namespace std;
int main(void){
   int T,A,B,ans=0;
   cin >> T >> A >> B;
   for(int i=A; A<=B; A++){
       if(T%A == 0) ans++;
   }
   cout << ans << endl;
}

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

int main() {
	long long 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 <cstdio>
using namespace std;

int main(void){
    int H, A, B, res = 0;
    scanf("%d %d %d", &H, &A, &B);
    for (int i = A; i <= B; i++) if (H % i == 0) res++;
    printf("%d\n", res);
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int s,a,b,c,f;
    s=0;
    f=0;
    cin>>a>>b>>c;
    while(1){
        f=c-b;
        if(a%c==0){
            s++;
        }
        if(f<=0){
            break;
        }
        c--;
    }
    cout<<s<<endl;
}

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

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

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

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::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<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
int main(void)
{
	int h,a,b,i,cnt;
	scanf("%d %d %d",&h,&a,&b);
	cnt=0;
	for(i=a;i<=b;i++)	{
		if(h%i==0)	cnt++;
	}
	printf("%d\n",cnt);
	return 0;
}

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

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

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

  cout << cnt << endl;
}