National Project CodeForces - 1303B

Your company was appointed to lay new asphalt on the highway of length nn. You know that every day you can either repair one unit of the highway (lay new asphalt over one unit of the highway) or skip repairing.

Skipping the repair is necessary because of the climate. The climate in your region is periodical: there are gg days when the climate is good and if you lay new asphalt these days it becomes high-quality pavement; after that, the weather during the next bb days is bad, and if you lay new asphalt these days it becomes low-quality pavement; again gg good days, bb bad days and so on.

You can be sure that you start repairing at the start of a good season, in other words, days 1,2,…,g1,2,…,g are good.

You don’t really care about the quality of the highway, you just want to make sure that at least half of the highway will have high-quality pavement. For example, if the n=5n=5 then at least 33 units of the highway should have high quality; if n=4n=4 then at least 22 units should have high quality.

What is the minimum number of days is needed to finish the repair of the highway?

Input
The first line contains a single integer TT (1≤T≤1041≤T≤104) — the number of test cases.

Next TT lines contain test cases — one per line. Each line contains three integers nn, gg and bb (1≤n,g,b≤1091≤n,g,b≤109) — the length of the highway and the number of good and bad days respectively.

Output
Print TT integers — one per test case. For each test case, print the minimum number of days required to repair the highway if at least half of it should have high quality.

Example
Input
3
5 1 1
8 10 10
1000000 1 1000000
Output
5
8
499999500000
Note
In the first test case, you can just lay new asphalt each day, since days 1,3,51,3,5 are good.

In the second test case, you can also lay new asphalt each day, since days 11-88 are good.
一道计算题。
只考虑高质量的道路用多少天就行，剩下的就相减。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

ll n,g,b;

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		cin>>n>>g>>b;
		if(n<=g) cout<<n<<endl;
		else
		{
			ll m=(n+1)>>1;
			ll y=m%g;
			ll x=m/g;
			if(y==0) x-=1;
			cout<<(x*(g+b)+(y==0?g:y))+(n-m-(b*x)>0?n-m-(b*x):0)<<endl;
		}
	}
	return 0;
}

努力加油a啊，(^o)/~