![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LRJ紫书第7章
就是乐
Dont't try to rush things that need time to grow.
展开
-
UVa 10976----Fractions Again?!(枚举)
It is easy to see that for every fraction in the form (k > 0), we can always find two positive integers x and y,x ≥ y, such that: . Now our question is: can you write a program that counts how原创 2015-08-05 19:14:02 · 296 阅读 · 0 评论 -
UVa 725----Division(枚举)
Description Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is equal t原创 2015-08-05 16:42:37 · 627 阅读 · 0 评论 -
UVa 11059----Maximum Product(最长上升子序列乘积)
Maximum Product Time limit: 3.000 seconds Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of themaximum positive product involving consecutive terms原创 2015-08-05 17:40:49 · 273 阅读 · 0 评论