2015年08月_KeepTing

12月 11月 10月 09月 08月 06月

原创 HDU 1157 Who's in the Middle （快速排序）

Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as

2015-08-17 15:43:50 355

原创 Piggy-Bank（完全背包）

Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The

2015-08-16 10:23:27 367

Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must sta

2015-08-15 17:30:40 1009

原创统计数n阶乘中0的位数

#include#includeint main (){ int n,m,i,sum; int count,flag; scanf ("%d",&n); while (n--) { count=1; flag=0; scanf ("%d",&m); sum=m; i=5;

2015-08-13 10:12:53 403

原创最长公共子序列（动态规划）

#include #include int f (int i,int j,char*x,int b[][20]){ if (i==0 || j==0) return; if (b[i][j]==1) { f (i-1,j-1,x,b); printf ("%c",x[i-1]); } else if (b

2015-08-11 11:09:39 337

原创归并排序（递归与分治）

#include #include void mer (int a[],int l,int m,int r ) //合并函数 { int i,j,k; int n1=m-l+1; int n2=r-m; int *f,*b; f=(int *) malloc (n1*sizeof (int)); b=(int *) malloc

2015-08-05 17:24:09 497