2014清华大学计算机编程邀请赛试题.docxVIP

Problem S1: Lucky Digit时间限制：1.0s 内存限制：256.0MB 问题描述　Digit K is Kristoff’s lucky digit! Consequently, for every integer N, he wants to know what is the number d (2 ≤ d ≤ 10) such that the base d representation of N ends with the largest number of the digit K’s.　Given N and K, please write a program to help Kristoff find the desired base d.　For example, suppose Kristoff’s lucky digit is 0, and he is given an integer 8, then d would be 2. Since the base-2 (i.e., binary) representation of 8 is (1000)2 with 3 trailing zeroes, while the number 8 in any other base would have no or fewer trailing zeroes. Your program should print 3 in this case.输入格式　The first and only line contains two integers, N (0 ≤ N ≤ 1011) and K(0 ≤ K ≤ 9).输出格式　Print one line containing one integer, the maximum number of trailing lucky numbers.样例输入49 1样例输出2样例输入7 5样例输出0Problem S2: Summation时间限制：1.0s 内存限制：256.0MB 问题描述　Given three integers A, K, P, you are asked to calculate the value of the following summation.输入格式　The first and only line of the input contains 3 integers, A (0 ≤ A ≤ 108), K(1 ≤ K ≤ 1016) and P (1 ≤ P ≤ 108), separated by a space.　In 20% of the test cases, K is no larger than 10000.　In 50% of the test cases, P is a prime number and no larger than输出格式　The only line in the output contains a single integer, the value of the summation.样例输入3 4 101样例输出19Problem S3: Magic Rocks时间限制：1.0s 内存限制：256.0MB 问题描述　When Olaf was walking in the forest, he stumbled upon a sequence of N colored rocks. He noticed that if he touched K or more consecutive rocks of the same color, they would twinkle and then vanish.　Olaf would like all the rocks to vanish. Consequently, he brought along an inexhaustible supply of rocks, so that he can insert any number of rocks of any colors anywhere in the sequence.　Please help Olaf find the smallest number of rocks he must insert into the sequence before he could make all the rocks vanish, including those inserted by himself.输入格式　The first line contains two integers N