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)
}

Python: h, a, b = map(int, input().split())
ans = 0
for i in range(a, b + 1):
  if h % i == 0:
    ans += 1
print(ans)

Python: h,a,b=map(int,input().split())
c=0
for i in range(a,b+1):
    if h%i==0:
        c=c+1
print(c)

Python: h, a, b = map(int, input().split())
ans = 0
for i in range(a, b+1) :
    if h % i == 0 :
        ans += 1
print(ans)

Python: h, a, b = map(int, input().split())
print([(h%(a+c)==0) for c in range(b-a+1)].count(True))

Python: h, a, b = map(int, input().split())
print(sum([h%i==0 for i in range(a, b+1)]))

Python: H,A,B = map(int,input().split())
a = list(range(A,B+1))
x = 0
for i in a:
    if H % i == 0:
        x += 1
print(x)

Python: H,a,b=map(int,input().split())
c=0
for i in range(a,b+1):
  if H%i==0 :
    c+=1
print(c)

Python: H,a,b=map(int,input().split())
c=0
for i in range(a,b):
  if H%a==0 :
    c+=1
  elif H%b==0:
    c+=1
  else:
    pass
print(c)

Python: H, A, B = map(int, input().split())
cnt = 0;
for i in range(A, B+1):
    cnt += (H % i == 0 )
print(cnt)

Python: H,A,B = [int(i) for i in input().split()]

cnt = 0
for i in range(A,B+1):
    if (H // i)*i == H:
        cnt = cnt + 1
print(cnt)

Python: H,A,B=map(int,input().split())
c=0

for i in range(A,B+1):
    if H%i==0:
        c+=1
        
print(c)

Python: H,a,b=map(int,input().split())
c=0
for i in range(a,b):
  if H%i==0 :
    c+=1
print(c)

Python: H, A, B = map(int, input().split())
ans = 0
for i in range(A, B+1) :
    if H % i == 0 :
        ans += 1
print(ans)

Python: #標準入力とカウンタ変数の初期化
a,b,c = map(int,input().split())
kei = 0

#割り切れるならカウンタ変数を更新する
for i in range(b,c + 1):
    if a % i == 0:kei += 1
    
#カウンタ変数を出力する
print(kei)

Python: H,A,B = map(int,input().split())
a = 0
for i in range(A,B+1):
    if H % i == 0:
        a += 1
print(a)

Python: H,A,B=map(int,input().split())
i=0
while  A<=B:
    if H%A==0:
        i=i+1
    A=A+1
print(i)

Python: h, a, b = map(int, input().split())

cnt = 0
for i in range(a, b+1):
    if h % i == 0:
        cnt += 1

print(cnt)

Python: h,a,b = map(int,input().split())

ans = 0
for i in range(a,b+1):
    if h%i == 0:
        ans += 1
print(ans)

Python: h, a, b = map(int, input().split())

num = 0
for i in range(a, b+1):
    if h % i == 0:
        num += 1

print(num)

Python: H, A, B = map(int, input().split())
ans = 0
for k in range(A, B+1):
    if H % k == 0:
        ans += 1
print(ans)

Python: 
h,a,b = map(int,input().split())

print(len([i for i in range(a,b+1) if h%i==0]))

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

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

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

C++: #include<stdio.h>

int main(){
  int h,a,b,temp,ans=0,i=0;
  scanf(" %d %d %d",&h,&a,&b);
  for(i = a;i<=b;i++){
    
    if(h % i == 0){
      ans++;
    }
  }
  printf("%d\n",ans);
      return 0;
}

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

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

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

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

C++: #include<iostream>
using namespace std;
int main() {
	int high, h, l,ans;
	ans = 0;
	cin >> high >> l >> h;
	for (int i = l; i <= h; i++) {
		if (high%i == 0) {
			ans = ans + 1;
		}
	}
	cout << ans << endl;
}

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

int main(){
	int h,a,b,ans=0;
	cin>>h>>a>>b;
	while(b!=a-1){
		if(h%b==0)ans++;
		b--;
	}
	cout<<ans<<endl;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


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

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

  cout << ans << endl;
  
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
  int a,b,c,d,h;
  cin>>h;
  cin>>a;
  cin>>b;
  c=0;
  for(int i=a;i<=b;i++){
    if(h%i==0)
      c=c+1;
  }
  cout<<c<<endl;
  return(0);
}

C++: #include<iostream>
#include<vector>
#include<set>
#include<algorithm>
#include<queue>
#include<utility>
#define LL long long
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 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>
#include <algorithm>
#include <string>
using namespace std;
#define int long long
signed main() {
	int h, a, b;
	cin >> h >> a >> b;
	int ans = 0;
	for (int i = a; i <= b; i++) 
		if (!(h%i))ans++;
	cout << ans << endl;
}

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

C++: #include<cassert>
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;
}

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++) ans += !(H % i);
    cout << ans << endl;
}

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

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>
#include<cmath>

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

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() {
    int h, a, b;
    cin >> h >> a >> b;

    int ret = 0;
    for (int i = a; i <= b; i++) {
        if (h % i == 0)ret++;
    }
    cout << ret << endl;
    return 0;
}