Given an array of natural numbers count the sum of its proper divisors for every element in the array.
The first line of the input contains an integer T which denotes the number of test cases to follow. Each test case contains the number of elements in the array a as n and next line contains space separated n elements in the array.
Print an array of n integers ith of which represents the sum of divisors of the ith number in the array.
1 <= T <= 100
1 <= n <= 100
1 <= a[i] <= 1000
8 13 24 36 59 75 87
7 1 36 55 1 49 33
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.