码迷,mamicode.com
首页 >  
搜索关键字:can you dfs    ( 55632个结果
hust 1328 String
题目描述Give you a string S,assume the Sub-String Stri = S[0..i] and the length of the string is N. e.g. S = "moreandmorecold", N = 15, Str0 = "m" Str1 = ...
分类:其他好文   时间:2014-05-14 02:36:45    阅读次数:314
Pat(Advanced Level)Practice--1018(Public Bike Management)
Pat1018代码 题目描述: There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to an...
分类:其他好文   时间:2014-05-13 23:27:04    阅读次数:582
poj-1426(转)
大致题意:给出一个整数n,(1 int n,flat;unsigned long long b;void DFS(unsigned long long a,int step){ if(flat||step==19) { return ; } if(a%n==0)...
分类:其他好文   时间:2014-05-13 19:59:23    阅读次数:276
zoj Gao The Sequence
Gao The SequenceTime Limit:2 Seconds Memory Limit:65536 KBYou are given a sequence of integers,A1,A2,...,An. And you are allowed a manipulation on the...
分类:其他好文   时间:2014-05-13 19:49:14    阅读次数:277
【LeetCode】Triangle
TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given...
分类:其他好文   时间:2014-05-13 18:51:44    阅读次数:297
c++ 名字粉碎(name mangling)
转自Ibm:Name mangling is the encoding of function and variable names into unique names so that linkers can separate common names in the language. Type n...
分类:编程语言   时间:2014-05-13 18:18:53    阅读次数:421
[迭代加深dfs] zoj 3768 Continuous Login
题目链接: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3768 Continuous Login Time Limit: 2 Seconds      Memory Limit: 131072 KB      Special Judge Pierre is recently obsessed...
分类:其他好文   时间:2014-05-13 07:28:07    阅读次数:412
topk记录
lk@lk-virtual-machine:~/hadoop-1.0.1/bin$ ./hadoop dfs -rmr output Deleted hdfs://localhost:9000/user/lk/output lk@lk-virtual-machine:~/hadoop-1.0.1/bin$ ./hadoop jar ~/mytopk.jar top.Top  input out...
分类:其他好文   时间:2014-05-13 06:53:12    阅读次数:448
HDU4027 Can you answer these queries 线段树区间求和+剪枝
给了你n,然后n个数字在一个数组中,接下来m个询问,每个询问三个数字 t,x,y,若t==0,那么修改区间[x,y]的每一个值,变为原来每个位置上的数 开根号取整,若t==1,那么对区间[x,y]求和 由于n,m,很大,所以树状数组铁定超时,若直接用线段树来做区间修改,那么也是超时,这类题目没别的方法了,静心剪枝,发现题目给的数据范围为2^63,有没有发现,2^63开根号 绝对不需要开1...
分类:其他好文   时间:2014-05-12 23:01:59    阅读次数:479
显示数据库中的存储过程__转
显示数据库中的存储过程__转 It's no easy trick to see stored procedures in a database programmatically with a scripting language like ASP. If you're using MS Access, you're out of luck. Access provides no way to ...
分类:数据库   时间:2014-05-12 22:43:25    阅读次数:541
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!