题目这是传说中的深搜吗。。。。不确定，，，，貌似更加像是模拟，，，，//我要做深搜题目拉//实际上还是模拟#include#include#include#include#include#includeusing namespace std;int ans;char a[20];__int64 n;...
分类：
其他好文 时间：
2014-09-19 23:43:16
阅读次数：
239
Tri TilingTime Limit:1000MSMemory Limit:65536KTotal Submissions:7841Accepted:4113DescriptionIn how many ways can you tile a 3xn rectangle with 2x1 dom...
分类：
其他好文 时间：
2014-09-19 20:54:15
阅读次数：
187
Abstract. Although polynomials offer many advantages, there exist a number of important curve and surface types which cannot be represented precisely ...
分类：
其他好文 时间：
2014-09-19 20:52:26
阅读次数：
405
Description
Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it's Halloween, these
parties are all cos...
分类：
其他好文 时间：
2014-09-19 12:05:05
阅读次数：
183
In recent years Linux distributions started treating security more seriously. Out of many security features two are directly affecting C programmers:-...
分类：
其他好文 时间：
2014-09-18 14:31:34
阅读次数：
589
Binary String Matching
时间限制：3000 ms | 内存限制：65535 KB
难度：3
描述
Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as ...
分类：
其他好文 时间：
2014-09-18 11:34:53
阅读次数：
178
Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1.....
分类：
编程语言 时间：
2014-09-17 18:15:12
阅读次数：
187
Over time, Alexey's mail box got littered with too many letters. Some of them are read, while others are unread.
Alexey's mail program can either show a list of all letters or show the content of a s...
分类：
其他好文 时间：
2014-09-17 15:16:42
阅读次数：
248
Cross-origin resource sharing(CORS) is a mechanism that allows many resources (e.g., fonts, JavaScript, etc.) on aweb pageto be requested from another...
分类：
其他好文 时间：
2014-09-17 15:00:02
阅读次数：
317
题目链接
题意：求出在a到b之间的数中，有多少个0。
思路：组合数学问题。可以枚举每个位置上的数i，假设i之前的数为left，后面的为right，后面有num位数。当i ！= 0时，将i置为0，所以组合数为left * 10^num(后面的位数，每一位有10种选择)，当i = 0时，当前面取[1， left - 1]时，保证组合的数一定小于原来的数，所以后面的可以取10^n...
分类：
其他好文 时间：
2014-09-17 12:13:22
阅读次数：
214
