摘要： Problem Description 七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2,3,4,6.你想知道你的另一半吗? Input 输入数据的第一行是一个数字T(1#includeusing namespace std;void main(){ int n; int a; cin>>n; for(int i=0;i>a; int s 阅读全文

摘要： Problem Description一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等),才能使p人或者q人出席的任何一种情况,都能平均将蛋糕分食. Input 每行有两个数p和q. Output 输出最少要将蛋糕切成多少块. Sample Input2 3 Sample Output4Hint将蛋糕切成大小分别为1/3,1/3,1/6,1/6的四块即满足要求. 当2个人来时，每人可以吃1/3+1/6=1/2 , 1/2块。 当3个人... 阅读全文

摘要： 求两个数的最大公约数的方法（1）用短除法求两个数的最大公约数，一般先用这两个数公有的质因数连续去除，一直除到所得的商是互质数为止，然后把所有的除数连乘起来，在除的过程中，有时也可以用两个数的公约数去除。（2）求两个数的最大公约数的两种特殊情况：①如果这两个数存在着倍数关系（即较大数是较小数的倍数），那么，较小数就是这两个数的最大公约数；②如果两个数是互质数，那么它们的最大公约数就是1。 两个数求最大公约数，可以用辗转相除法。始终用较大数除以较小数，然后用余数代替较大数。整除时的除数就是最大公约数。举例：222 407求最大公约数：222 407（407除以222余数185)222 185(.. 阅读全文

摘要： Problem Description “Point, point, life of student!”This is a ballad（歌谣）well known in colleges, and you must care about your score in this exam too. How many points can you get? Now, I told you the rules which are used in this course.There are 5 problems in this final exam. And I will give you 100 p 阅读全文

摘要： Problem Description Ray又对数字的列产生了兴趣：现有四张卡片，用这四张卡片能排列出很多不同的4位数，要求按从小到大的顺序输出这些4位数。 Input 每组数据占一行，代表四张卡片上的数字（0void Sort(int *a,int n){ int temp; int tem; for(int i=0;ia[j]) { temp=a[j]; tem=j; } } a[tem]=a[i]; a[i]=temp; }}void F(int a[4],int b[4],int d)//d的范围【0,4】{ int visi... 阅读全文

摘要： Problem Description Here is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and others.""Both of Tian and the king have three horses in different classes, namely, regul 阅读全文

摘要： Problem Description Uniform Resource Identifiers (or URIs) are strings like http://icpc.baylor.edu/icpc/, mailto:foo@bar.org, ftp://127.0.0.1/pub/linux, or even just readme.txt that are used to identify a resource, usually on the Internet or a local computer. Certain characters are reserved within U 阅读全文

摘要： Problem Description The Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.Now I introduce the game to you. Suppose there are N people played the game ,who sit ... 阅读全文