For this Question: There is a function F defined as,
F(x) = GCD(1, x) + GCD(2, x) +. . + GCD(x, x)
Your task is to find F(x), for the given x.First line contain integer T denoting number of test cases.
Next t lines contain an integer x. 

Constraints 
1 <= T <= 20000
1 <= x <= 100000For each test case print F(n) in separate lineSample Input
5
1
2
3
4
5

Sample output
1
3
5
8
9, I have written this Solution Code: #include<iostream>
#include<string>
#include<vector>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<set>
#include<climits>

using namespace std;
#define mod 1000000007
#define MAX 100000
void fast(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

vector < int > phi(MAX+1);
vector <long long > result(MAX+1);
void euler_totient(){
    for(int i = 1 ; i <= MAX ; i++)     phi[i] = i;

    for(long long  i = 2 ; i <= MAX ; i++){
        if(phi[i] == i){
            for(long long  j = i ; j <= MAX ; j += i){
                phi[j]/=i;
				phi[j]*=(i-1);
            }
        }
    }
}

void precalc(){

    for(int i = 1 ; i <= MAX ; i++){
        result[i] = i ;
    }

    for(int i = 1 ; i <= MAX ; i++){
        for(int j = 2 ; j*i <= MAX ; j++){
            result[i*j] += i*phi[j];
        }
    }
}

int main(){
    fast();
    euler_totient();
    precalc();

    int t;cin>>t;
    while(t--){
        int n;cin>>n;
        cout<<result[n]<<"\n";
    }

}, In this Programming Language: C++, Now tell me if this Code is compilable or not?