LiuXingLong

Font Size: ← →Problem Description任何一个有理数都可以表示成M/N的形式（M,N均为正整数）。例如1/2,2/4,3/6都是等值的有理数。给定若干有理数，等值有理数的值只能算一个，问这些有理数含有多少个值，并按从小到大输出各值及该值的有理数个数。Input第一行是整数n,表示随后有n组测试数据（n不超过10）。每一组测试数据的第一行是一个整数

Romantic Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 36   Accepted Submission(s) : 11Font: Times New Roman | Verdana |Georgia Font S

A/B Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 22   Accepted Submission(s) : 17Font: Times New Roman | Verdana |Georgia Font Size:

GCD Again Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 43   Accepted Submission(s) : 19Font: Times New Roman | Verdana |Georgia Font

找新朋友 Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 79   Accepted Submission(s) : 39Font: Times New Roman | Verdana |Georgia Font Size:

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 129850    Accepted Submission(s): 30095Problem DescriptionGiven a sequence a[

Can you solve this equation?Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 19   Accepted Submission(s) : 8Font: Times New Roman | Verdana |

汉诺塔 X Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ← →

Problem DescriptionXinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the first three numbers of e

Font Size: ← →Problem Description求A^B的最后三位数表示的整数。说明：A^B的含义是“A的B次方” Input输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1Output对于每个测试实例，请输出A^B的最后三位表示的整数，每个输出占一行。Sample Input2 312 66789 1000

Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At eac

Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as

Font Size: ← →Problem DescriptionWe all love recursion!  Don't we?Consider a three-parameter recursive function w(a, b, c):if a   1if a > 20 or b > 20 or c > 20, then w(a, b, c) retu

Problem DescriptionGiven any integer base b >= 2, it is well known that every positive integer n can be uniquely represented in base b. That is, we can writen = a0 + a1*b + a2*b*b + a3*b*b*b +