![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
基础题
雪十月
这个作者很懒,什么都没留下…
展开
-
HDU Basiclly Speaking
Problem DescriptionThe Really Neato Calculator Company, Inc. has recently hired your team to help design their Super Neato Model I calculator. As a computer scientist you suggested to the company th原创 2014-07-29 23:47:10 · 530 阅读 · 0 评论 -
HDU 寻找素数对
寻找素数对Problem Description哥德巴赫猜想大家都知道一点吧.我们现在不是想证明这个结论,而是想在程序语言内部能够表示的数集中,任意取出一个偶数,来寻找两个素数,使得其和等于该偶数.做好了这件实事,就能说明这个猜想是成立的.由于可以有不同的素数对来表示同一个偶数,所以专门要求所寻找的素数对是两个值最相近的.Input输入中是一些偶整数原创 2014-07-30 01:16:25 · 553 阅读 · 0 评论 -
hdu 完数
Problem Description完数的定义:如果一个大于1的正整数的所有因子之和等于它的本身,则称这个数是完数,比如6,28都是完数:6=1+2+3;28=1+2+4+7+14。本题的任务是判断两个正整数之间完数的个数。Input输入数据包含多行,第一行是一个正整数n,表示测试实例的个数,然后就是n个测试实例,每个实例占一行,由两个正整数num1和num2组成原创 2014-07-29 23:21:49 · 371 阅读 · 0 评论 -
HDU A Simple Task
Problem DescriptionGiven a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.ExampleFor n = 24, o = 3 and p = 3.TaskWrite a program which原创 2014-07-29 23:47:19 · 377 阅读 · 0 评论 -
HDU 2^x mod n = 1
Problem DescriptionGive a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.InputOne positive integer on each line, the value of n.OutputIf the minimum x exists, pri原创 2014-07-29 23:32:36 · 387 阅读 · 0 评论 -
hdu Goldbach's Conjecture
Problem DescriptionGoldbach's Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2.This conjecture has no原创 2014-07-29 23:50:17 · 430 阅读 · 0 评论