Beautiful Garden
There are n trees planted in lxhgww's garden. You can assume that these trees are planted along the X-axis, and the coordinate of ith tree
is xi.
But in rece...
分类：
其他好文 时间：
2014-08-16 21:10:21
阅读次数：
174
Problem Description
Mery has a beautiful necklace. The necklace is made up of N magic balls. Each ball has a beautiful value. The balls with the same beautiful value look the same, so if two or more ...
分类：
其他好文 时间：
2014-08-12 17:29:44
阅读次数：
253
Main reference:http://zhaohongze.com/wordpress/2014/01/04/leetcode-minimum-window-substring/The ART of counting. So difficult and beautiful problem. I...
Compress String
时间限制：2000 ms | 内存限制：65535 KB
难度：3
描述
One day,a beautiful girl ask LYH to help her complete a complicated task—using a new compression method similar to Run Length Encod...
分类：
其他好文 时间：
2014-08-09 18:46:18
阅读次数：
284
Problem DescriptionAlice and Bob are playing together. Alice is crazy about art and she has visited many museums around the world. She has a good memo...
Beautiful IP AddressesTime Limit: 2000msMemory Limit: 262144KBThis problem will be judged onCodeForces. Original ID:292C64-bit integer IO format:%I64d...
分类：
其他好文 时间：
2014-08-05 19:09:33
阅读次数：
340
题意大概是，判断一个正整数区间内有多少个整数能被它自身的每一个非零的数字整除。因为每一个位置上的整数集s = {0,1,2,3,4,5,6,7,8,9} lcm(s) = 2520现在有一个整数t是由s中一个或者多个数字构成的，记为abcde,显然t = a*10^4+b*10^3+c*10^2+d...
分类：
其他好文 时间：
2014-08-05 13:28:39
阅读次数：
233
hdu4888Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2007 Accepted Su...
Redraw Beautiful Drawings
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1993 Accepted Submission(s): 446
Problem Description
Alice...
分类：
其他好文 时间：
2014-08-04 21:39:38
阅读次数：
329
参考题解：http://blog.csdn.net/qian99/article/details/38276887
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
int m,n,K;
const int INF=1<<30;
const...
