[Solution] Strong Elements CodeChef Solution

[Solution] Strong Elements CodeChef Solution

Chef has an array A$A$ of length N$N$.

An index i$i$ is called strong if we can change the gcd of the whole array just by changing the value of Ai$A_i$.

Determine the number of strong indices in the array.

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.
• First line of each test case contains an integer N$N$ denoting the size of the array A$A$.

Solution Click Below:-  CLICK HERE

• Second line contains N$N$ space separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$ - denoting the array A$A$.

Output Format

For each test case, output the number of strong indices in the array.

Fitness CodeChef Solution

Complementary Strand in a DNA CodeChef Solution 

Make all equal using Pairs Codechef Solution

Count the ACs CodeChef Solution 

Strong Elements CodeChef Solution

Reversal Sorting CodeChef Solution

AP Grid CodeChef Solution

Gcd and Lcm CodeChef Solution

The Subarray XOR CodeChef Solution

Constraints

• 1≤T≤5⋅104$1\le T\le 5\cdot {10}^4$
• 2≤N≤3⋅105$2\le N\le 3\cdot {10}^5$