Computer Science, asked by adepuveena, 8 months ago

Co Prime
Calculate the number of pair of divisors of a number that are co-prime.
Input Format
First line contains the number of test cases T.
The next line contains a number N.
Constraints
1<=N<= 10^6
1<=T<= 10^6
Output Format
For each test case print the number of pairs in a new line.
Sample Input
Sample Output
4
1
6​

Answers

Answered by kanishkarb3
0

Answer:

The first line contains two integers, N and Q, denoting the size of array A and number of

queries. The second line contains N space separated integers, denoting the array o

Similar questions