A. Buying Torches1000 / 贪心

Posted 2021-10-30 幽殇默

https://codeforces.com/problemset/problem/1418/A

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int LL;
int main(void)
{
	int t; cin>>t;
	while(t--)
	{
		LL x,y,k; cin>>x>>y>>k;
		LL sum=k*y+k;//总的木棒数 
		sum--,x--; //减去初始的1个，每次增加(x-1)根木棒 
		LL cnt=sum/x;
		if(sum%x) cnt++;
		cout<<cnt+k<<endl;
	}
	return 0;
}