暴力求解
文章平均质量分 80
风往北吹~
岂能尽随人愿,但求无愧我心。
展开
-
The 3n + 1 problem(杭电1032)(暴力求解)
The 3n + 1 problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23163 Accepted Submission(s): 8653 Problem Description Proble原创 2014-11-24 23:33:40 · 1608 阅读 · 0 评论 -
A Famous Music Composer(南阳oj25)(一道无聊的英文题)
A Famous Music Composer 时间限制:1000 ms | 内存限制:65535 KB 难度:1 描述 Mr. B is a famous music composer. One of his most famous work was his set of preludes. These 24 pieces span the 24 musical原创 2014-12-04 01:40:55 · 1218 阅读 · 0 评论 -
除法(Division,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 equ原创 2015-12-14 22:39:39 · 735 阅读 · 0 评论 -
最大乘积(Maximum Product,UVa11059)
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-12-15 10:45:01 · 1186 阅读 · 0 评论 -
分数拆分(Fractions Again?!,UVa 10976)
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-12-16 11:21:31 · 809 阅读 · 0 评论