UVA 11526 - H(n)
Problem PDF
Solution:
#include
#include
int main()
{
long long n,t,i,r;
int p;
scanf("%lld",&t);
while(t--)
{
scanf("%lld",&n);
r=0;
p=int(sqrt(n))+1;
for(i=1;ihttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11526/11526.cpp
