Codeforces Round #673 (Div. 2) A.Copy-paste

题意：
问在保持每个数都小于等于k的情况下，最多能执行多少步a[j] += a[i] ，其中（i，j）为任意不同下标。
题解：
排序，将a[1]加到别的值上能加多少次
code:

#include<bits/stdc++.h>
 
#pragma GCC optimize(2)
#define rep(i,a,n) for (int i=a;i<=n;i++)//i为循环变量，a为初始值，n为界限值，递增
#define per(i,a,n) for (int i=a;i>=n;i--)//i为循环变量， a为初始值，n为界限值，递减。
 
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
const int INF = 0x3f3f3f3f;
const ll LINF = 1ll<<60;
const int mod=1e9+7;
 
ll read()//快读
{
	ll w = 1, s = 0;
	char ch = getchar();
	while (ch < '0' || ch>'9') { if (ch == '-') w = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { s = s * 10 + ch - '0';    ch = getchar(); }
	return s * w;
}
void solve(){
	ll n,k,a[1010];
	cin>>n>>k;
	rep(i,1,n) cin>>a[i];
	sort(a+1,a+1+n);
	ll ans=0;
	rep(i,2,n){
		ll d=k-a[i];
		if(d>=0) ans+=d/a[1];
	}
	cout<<ans<<endl;
 
}
 
int main(){
	int _;
	cin>>_;
	while(_--) solve();
 
    return 0;
}