#include<stdio.h> int main() { int t; scanf("%d",&t); while(t--) { int i,j; long long int s=0; scanf("%d",&i); for(j=1;j<=i;j=j+2) { s=s+j; } printf("%lld\n",s); } return 0; }
Asked by: Manish_Kumar_Savita on April 7, 2019, 6:34 p.m. Last updated on April 7, 2019, 6:34 p.m.
See the constraints, T is 10^5 and N is 10^8
T*N is 10^13. Therefore, your solution will get TLE. Think of a logic where for each N, you get your answer in O(1). Then your answer will have time complexity of O(T) ~ 10^5 which will easily pass. May be you need some kind of pre-computation.
In this kind of questions, write some values of N and corresponding answers to it. May be you will observe a pattern or some formula or requirement of some pre-computation.