码迷,mamicode.com
首页 >  
搜索关键字:guess numbers    ( 8263个结果
Add Two Numbers
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 ...
分类:其他好文   时间:2014-05-16 23:18:16    阅读次数:360
hdu how many prime numbers 筛选法求素数
/* * hdu How many prime numbers * date 2014/5/13 * state AC */ #include #include #include using namespace std; bool isPrime(int x) { int sqr=sqrt(x*1.0); for(int i=2;i<=sqr;i++) {...
分类:其他好文   时间:2014-05-15 05:07:18    阅读次数:261
LA 4727
Integers1, 2, 3,...,nare placed on a circle in the increasing order as in the following figure. We want to construct a sequence from these numbers on ...
分类:其他好文   时间:2014-05-14 02:54:10    阅读次数:354
poj 1715 Hexadecimal Numbers 排列组合
1 /** 2 大意: 给定16进制数的16个字母,,求第k大的数,,要求数的长度最大为8.,并且每个数互不相同。 3 思路: 从高到低挨个枚举,每一位能组成的排列数 ,拿最高位来说,能做成的排列数为15*A(15,len-i) 4 第二位 A(14,len-2)。。这样就可以...
分类:其他好文   时间:2014-05-13 21:58:38    阅读次数:402
【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
Codeforces Round #245 (Div. 1)——Guess the Tree
n个节点,给定每个节点的子树(包括自己)的节点个数,每个节点如果有子节点必然大于等于2,求这样的数是否存在 n (1?≤?n?≤?24)....
分类:其他好文   时间:2014-05-13 14:58:47    阅读次数:218
[ACM] 1016 Prime Ring Problem (深度优先搜索)
Prime Ring Problem Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent...
分类:其他好文   时间:2014-05-13 11:54:17    阅读次数:444
[leetcode]Sum Root to Leaf Numbers @ Python
原题地址:http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/题意:Given a binary tree containing digits from0-9only, each root-to-leaf path could repre...
分类:编程语言   时间:2014-05-12 01:28:30    阅读次数:440
leetcode --day12 Surrounded Regions & Sum Root to Leaf Numbers & Longest Consecutive Sequence
1、 ?? Surrounded Regions Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For e...
分类:其他好文   时间:2014-05-11 18:52:32    阅读次数:293
一维数组元素的输入输出方法总结
1、数组的下标法:直观且容易理解如:int a[5],i;printf("Input five numbers:");for(i=0;i<5;i++){scanf("%d",&a[i]);}for(i=0;i<5;i++){ printf("%4d",a[i]);}2、数组名首地址法(指针法):指针...
分类:其他好文   时间:2014-05-11 00:35:46    阅读次数:351
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!