CodeForces - 893 Educational Codeforces Round 33

A, B, C三个小伙伴玩象棋

# 2 B - Beautiful Divisors CodeForces - 893B

## 2.1 题目大意

More formally, the number is beautiful iff there exists some positive integer k such that the number is equal to $(2^k - 1) * (2^{k - 1})$.

# 5 E - Counting Arrays CodeForces - 893E

## 5.1 题目大意

q次询问

$y_i$个数的乘积为$x_i$的情况下，共用多少种排列情况

1341ms 48700kB