vijos——1214伤心的AsukaNoKaze

https://vijos.org/p/1214
原题http://blog.csdn.net/largecub233/article/details/65628216
然后有大佬改编了一下；
蒟蒻：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define Ll long long
using namespace std;
Ll ans,zz;
Ll n,m,S,E,L;
int main()
{
    while(1){
        scanf("%lld",&m);
        if(!m)return 0;
        ans=0; 
        S=m;
        while(S){
            int k=m/S;
            E=m/(k+1)+1;
            ans+=k*(S-E+1);
            S=E-1;
        }
        printf("%lld ",ans);
        S=n=m; ans=0; zz=0;
        for(int i=n/m;i<n;){
            E=n/(i+1)+1;
            L=S-E+1;
            S=n%S;
            E=S+i*(L-1);
            ans+=(S+E)*L/2;
            i++;
            S=n/i;
            i=n/S;
        }
        printf("%lld\n",ans);
    }
}

大佬
http://blog.csdn.net/fop_zz/article/details/70597595

int main()
{
    ll n;
    while(1)
    {
        scanf("%d",&n);
        if(n==0)    break;
        ans1=0,ans2=0;
        ll tot=0;
        For(i,1,sqrt(n)-1)
        {
            ll t=n/i-n/(i+1);

            tot+=t;
            ans1+=(i*(t-1)+2*(n%i))*t/2;
            ans2+=i*t; 
        }
        For(i,1,n-tot)
            ans1+=n%i,ans2+=n/i;
        printf("%lld %lld\n",ans2,ans1);
    }
}