UVa : 11526 (H(n))


// http://uva.onlinejudge.org/external/115/11526.html

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <math.h>
#define pi acos(-1.0)
#define N 1000000
using namespace std;


int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        long long n;
        cin >> n;

        if ( n < 1 ) {
            printf ("0\n");
            continue;
        }

        long long length = (long long) sqrt (n);
        long long lastQuo;
        long long prevQuo = n;
        long long sum = 0;
        int i;

        for ( i = 1; i <= length; i++ ) {
            lastQuo = n / i;
            sum += lastQuo;
            sum += (prevQuo - lastQuo) * (i - 1);
            prevQuo = lastQuo;
        }

        if ( prevQuo > length )
            sum += length;

        cout << sum << endl;
    }

    return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s