arc60 D - Digit Sum

D - Digit Sum

问题就是找到最小的进制b，使得n在b进制下各个数位求和等于s

看到这个数据范围就基本上往根号算法上去想，显然如果进制b小于根号，暴力一下；大于根号，那么一定是只有一位数，且这个数小于根号，枚举这个数即可（代码之前好像写得有点蠢，搞了个整除分块）。

注意还要判断一下b取n + 1时，可以得到最大的s = n

#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define sc second
#define pb push_back
#define ll long long
#define trav(v,x) for(auto v:x)
#define all(x) (x).begin(), (x).end()
#define VI vector<int>
#define VLL vector<ll>
#define pll pair<ll, ll>
#define double long double
//#define int long long
using namespace std;
const int N = 1e6 + 100;
const int inf = 1e9;
//const ll inf = 1e18;
const ll mod = 998244353;//1e9 + 7;

#ifdef LOCAL
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
	cerr << " " << to_string(H);
	debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

void sol()
{
	ll n, m;
	cin >> n >> m;
	ll B = sqrt(n);
	for(ll b = 2; b <= B; b++)
	{
		ll nw = n, res = 0;
		while(nw)
		{
			res += nw % b;
			nw /= b;
		}
		if(res == m)
			return (void)(cout << b << '\n');
	}
	for(ll l = B + 1, r; l <= n; l = r + 1)
	{
		ll val = n / l;
		r = n / val;
		ll need = m - val;
		if(need < 0)
			continue;
		ll res = (n - need) / val;
		if(res == 0)
			continue;
		if(n / res != val)
			continue;
		if(n / res + (n % res) == m)
		{
			return (void)(cout << res << '\n');
		}
	}
	if(n == m)
		cout << n + 1 << '\n';
	else
		cout << -1 << '\n';
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
//	int tt;
//	cin >> tt;
//	while(tt--)
		sol();
}