版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_42369449/article/details/83031693
简述题意:
算法:数学
难度:NOIP
简述题解:
代码如下:
#include <iostream>
#include <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
ll n,m;
ll dfs(ll x)
{
if(x==1) return 1;
return m*(dfs(x/m+x%m)-x%m);
}
int main()
{
//freopen("joseph.in","r",stdin);
//freopen("joseph.out","w",stdout);
scanf("%I64d%I64d",&n,&m);
printf("%I64d\n",dfs(n));
return 0 ;
}