暴力搜索
文章平均质量分 78
__XINGLE
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
UVA 10976 Fractions Again?!
It is easy to see that for every fraction in the form 1 k (k > 0), we can always find two positive integers x and y, x ≥ y, such that: 1 k = 1 x + 1 y Now our question is: can you write a p原创 2015-08-21 09:27:47 · 352 阅读 · 0 评论 -
UVA 129 Krypton Factor
You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest the contestants are tested o原创 2015-08-21 09:33:20 · 305 阅读 · 0 评论 -
UVA 725 Division
Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0through 9 once each, such that the first number divided by the second is equal to an integer N,原创 2015-08-21 09:21:36 · 324 阅读 · 0 评论 -
UVA 524 Prime Ring Problem dfs
A ring is composed of n (even number) circles as shown in diagram. Put natural numbers into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note:原创 2015-08-21 09:30:56 · 305 阅读 · 0 评论 -
UVA 11059 Maximum Product
Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of the maximum positive product involving consecutive terms of S. If you cannot find a positive sequence,原创 2015-08-21 09:24:28 · 398 阅读 · 0 评论
分享