摘要：
其实我认识ubuntu也有一段时间了，只是我一直沉迷Windows无法自拔，但是熟悉一下ubuntu的环境对于各项比赛以及今后的工作还是很有用处的，不过在未来的很长一段时间里，我只会以一个普通用户的身份去看待这个系统，所以我的博客里面，将会出现较多的有关ubuntu的水帖。 首先第一点就是如何修改系 阅读全文
摘要：
Lele now is thinking about a simple function f(x). If x < 10 f(x) = x. If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10); 阅读全文
摘要：
In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the quest 阅读全文
摘要：
Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak. Given a n × n matrix A and a positive integer k, find the sum 阅读全文
摘要：
A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the v 阅读全文
摘要：
You have a rooted tree consisting of n vertices. Each vertex of the tree has some color. We will assume that the tree vertices are numbered by integer 阅读全文
摘要：
Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li and ri and asks you to count the 阅读全文
摘要：
There are nn apples on a tree, numbered from 11 to nn. Count the number of ways to pick at most mm apples. Input The first line of the input contains 阅读全文
摘要：
The Little Elephant loves playing with arrays. He has array a, consisting of npositive integers, indexed from 1 to n. Let's denote the number with ind 阅读全文
摘要：
Pushok the dog has been chasing Imp for a few hours already. Fortunately, Imp knows that Pushok is afraid of a robot vacuum cleaner. While moving, the 阅读全文