[solved]-Time Limit Exceeding Large Value N Want Effcient Code C Java Q39030671

My time limit is exceeding forlarge value of N. I want an effcient code in c or java

Divine Divisors – Problem Description Given a number’n’, find all the possible divisors and print them in increasing order. – Constraints 1 <= T <= 15 1<= N <= 10^15. – Input Format First line contains a single integer T denoting the number of test cases. Each test case consists of a line containing an integer N. – Output For each test case print a line containing all the divisors in increasing order separated by space. – Test Case – Explanation Example 1 Input 10 Output 12510 Show transcribed image text Divine Divisors – Problem Description Given a number’n’, find all the possible divisors and print them in increasing order. – Constraints 1

Expert Answer

---

Answer to My time limit is exceeding for large value of N. I want an effcient code in c or java… . . .