码迷,mamicode.com
首页 >  
搜索关键字:nearly prime numbers    ( 9679个结果
POJ2109——Power of Cryptography
Power of CryptographyDescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among t...
分类:其他好文   时间:2014-06-04 16:27:41    阅读次数:248
百度之星2014复赛 - 1001 - Find Numbers
先上题目:Find NumbersTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26Accepted Submission(s): 20Spec...
分类:其他好文   时间:2014-06-02 17:15:22    阅读次数:267
Amicable numbers -- Javascript 实现
问题描述: Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a  b, then a and b are an amicable pair and each ...
分类:编程语言   时间:2014-06-02 12:31:42    阅读次数:298
poj3126
题目链接: http://poj.org/problem?id=3126 题目: Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10737   Accepted: 6110 Description The ministers of...
分类:其他好文   时间:2014-06-02 02:21:22    阅读次数:228
LeetCode: 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-06-01 17:05:44    阅读次数:296
【leetcode】Permutations
问题: Given a collection of numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. 分析: ...
分类:其他好文   时间:2014-06-01 15:04:42    阅读次数:259
POJ 3579- Median
?? Description Given N numbers, X1, X2, ... , XN, let us calculate the difference of every pair of numbers: ∣Xi - Xj∣ (1 ≤ i < j ≤ N). We can get C(N,2) differences through this work, and no...
分类:其他好文   时间:2014-06-01 14:07:56    阅读次数:347
【leetcode】Permutations II
问题: Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [1,1,2], [1,2,1], and...
分类:其他好文   时间:2014-06-01 13:03:12    阅读次数:324
Prime Path
Prime PathTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10729Accepted: 6109DescriptionThe ministers of the cabinet were quite upset by the ...
分类:其他好文   时间:2014-06-01 12:11:35    阅读次数:174
poj 3252 Round Numbers
题目链接:http://poj.org/problem?id=3252题意:给出一个二进制区间,求出0的个数不小于1的个数这样的二进制个数解法:数位DP,定义状态dp[len][num_zero][num_one],num_zero 定义为写0的个数。 1 #include 2 #include 3...
分类:其他好文   时间:2014-06-01 12:06:33    阅读次数:191
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!