Live2d Test Env
2018年5月17日
SPOJ：K-Query Online（归并树）
摘要： 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), 阅读全文
posted @ 2018-05-17 22:55 nimphy 阅读(385) 评论(2) 推荐(0)
SPOJ:Easy Factorials(占位)
摘要： 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 阅读全文
posted @ 2018-05-17 10:04 nimphy 阅读(129) 评论(0) 推荐(0)