AFS / Amazing Factor Sequence

[equation_sof]

my n/2 complexity solution giving tle ...
somebody please help..

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
    long long int n,sum=0;
    scanf("%lld",&n);
    for(int i=2;i<=n/2;i++){
            sum+=((n/i)-1)*i;
            }
    sum+=n-1;
    printf("%lld\n",sum);
    } 
return 0;
}

[leppyr64]

O(t*n/2) should get close to TLE.

As a general rule, division is a very slow operation. The conditional of a for loop will be evaluated during every iteration.