码迷,mamicode.com
首页 >  
搜索关键字:palindrome numbers    ( 9163个结果
Uva10290 - {Sum+=i++} to Reach N
Problem H {sum+=i++} to Reach N Input: standard input Output:  standard output Memory Limit: 32 MB   All the positive numbers can be expressed as a sum of one, two or more consecutive positive i...
分类:其他好文   时间:2014-07-31 20:58:37    阅读次数:199
Leetcode--Two Sum
Problem Description: Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they...
分类:其他好文   时间:2014-07-31 20:48:17    阅读次数:215
Leetcode--Add Two Numbers
Problem Description: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbe...
分类:其他好文   时间:2014-07-31 20:47:17    阅读次数:215
How many Fibs?(高精度)
Description Recall the definition of the Fibonacci numbers:  f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range...
分类:其他好文   时间:2014-07-31 17:11:07    阅读次数:325
HDU - 1394 Minimum Inversion Number (线段树求逆序数)
Description The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence of numbers a1, a2, ..., an, if we move the ...
分类:其他好文   时间:2014-07-31 13:31:46    阅读次数:229
HDU 2141 Can you find it?
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbe...
分类:其他好文   时间:2014-07-31 12:54:46    阅读次数:704
PHP Functions - arsort()
1 f [4] => e [3] => d [2] => c [1] => b [0] => a ) 9 */10 11 12 13 $numbers = array(1,2,3,4,5,6,7,8);14 arsort($numbers);15 print_r($numbers);16 /*...
分类:Web程序   时间:2014-07-31 12:48:36    阅读次数:222
HDU 1513 Palindrome
题目就是给一个字符串问最少插入多少个字符能让原字符串变为回文字符串。算法:用原串的长度减去原串与翻转后的串的最大公共字串的长度,就是所求答案。 1 //#define LOCAL 2 #include 3 #include 4 #include 5 #include 6 using name...
分类:其他好文   时间:2014-07-31 12:24:36    阅读次数:220
codeforces 446C DZY Loves Fibonacci Numbers 线段树
假如F[1] = a, F[2] = B, F[n] = F[n - 1] + F[n - 2]。写成矩阵表示形式可以很快发现F[n] = f[n - 1] * b + f[n - 2] * a。 f[n] 是斐波那契数列也就是我们如果知道一段区间的前两个数增加了多少,可以很快计算出这段区间的第k个...
分类:其他好文   时间:2014-07-31 09:47:46    阅读次数:286
LightOJ 1205 Palindromic Numbers
数位DP。。。。 Palindromic Numbers Time Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %lld & %llu [Submit]   [Go Back]   [Status]   Description A palindro...
分类:其他好文   时间:2014-07-31 03:04:56    阅读次数:247
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!