C# 代码
public class Solution {
public int CountBeautifulPairs(int[] nums) {
int n = nums.Length, result = 0;
int[] count = new int[10];
for (int i = 0; i < n; i++){
for (int j = 0; j < 10; j++){
if (GCD(nums[i] % 10, j) == 1){
result += count[j];
}
}
int x = nums[i];
while (x >= 10) x /= 10;
count[x]++;
}
return result;
int GCD(int a, int b){
return b > 0 ? GCD(b, a % b) : a;
}
}
}