码迷,mamicode.com
首页 >  
搜索关键字:ugly number    ( 27156个结果
codechef Sums in a Triangle题解
Let's consider a triangle of numbers in which a number appears in the first line, two numbers appear in the second line, three in the third line, etc....
分类:其他好文   时间:2014-08-28 13:03:29    阅读次数:218
poj 1019 Number Sequence , 二分
从下面这一有规律的串中,查找第i(1 ≤ i ≤ 2147483647)个为的数是什么? 11212312341234512345612345671234567812345678912345678910123456789101112345678910...... 二分 #include #include #include #include #include using namespa...
分类:其他好文   时间:2014-08-28 11:30:49    阅读次数:176
TopCoder SRM 144 DIV 2
200: Problem Statement   Computers tend to store dates and times as single numbers which represent the number of seconds or milliseconds since a particular date. Your task in this ...
分类:其他好文   时间:2014-08-28 11:27:29    阅读次数:244
adf常用方法总结
1.使用clientAttribute传值、获取值 或组件上面放客户端属性 public void onSelect(ValueChangeEvent valueChangeEvent) { Number id = (Number)valueChangeEvent.getComponent()...
分类:其他好文   时间:2014-08-28 11:23:59    阅读次数:485
Lingo 优化实例 出版社问题
model: data: LY_K=0.002; enddata sets: !1-72个科目每个科目的书号数; number/1..72/:anum; link(number); !每个书号的平均价格; price/1..72/:p; !单位书号的销售量 预测2006年的; perSH/1..72...
分类:其他好文   时间:2014-08-28 11:14:59    阅读次数:302
[leetcode]Single Number @ Python
原题地址:http://www.cnblogs.com/x1957/p/3373994.html题意:Given an array of integers, every element appearstwiceexcept for one. Find that single one.要求:线性时间复...
分类:编程语言   时间:2014-08-28 11:04:19    阅读次数:274
Ural 1096-Get the Right Route Plate!(bfs)
1096. Get the Right Route Plate! Time limit: 1.0 second Memory limit: 64 MB Everybody who had ridden a Ekaterinburg bus could notice that on the inner side of the plate with the number of t...
分类:其他好文   时间:2014-08-28 09:43:49    阅读次数:331
LeetCode: Maximum Depth of Binary Tree
LeetCode: Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from...
分类:其他好文   时间:2014-08-27 21:54:58    阅读次数:234
poj 3252 Round Numbers(数位dp)
http://poj.org/problem?id=3252 "Round Number "被称为其二进制形式中0的个数比1的个数多。求[x,y]区间内“Round Number”的个数。 计数的时候最重要的是处理前导零,前导零不算数,因此与SCOI2009一样,增加一个标记变量first,标志着当前这意味是不是首位,不是首位的话1和0的个数都为0,否则根据枚举的1或0进行记忆...
分类:其他好文   时间:2014-08-27 20:36:48    阅读次数:211
Single Number和Single Number II
1 Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear run...
分类:其他好文   时间:2014-08-27 18:38:28    阅读次数:174
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!