TLE chef and interview (second subtask)

Hello!! Any body can help me?
My code is working well for the first subtask:

1 ≤ T ≤ 100
1 ≤ N ≤ 10^5

So I declare T as int and N as long long where T is the number of test cases and N is the number to evaluate. so for example, if T=1000 maybe I need catch 1000 long long numbers. So I’m doing that as follow:

unsigned long long n;

It works well but the problem appear for the second subtask:

1 ≤ T ≤ 1000
1 ≤ N ≤ 10^9

It shows TLE and I don’t understand. My code expend 0.00 seconds for the first task.
Is any other faster way to caths long long numbers? Thanks alot.


i guess u must improve your algorithm in some other way … That’s all i can say… Good luck!