摘要：
Given a sequence of n numbers a1, a2, ..., an and a number of k-queries. A k-query is a triple (i, j, k) (1 ≤ i ≤ j ≤ n). For each k-query (i, j, k), 阅读全文
摘要：
Finding factorials are easy but they become large quickly that is why Lucky hate factorials. Today he have another task related to factorials. For a g 阅读全文