G(暴力)
https://vjudge.net/contest/486891#problem/G
题目要求:k从1到m 输出m行,每行输出 ∏ i = 1 n C k a i \prod_{i=1}^{n}C_{k}^{a_i} ∏i=1nCkai
数据范围: 1 ≤ n , m ≤ 5 ⋅ 1 0 4 , 0 ≤ a i ≤ 1 0 5 , ∑ i = 1 n a i ≤ 1 0 5 1\leq n,m \leq 5 \cdot 10^4 , 0 \leq a_i \leq 10^5 , \sum_{i=1}^{n} a_i \leq 10^5 1≤n,m≤5⋅104,0≤ai≤105,∑i=1nai≤105
思路:看到纯纯暴力的时间复杂度是 O ( n m ) O(nm) O(nm),显然暴时间,注意到 a i a_i ai,可以知道,要么 a i a_i ai有许多重复的数,要么 a i a_i ai最多有 1 0 5 \sqrt{10^5} 105