码迷,mamicode.com
首页 >  
搜索关键字:tags    ( 2328个结果
SPOJ 题目705 New Distinct Substrings(后缀数组,求不同的子串个数)
SUBST1 - New Distinct Substrings no tags  Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Output For each test case ou...
分类:编程语言   时间:2015-08-21 19:27:35    阅读次数:168
HOJ1014
Niven NumbersMy Tags (Edit) Source : UnknownTime limit : 1 secMemory limit : 32 MSubmitted : 5349, Accepted : 965A Niven number is a number such that ...
分类:其他好文   时间:2015-08-21 13:23:20    阅读次数:111
Python打包及发布
http://lesliezhu.github.io/public/2014-11-13-python-packaging.html http://lesliezhu.github.io/public/tags/Python.html http://blog.csdn.net/xluren/article/details/41114779...
分类:编程语言   时间:2015-08-21 01:56:07    阅读次数:162
Nim-字符串编码转换
Nim中对字符串进行转码需要用到encodings模块。 encodings模块: proc getCurrentEncoding(): string {.raises: [], tags: [].} proc getCurrentEncoding():string {.raises: [],tags: [].} #检索当前系统编码,在UNIX上,总是返...
分类:其他好文   时间:2015-08-20 22:37:00    阅读次数:194
SPOJ AMR11E - Distinct Primes 10232【素数打表】
AMR11E - Distinct Primes no tags    Arithmancy is Draco Malfoy's favorite subject, but what spoils it for him is that Hermione Granger is in his class, and she is better than him at it.  ...
分类:其他好文   时间:2015-08-20 10:33:00    阅读次数:176
tp框架 ---token的使用
在Home/Conf/tags.php <?php return array( ? ? ?// 添加下面一行定义即可 ? ? ?//‘view_filter‘ => array(‘Behavior\TokenBuild‘), ? ? // 如果是3.2.1以上版本 需要改成 ? ? ‘view_filter‘ => array...
分类:其他好文   时间:2015-08-19 23:52:48    阅读次数:731
SPOJ 题目694 Distinct Substrings(后缀数组,求不同的子串个数)
DISUBSTR - Distinct Substrings no tags  Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Each test case consists of one st...
分类:编程语言   时间:2015-08-18 22:48:38    阅读次数:154
【LeetCode】141 - Linked List Cycle
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?Hide Tags:Linked ListTwo PointersHide Simi...
分类:其他好文   时间:2015-08-18 18:52:17    阅读次数:98
Visible Lattice Points(spoj7001+初探莫比乌斯)gcd(a,b,c)=1 经典
VLATTICE - Visible Lattice Points no tags  Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0...
分类:其他好文   时间:2015-08-17 23:46:45    阅读次数:111
SPOJ 题目375 Query on a tree(link cut tree边权更新,求两点最大值)
QTREE - Query on a tree no tags  You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instructions ...
分类:其他好文   时间:2015-08-17 19:35:02    阅读次数:104
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!