Codeforces-SolutionsA/Codes/1765 E - Exchange/1765E.cpp
2024-05-08 23:00:54 +06:00

26 lines
531 B
C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr));
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
ll n,a,b;
cin>>n>>a>>b;
if(a>b) cout<<1<<endl;
else cout<<(n+a-1)/a<<endl;
}
signed main()
{
FAST;
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}