![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HOJ
文章平均质量分 55
DyanWang
这个作者很懒,什么都没留下…
展开
-
HOJ 1002 A+B+C
Time limit : 3 sec Memory limit : 32 MFor each pair of integers A B and C ( -2^31 Sample Input1 2 33 4 3Sample Output610提示 请注意32位机上int的表示范围。Solution:#include原创 2013-01-25 15:57:32 · 1522 阅读 · 0 评论 -
HOJ 2201 Sum of Cubes
Time limit : 10 sec Memory limit : 64 MAccording to Goldbach’s conjecture, every evennumber can be expressed as a sum of two oddprimes. Which numbers can be expressed as thesum of tw原创 2013-01-25 16:10:00 · 1240 阅读 · 0 评论 -
HOJ 2306 Tudoku --数独
Time limit : 1 sec Memory limit : 64 MTom is a master in several mathematical-theoretical disciplines. He recently founded a research-lab at ouruniversity and teaches newcomers lik原创 2013-01-25 16:19:22 · 837 阅读 · 0 评论 -
HOJ 1008 How many N
Time limit : 15 sec Memory limit : 32 MFind a minimal interger K which is merely comprised of N and can be divided by M.For example,11 is the minimal number that and be divid原创 2013-01-25 16:03:42 · 1270 阅读 · 0 评论 -
HOJ 3120 (A-B)%C
DescriptionWe have 3 positive numbers a, b, c where a >= b. Given p = a mod c and q = b mod c, you should calculate ( a - b) mod c.Hint 1: For any two positive numbers a and b, where a = k * b +原创 2013-01-25 16:25:23 · 1397 阅读 · 0 评论 -
HOJ 1001 A+B
Time limit : 10 sec Memory limit : 32 Mfor each pair of integers A and B ( 0 Sample Input1 23 4Sample Output37Solution:#include int main(){ int a=0,b=0;原创 2013-01-25 15:53:03 · 1012 阅读 · 0 评论 -
HOJ 1107 Prime Cuts
找1到N之间的素数(包括1和N),如果素数数未偶数,则输出最中间的2*C个,否则输出最中间的2*C-1个InputEach input set will be on a line by itself and will consist of 2 numbers. The first number (1 <= N <= 1000) is the maximum number in th原创 2013-01-31 16:41:59 · 879 阅读 · 2 评论 -
HOJ 题目分类
模拟题、枚举:1000 A+B1001 A+B+C1004 Prime Palindromes1006 Weird Clock1009 Fat Cat1010 The Angle1025 Skew Binary1043 Maya Calendar1054 Game Prediction1057 Mileage Bank1069 Prime Land转载 2013-02-20 12:45:23 · 4247 阅读 · 0 评论