Run ID:87162
提交时间:2024-08-04 14:28:43
from math import gcd def calculate_simplified_fractions(numbers): # 去重并排序,确保列表是有序的 numbers = sorted(set(numbers)) # 初始化最简真分数的计数器 count = 0 # 只遍历到列表长度的一半,因为分子必须小于分母 for i in range(len(numbers)): for j in range(i + 1, len(numbers)): # 检查当前的分子和分母是否构成最简真分数 if gcd(numbers[i], numbers[j]) == 1: count += 1 return count # 读取整数个数n和整数列表 n = int(input("Enter the number of integers: ")) numbers = list(map(int, input("Enter the integers separated by space: ").split())) # 调用函数并输出最简真分数的个数 print(calculate_simplified_fractions(numbers))