GodLike

冒泡排序以及对其优化后的shake 排序

The 3n + 1 problemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48403 Accepted: 15336DescriptionProblems in Computer Science are often classified as b

Ancient CipherTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26102 Accepted: 8592DescriptionAncient Roman empire had a strong government system with va

Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17141 Accepted: 9428DescriptionSome positive integers can be represented

Goldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 35054 Accepted: 13441DescriptionIn 1742, Christian Goldbach, a German amateur mathe

Tree RecoveryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10152 Accepted: 6377DescriptionLittle Valentine liked playing with binary trees very much.

QuicksumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12627 Accepted: 8756DescriptionA checksum is an algorithm that scans a packet of data and return

Superlong sumsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21887 Accepted: 6435DescriptionThe creators of a new programming language D++ have found o

序列Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6614 Accepted: 2951Description数列A满足An = An-1 + An-2 + An-3, n >= 3 编写程序，给定A0, A1 和 A2, 计算A99Inpu

#include #define N 10void LCSLength(int m, int n, char *x, char *y,int c[][N],int b[][N]){ int i, j; for(i = 1; i <= m; i++) c[i][0] = 0; for(i = 1; i <= n; i++) c[0][i] = 0; for(i = 1; i <=

#include int MaxSum(int n, int *a, int *besti, int *bestj){ int sum = 0, i,j,k, thissum; for(i = 0; i < n; i++) { for(j=0; j < n; j++) { thissum = 0; for(k = i; k <= j; k++) thissum +=

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34945 Accepted: 13843DescriptionA subsequence of a given sequence is the given sequenc

To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37857 Accepted: 19954DescriptionGiven a two-dimensional array of positive and negative integer

在算法设计里面一个重要的策略就是贪心算法。贪心算法较之于动态规划是每一步求得的解是当前局部最优的解，这样一步步求下去那么所得到的解就会无限接近于全局的最优解，在某些情况下会等于最优解。 在这里主要谈谈贪心策略中的最小生成树。在嵌入式设计中，我们都会用线将各个component 连接起来，这里我们要保证每一个component 的每一个针脚我们都必须连上，这里做一个合理的假设，假设图论中的每

Integer InquiryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27761 Accepted: 10775DescriptionOne of the first users of BIT's new supercomputer was Chi

Bull MathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11709 Accepted: 6089DescriptionBulls are so much better at math than the cows. They can multipl

这里我用到了数学高斯公式：sum = (首项+末项) * 项数 / 2;#include #include void Cal(int a, int b){ int result[100],real[100]; memset(result, 0, sizeof(result)); memset(real, 0, sizeof(real)); int div_a

方法：砍掉小于21位的数，砍掉大于21位的数，对21位的数其中每个数字出现的次数进行比较相同则为花朵数。每一次用9的21次方依次试探，大于或小于21位的去掉，那么这里不仅仅去掉 了2个数，而是把大于这个数或者小于这个数 的所有可能情况都咔嚓了，这里是一个很重要的点，这里进行的减枝是整个算法的关键。#include #include #include #define N

FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7959 Accepted: 5655DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn 

快速排序算法是基于分治策略的另一个排序算法。其基本思想是，对于输入的子数组，按以下三步进行排序。一：分解二：递归求解三：合并#include #define N 8typedef int Type;using namespace std;void QuickSort(Type a[], int left, int right){ if(left < right)

合并排序是用分治策略实现对n 个元素进行排序的算法。其基本思想是，将待排序元素分成大小大致相同的两个子集合，分别对两个子集合进行排序，最终将排好序的子集合合并成所要求的排好序的集合。其递归描述如下：#include #define N 8typedef int Type;using namespace::std;Type *b = new Type[N];void Mer

487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 220050 Accepted: 38357DescriptionBusinesses like to have memorable telephone numbers. One way to m

DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 75079 Accepted: 30074DescriptionOne measure of ``unsortedness'' in a sequence is the number of

Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 60309 Accepted: 18596DescriptionDuring his last sabbatical, professor M. A. Ya made a surpris

迷宫问题Time Limit: 1000MS Memory Limit: 65536K   Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0,

I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 79136 Accepted: 34102DescriptionFred Mapper is considering purchasing some land

Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 107802 Accepted: 51472DescriptionLarry graduated this year and finally has a job. He's

BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 103717 Accepted: 32096DescriptionSome people believe that there are three cycles in a person's l

HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 91219 Accepted: 44197DescriptionHow far can you make a stack of cards overhang a table? If you h

好久没上帖了，现在把昨天一个晚上和今天一上午的努力写出来，大家互相交流下。题目的描述我就直接COPY了：ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 121122 Accepted: 29574Description