[Solution] The Optimal Pairs CodeChef Solution | CodeChef Problem Solution 2022

[Solution] The Optimal Pairs CodeChef Solution | CodeChef Problem Solution 2022

For two positive integers a$a$ and b$b$, let g(a,b)=$g(a,b)=$ gcd (a,b)+$(a,b)+$ lcm(a,b)$(a,b)$.

For a positive integer N$N$, let f(N)$f(N)$ denote the minimum value of g(a,b)$g(a,b)$ over all the pairs of positive integers (a,b)$(a,b)$ such that a+b=N$a+b=N$.

Find out the number of ordered pairs (a,b)$(a,b)$ such that a+b=N$a+b=N$ and g(a,b)=f(N)$g(a,b)=f(N)$.

Input Format

• The first line of input will contain an integer T$T$ — the number of test cases. The description of T$T$ test cases follows.

Solution Click Below:-  CLICK HERE

• The first and only line of each test case contains a positive integer N$N$.

Output Format

For each test case, output the number of ordered pairs (a,b)$(a,b)$ such that a+b=N$a+b=N$ and g(a,b)=f(N)$g(a,b)=f(N)$.

Burgers CodeChef Solution

Waiting Time CodeChef Solution

DNA Storage CodeChef Solution

Joining Date CodeChef Solution

Distinct Palindrome CodeChef Solution

The Optimal Pairs CodeChef Solution

Make them Equal CodeChef Solution

Permutation AND CodeChef Solution

Constraints

• 1≤T≤100$1\le T\le 100$
• 2≤N≤109