Anmol And Divisors
Practice
3 (6 votes)
Easy Medium
Problem
62% Success 2995 Attempts 30 Points 1s Time Limit 256MB Memory 1024 KB Max Code
Anmol is very found of divisors . He has recently got a list of numbers from Satyam. So he want to find all the divisors of those numbers and print them in ascending order. Please help Anmol.
Note->Anmol doesn't consider 1 and that number itself as divisor of the number
Input
First line contains a number t number of test cases.
t lines follows each containing a number ai.
Output
Print t lines divisor of ith number in ith line.
Constraints
\( t \le 1000 \)
\( ai \le 100000000000000 \)
Submissions
Please login to view your submissions
Similar Problems
Points:30
1 votes
Tags:
Dynamic ProgrammingPrime FactorizationEasy-MediumMathematicsGame TheoryFactorization
Points:30
1 votes
Tags:
Hash functionData StructuresEasy-MediumMathematicsapprovedFactorization
Points:30
11 votes
Tags:
Prime FactorizationEasy-MediumMathematics
Editorial
No editorial available for this problem.