Shipu's Blog

UVA 11526 - H(n)

Shipu Ahamed -

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;i
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11526/11526.cpp