题解 | #分蛋糕#

#include<iostream>
using namespace std;
#define int long long
__int128 ll;
__int128 gcd(__int128 a,__int128 b)
{
    return b==0?a:gcd(b,a%b);
}
void dfs(__int128 x) {
    int tt = x%10;
    if(x/10>0)
    dfs(x/10);
    cout<<tt;
}
signed main() {
    
    int n,m;
    cin>>n>>m;
    __int128 up = m,down = 1;
    for(int i=1;i<=m-1;i++)
        down = down * n;
    __int128 g = gcd(up,down);
    __int128 d = down/g;
    __int128 u = up/g;
    dfs(u);
    cout<<"/";
    dfs(d);
    return 0;
}