Submission #33621735

---

Source Code Expand

#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}

int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	LL n,A,B; cin>>n>>A>>B;
	if (A<=B){
		cout<<max(0ll,n-A+1)<<"\n";
		return 0; 
	}
	LL d=n/A,p=d*A;
//	cerr<<p<<" "<<n<<" "<<d*B<<" "<<n%A<<" ???\n";
	LL ans=d*B+min(p+B-1,n)-p+1;
	cout<<max(0ll,ans-B)<<"\n";
	
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Submission Info

Judge Result