有时间也搞搞算法！

#include#includeusing namespace std;bool isPrimer(int n){ int m=sqrt(n); int i; for(i=2;i>n&&n){ num=0; for(i=2;i<n/2;i++){ if(isPrimer(i)&&isPrimer(n-i)) num++; } cout<<num<<endl; } }

hdu2098 分拆素数和Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 26497 Accepted Submission(s): 11599Problem Description 把一个偶数拆成两个不同素数的和，有几种拆法呢

hdu1057 hdu水题A New Growth IndustryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1488 Accepted Submission(s): 606 Problem DescriptionProb

hdu优先队列Windows Message QueueProblem Description Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process,

hdu树形DPStrategic GameProblem Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the fo

如果要在n个数据中挑选出第一大和第二大的数据（要求输出数据所在位置和值），使用什么方法比较的次数最少？我们可以从体育锦标赛中受到启发。如图【1.png】所示，8个选手的锦标赛，先两两捉对比拼，淘汰一半。优胜者再两两比拼…直到决出第一名。第一名输出后，只要对黄色标示的位置重新比赛即可。下面的代码实现了这个算法（假设数据中没有相同值）。代码中需要用一个数组来表示图中的树（注意，这是个满二叉树，不足需要补

PalindromesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1509 Accepted Submission(s): 712Problem Description A regular palindrome(回文) is