【 Codeforces Round #596 [Div. 2] D. Power Products】

【 Codeforces Round #596 [Div. 2] D. Power Products】 Description You are given n positive integers a1,…,an, and an integer k≥2. Count the number of pairs i,j such that 1≤i<j≤n, and there exists an inte

>>阅读原文<<