Lightoj 1245 Math problems, finding patterns

1. Lightoj 1245 Harmonic Number (II) math problem

2, Summary: Read the problem, very rigorous, but it is really disgusting

Test instructions: Beg n/1+n/2+....+n/n,n<=2^31.

#include <iostream>#include<cstring>#include<cmath>#include<queue>#include<algorithm>#include<cstdio>#defineMax (A, b) a>b?a:b#defineF (I,A,B) for (int i=a;i<=b;i++)#defineMes (A, b) memset (A,b,sizeof (a))#defineINF 0x3f3f3f3f#defineLL Long Longusing namespacestd;Const intn=10010, max=1000100; ll Har (ll N) {ll sum=0, sq=sqrt (n); F (i,1, SQ) {Sum=sum+ (n/i-n/(i+1)) *i+n/i;//Disgusting to fry    }    if(SQ==N/SQ) {//Notesum-=sq; }    returnsum;}intMain () {intT;    LL N; scanf ("%d",&t); F (CAS,1, T) {scanf ("%lld",&N); printf ("Case %d:%lld\n", Cas,har (n)); }    return 0;}

View Code

Lightoj 1245 Math problems, finding patterns