摘要：
Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci s 阅读全文
摘要：
题目描述 一个吉他手准备参加一场演出。他不喜欢在演出时始终使用同一个音量，所以他决定每一首歌之前他都需要改变一次音量。在演出开始之前，他已经做好一个列表，里面写着每首歌开始之前他想要改变的音量是多少。每一次改变音量，他可以选择调高也可以调低。 音量用一个整数描述。输入文件中整数beginLevel， 阅读全文
摘要：
题目描述 Farmer John's N (1 <= N <= 100,000) cows are lined up in a row and numbered 1..N. The cows are conducting another one of their strange protests, 阅读全文
摘要：
http://codeforces.com/problemset/problem/936/D Vitya loves programming and problem solving, but sometimes, to distract himself a little, he plays comp 阅读全文
摘要：
http://codeforces.com/problemset/problem/946/D Ivan is a student at Berland State University (BSU). There are n days in Berland week, and each of thes 阅读全文