2016年7月20日
GCD
摘要： GCD Problem Description Give you a sequence of N(N≤100,000) integers : a1,...,an(0<ai≤1000,000,000). There are Q(Q≤100,000) queries. For each query l, 阅读全文
posted @ 2016-07-20 19:15 mxzf0213 阅读(191) 评论(0) 推荐(0)
Fix a Tree
摘要： Fix a Tree A tree is an undirected connected graph without cycles. Let's consider a rooted undirected tree with n vertices, numbered 1 through n. Ther 阅读全文
posted @ 2016-07-20 09:46 mxzf0213 阅读(235) 评论(0) 推荐(0)
Vacations
摘要： Vacations Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this 阅读全文
posted @ 2016-07-20 09:37 mxzf0213 阅读(407) 评论(0) 推荐(0)
One Bomb
摘要： One Bomb time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One Bomb time limit per test 1 s 阅读全文
posted @ 2016-07-20 09:30 mxzf0213 阅读(193) 评论(0) 推荐(0)