H(n) UVA - 11526

数学归纳法进行求解，关键是推导，大家可以参考这篇博客：http://blog.csdn.net/synapse7/article/details/12873437，讲的非常好，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

typedef long long LL;

LL Deal(LL n){
	LL up = sqrt(n);
	LL ans = 0;
	for (LL i = 1; i <= up; i++) ans += n / i;
	ans = (ans << 1) - up*up;
	return ans;
}

int main(){
	LL T;
	cin >> T;
	while (T--){
		LL n;
		cin >> n;
		cout << Deal(n) << endl;
	}
	return 0;
}