ccsu_cherish

题目是求f(n)mod10000以后的斐波那契数，n的范围是0矩阵相乘求斐波那契： 在二分的函数那里要注意的几点就是：当(n-1)为偶数进行二分以后，要返回单位矩阵，(n-1)为奇数就范围[1,1,1,0];而为什么当此时的n为奇数的时候要进行一次矩阵相乘的运算呢？可以举个例子：二分(n-1)=7: 7->3->1 。当为1以后return到上一次的调用函数，此时进行矩

This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, ... , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and then, to draw some straight

题解：此题鸽巢原理证明出自：http://blog.csdn.net/hnust_xiehonghao/article/details/8005832鸽巢原理1.把某种糖果看做隔板,如果某种糖果有n个,那么就有n+1块区域,至少需要n-1块其他种糖果才能使得所有隔板不挨在一块..也就是说能吃完这种糖果.至少需要其他种类糖果n-1块..(鸽巢原理)2.数量最多的糖

There is a square painted on a piece of paper, the square's side equals n meters. John Doe draws crosses on the square's perimeter. John paints the first cross in the lower left corner of the square

A boy Petya loves chess very much. He even came up with a chess piece of his own, a semiknight. The semiknight can move in any of these four directions: 2 squares forward and 2 squares to the ri

An important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and that life would not matter at all without

Gerald has been selling state secrets at leisure. All the secrets cost the same: n marks. The state which secrets Gerald is selling, has no paper money, only coins. But there are coins of all positive

Gerald is very particular to eight point sets. He thinks that any decent eight point set must consist of all pairwise intersections of three distinct integer vertical straight lines and three distinct

Gerald has n younger brothers and their number happens to be even. One day he bought n2 candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for

Given a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said to be coprime to B if A, B share no common positive divisors ex

筛选法求素数当数据量比较大时候，判素数的方法是会超时的，我们将前面的那道例题改造一下，变成下面这个题目：桐桐的思考桐桐在学完了上节课的知识后，对信息学越发感兴趣了。桐桐是一个很善于思考的学生，她发现上节课中例题的n最大是40000，如果数据再大一些，比如n=106，那么判素数的算法能否在1秒内给出答案呢？桐桐用程序实际测试的时间超过了1秒，你能帮助可爱的桐桐解决这个难题吗？即：在1秒的

People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e., 1-credit coins, 4-cre