hdu1099

//求n/n+n/(n-1)+…+n/2+n/1的真分数

#include <stdio.h>
#include <math.h>
long long gcd(long long a,long long b)
{
    if(b==0)
        return a;
    return gcd(b,a%b);
}
int leng(long long x)
{
    int num=0;
    while(x!=0)
    {
        x=x/10;
        num++;
    }
    return num;
}
int main()
{
    int i,n;
    long long a[23];
    a[1]=1;
    for(i=2; i<=22; i++)
        a[i]=a[i-1]*i/gcd(a[i-1],i);
    while(scanf("%d",&n)!=EOF)
    {
        long long fengzi=0,fengmu,zhengshu,GCD;
        for(i=1; i<=n; i++)
            fengzi+=a[n]/i;
        fengzi*=n;
        fengmu=a[n];
        zhengshu=fengzi/fengmu;
        fengzi=fengzi%fengmu;
        GCD=gcd(fengzi,fengmu);
        fengzi=fengzi/GCD;
        fengmu=fengmu/GCD;
        if(fengzi==0)
            printf("%lld\n",zhengshu);
        else
        {
            int l1,l2,l3;
            l1=leng(zhengshu);
            l2=leng(fengzi);
            l3=leng(fengmu);
            for(i=1; i<=l1+1; i++)
                printf(" ");
            printf("%lld\n",fengzi);
            printf("%lld ",zhengshu);
            for(i=1; i<l3; i++)
                printf("-");
            printf("-\n");
            for(i=1; i<=l1+1; i++)
                printf(" ");
            printf("%lld\n",fengmu);
        }
    }
    return 0;
}