Submit | All submissions | Best solutions | Back to list |
Problem hidden
NUM03 - Kidding Divisiors |
You are given a number.Findout its all divisiors.If there are a number 10,its all divisiors are 1,2,5,10.
Input
The first line will contain t<=25 ,number of test cases.
Each line will contain a digit n <= 10^14 .
The input file is too larger!! Use faster I/O.
Output
Print all the divisiors of each digit in ascending order.There will be a space between two divisiors.
Print a newline between two output.
Example
Input: 3
10
12
16 Output: Case 1: 1 2 5 10
Case 2: 1 2 3 4 6 12
Case 3: 1 2 4 8 16
Added by: | Ruhul |
Date: | 2019-09-15 |
Time limit: | 1s-5s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |