洛谷 1291 [SHOI2002]百事世界杯之旅

题目：https://www.luogu.org/problemnew/show/P1291

大水题！套路！模板！

稍微注意一下输出就行了。

#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;
const ll N=;
ll n,a[N],b[N];
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll solve(ll a)
{
    ll ret=;while(a)ret++,a/=;return ret;
}
int main()
{
    scanf("%lld",&n);
    a[n-]=n;b[n-]=;
    for(ll i=n-;i>=;i--)
    {
        b[i]=b[i+]*(n-i);
        a[i]=a[i+]*(n-i)+n*b[i+];
        ll d=gcd(a[i],b[i]);
        a[i]/=d;b[i]/=d;
    }
    ll c=a[]/b[];a[]%=b[];
    if(!a[])
    {
        printf("%lld",c);return ;
    }
    ll k=solve(c);
    for(ll i=;i<=k;i++)printf(" ");printf("%lld\n",a[]);
    ll d=solve(b[]);
    if(c)printf("%lld",c);
    for(ll i=;i<=d;i++)printf("-");printf("\n");
    for(ll i=;i<=k;i++)printf(" ");printf("%lld",b[]);
    return ;
}