码迷,mamicode.com
首页 >  
搜索关键字:largest number    ( 27910个结果
projecteuler---->problem=4----Largest palindrome product
title: Largest palindrome product Problem 4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the l...
分类:其他好文   时间:2014-06-07 01:24:27    阅读次数:398
ACM-数论之Big Number——hdu1018
ACM 数论 Big Number hdu1018 斯特林公式...
分类:其他好文   时间:2014-06-05 08:41:41    阅读次数:149
POJ 3259 Wormholes (图论---最短路 Bellman-Ford || SPFA)
链接:http://poj.org/problem?id=3259 Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path t...
分类:其他好文   时间:2014-06-05 05:26:33    阅读次数:240
LeetCode: Plus One [067]
【题目】 Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 【题意】 给定一个非负整数,这个表示为一个数字数组。计算这个整数加1后的值。 【思路】 从低位到高位依次相加,注意处理进...
分类:其他好文   时间:2014-06-05 01:24:44    阅读次数:250
LeetCode: Valid Number [066]
【题目】 Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" => true Note: It is intended for the problem statement to be ambiguous. You should gather all requirements up front before imple...
分类:其他好文   时间:2014-06-04 23:45:09    阅读次数:388
C++ this与const,const_cast,static_cast的关系
一、整体代码 #include using namespace std; class CCTest { public: void setNumber( int ); void printNumber() const ; private: int number; }; void CCTest::setNumber( int num ) { number = num; } ...
分类:编程语言   时间:2014-06-04 23:17:34    阅读次数:415
HDU2717-Catch That Cow
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,0...
分类:其他好文   时间:2014-06-03 05:30:23    阅读次数:394
C语言学习_test1
1.从键盘上输入5个数,输出最大的、最小的元素以及他们的下标 #include int main(void) { int i, j, k, max, min; int a[10] = {0}; printf("input number:"); for(i = 0; i scanf("%d", &a[i]); max = min = a[0]; j = k = 0; ...
分类:编程语言   时间:2014-06-03 02:43:47    阅读次数:241
JD 题目1040:Prime Number (筛法求素数)
OJ题目:click here~~ 题目分析:输出第k个素数 贴这么简单的题目,目的不纯洁 用筛法求素数的基本思想是:把从1开始的、某一范围内的正整数从小到大顺序排列, 1不是素数,首先把它筛掉。剩下的数中选择最小的数是素数,然后去掉它的倍数。依次类推,直到筛子为空时结束。如有: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15...
分类:其他好文   时间:2014-06-03 01:31:03    阅读次数:233
js 高级技巧
1、高级函数 1.1 安全的类型检测 typeof 操作符,对一个值使用可能返回下列某个字符串 undefined, boolean, string, number, object, function null 也返回 ob...
分类:Web程序   时间:2014-05-31 19:19:18    阅读次数:361
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!