码迷,mamicode.com
首页 >  
搜索关键字:欧拉    ( 2880个结果
poj 1300 Door Man 欧拉回路
题目链接:http://poj.org/problem?id=1300You are a butler in a large mansion. This mansion has so many rooms that they are merely referred to by number (roo...
分类:其他好文   时间:2015-02-01 12:01:46    阅读次数:251
UVa 10129 单词
题意:给定一些单词,单词的尾字母和另一单词的首字母相同,则可以串联,问是否可以将所有的单词串联。单词可重复出现,但每个单词只能用一次;即某单词重复几次,则可用几次。 思路:欧拉道路的应用。欧拉道路,即“一笔画”,从图中一结点出发走一条道路,每条边恰好经过一次。             首先要判断图是连通的。             对于无向图,最多只有两个奇点(度数为奇数)。且从一奇点出发,...
分类:其他好文   时间:2015-02-01 01:53:50    阅读次数:177
POJ 2337 Catenyms (有向图欧拉通路)
Catenyms Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9914   Accepted: 2588 Description A catenym is a pair of words separated by a period such that t...
分类:其他好文   时间:2015-01-31 23:17:35    阅读次数:234
POJ 1041 John's trip (无向图欧拉回路)
John's trip Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7433   Accepted: 2465   Special Judge Description Little Johnny has got a new car. He decided t...
分类:其他好文   时间:2015-01-31 22:00:06    阅读次数:252
欧拉计划(python) problem 65
Convergents of e Problem 65 The square root of 2 can be written as an infinite continued fraction. √2 = 1 + 1   2 + 1     2 + 1       2 + 1 ...
分类:编程语言   时间:2015-01-31 16:27:32    阅读次数:178
欧拉计划(python) problem 67
Maximum path sum II Problem 67 By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9...
分类:编程语言   时间:2015-01-31 13:06:41    阅读次数:185
欧拉计划(python) problem 20
Factorial digit sum Problem 20 n! means n × (n ? 1) × ... × 3 × 2 × 1 For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + ...
分类:编程语言   时间:2015-01-31 13:00:55    阅读次数:177
(hdu step 2.1.6)找新朋友(欧拉函数的简单使用:求与n互质的元素的个数)
题目:       找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2788 Accepted Submission(s): 1307 Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,...
分类:其他好文   时间:2015-01-31 12:14:57    阅读次数:221
欧拉计划(python) problem 21
Amicable numbers Problem 21 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 ...
分类:编程语言   时间:2015-01-31 12:14:43    阅读次数:221
Project-Euler problem 1-50
最近闲的做了下Project Euler 上的题目,前面50题都比较简单,简单总结下,一下代码一般是Python和C/C++的 用Python 做这些题目简直是酸爽啊 一下代码可能不一定是我的,因为不知道论坛里面的回复不是永久的,所以我的代码有的丢了,可能找个和我的意思相近的代码。题目翻译是从 欧拉计划 | Project Euler 中文翻译站上面Copy 的表告我。 Prob...
分类:其他好文   时间:2015-01-31 00:26:08    阅读次数:241
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!