码迷,mamicode.com
首页 >  
搜索关键字:positive    ( 2430个结果
poj2773 Happy 2006
Happy 2006 Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 9987   Accepted: 3434 Description Two positive integers are said to be relatively prime to each ...
分类:移动开发   时间:2015-02-26 09:59:22    阅读次数:145
PAT1020.Tree Traversals
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to ou...
分类:其他好文   时间:2015-02-25 18:21:38    阅读次数:143
SGU[118] Digital Root
Description描述Let f(n) be a sum of digits for positive integer n. If f(n) is one-digit number then it is a digital root for n and otherwise digital roo...
分类:其他好文   时间:2015-02-24 16:20:33    阅读次数:180
1008. Elevator (20)
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 sec...
分类:其他好文   时间:2015-02-24 12:36:59    阅读次数:344
Codeforces Beta Round #51---D. Beautiful numbers(数位dp, 巧妙)
Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with...
分类:其他好文   时间:2015-02-23 23:41:09    阅读次数:314
PAT1085. Perfect Sequence
Given a sequence of positive integers and another positive integer p. The sequence is said to be a "perfect sequence" if M 2 #include 3 #include 4 ...
分类:其他好文   时间:2015-02-22 12:11:53    阅读次数:146
HDOJ(1013) ——Digital Roots(字符串模拟题)
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin...
分类:其他好文   时间:2015-02-22 11:07:30    阅读次数:116
Scala基础篇-控制结构和函数
#####1. 条件表达式 ``` scala> if(x>1)"positive" else -1 ``` #####2. 循环 ``` while(n>0){ } ``` ``` for(i <- 0 to 10){ println(i) } ``` `for(i <- 表达式)`语法结构表示让变量遍历右边表达式的所有值。...
分类:其他好文   时间:2015-02-21 19:58:28    阅读次数:125
PAT1059. Prime Factors
Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1 * p2^k2 *…*pm^km. Input Specif...
分类:其他好文   时间:2015-02-21 11:59:24    阅读次数:182
POJ 1426-Find The Multiple(bfs)
Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 19272   Accepted: 7813   Special Judge Description Given a positive integer n, write ...
分类:其他好文   时间:2015-02-21 09:47:09    阅读次数:139
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!