weixin_45050148的博客

1160 Forever (20 分)“Forever number” is a positive integer A with K digits, satisfying the following constrains:the sum of all the digits of A is m;the sum of all the digits of A+1 is n; andthe greatest common divisor of m and n is a prime number which

1129 Recommendation System (25 分)Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that rates the user’s preference by the number of times that an item has bee

1007 Maximum Subsequence Sum (25 分)Given a sequence of K integers { N1​, N2​, …, NK​}. A continuous subsequence is defined to be { Ni​, Ni+1​, …, Nj} where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its ele

1103 Integer Factorization (30 分)Sample Input 1:169 5 2结尾无空行Sample Output 1:169 = 6^2 + 6^2 + 6^2 + 6^2 + 5^2结尾无空行Sample Input 2:169 167 3结尾无空行Sample Output 2:Impossible结尾无空行代码如下#include<cstdio>#include<algorithm>#include<st

1052 Linked List Sorting (25 分)A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are

1059 Prime Factors (25 分)Given any positive integer N, you are supposed to find all of its prime factors, and write them in the formatN = p1​k1​*p2​k2​*…*pm​^km.Input Specification:Each input file contains one test case which gives a positive integer

1033 To Fill or Not to Fill (25 分)With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give di

1095 Cars on Campus (30 分)Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any s