AtCoder Beginner Contest 158 B Count Balls

B - Count Balls

题目链接-B - Count Balls



题目大意
给你一个由$n$个小球组成的序列，先放$a$个蓝色球，再放$b$个红色球，如此循环，求该序列中有几个蓝球
解题思路

• 先计算序列中有几个循环序列，计算这几个循环序列中有几个蓝球，所以答案为a(n/(a+b))+min(a,n%(a+b))
• 具体操作见代码

附上代码

#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
#define int long long
#define lowbit(x) (x &(-x))
#define endl '\n'
using namespace std;
const int INF=0x3f3f3f3f;
const int dir[4][2]={-1,0,1,0,0,-1,0,1};
const double PI=acos(-1.0);
const double e=exp(1.0);
const double eps=1e-10;
const int M=1e9+7;
const int N=2e5+10;
typedef long long ll;
typedef pair<int,int> PII;
typedef unsigned long long ull;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);

	int n,a,b;
	cin>>n>>a>>b;
	int ans=n/(a+b)*a;
	ans+=min(a,n%(a+b));
	cout<<ans<<endl;
	return 0;
}