码迷,mamicode.com
首页 >  
搜索关键字:euler    ( 502个结果
Project Euler 109 :Darts 飞镖
DartsIn the game of darts a player throws three darts at a target board which is split into twenty equal sized sections numbered one to twenty.The sco...
分类:其他好文   时间:2016-01-23 21:40:14    阅读次数:246
Project Euler 108:Diophantine reciprocals I 丢番图倒数I
Diophantine reciprocals IIn the following equation x, y, and n are positive integers.For n = 4 there are exactly three distinct solutions:What is the ...
分类:其他好文   时间:2016-01-22 21:59:27    阅读次数:322
Project Euler 107:Minimal network 最小网络
Minimal networkThe following undirected network consists of seven vertices and twelve edges with a total weight of 243.The same network can be represe...
分类:Web程序   时间:2016-01-22 17:31:22    阅读次数:152
Project Euler 106:Special subset sums: meta-testing 特殊的子集和:元检验
Special subset sums: meta-testingLet S(A) represent the sum of elements in set A of sizen. We shall call it a special sum set if for any two non-empty...
分类:Web程序   时间:2016-01-20 20:50:12    阅读次数:242
Project Euler 104:Pandigital Fibonacci ends 两端为全数字的斐波那契数
Pandigital Fibonacci endsThe Fibonacci sequence is defined by the recurrence relation:F[n] = F[n-1] + F[n-2], where F[1] = 1 and F[2] = 1.It turns out...
分类:其他好文   时间:2016-01-19 23:32:50    阅读次数:184
Project Euler 102:Triangle containment 包含原点的三角形
Triangle containmentThree distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed.Co...
分类:其他好文   时间:2016-01-18 16:09:00    阅读次数:215
Project Euler 101 :Optimum polynomial 最优多项式
Optimum polynomialIf we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term, as there...
分类:其他好文   时间:2016-01-17 21:41:46    阅读次数:232
Unity3D - 详解Quaternion类(二)
OK,不做引子了,接上篇Unity3D - 详解Quaternion类(一)走起!四、Quaternion类静态方法Quaternion中的静态方法有9个即:Angle方法、Dot方法、Euler方法、FromToRotation方法、Inverse方法、Lerp方法、LookRotation方法、...
分类:编程语言   时间:2016-01-06 19:56:13    阅读次数:1526
hdu 2824The Euler function
题目链接快速求出a到b之间所有数的欧拉函数。一个一个求肯定是不行的, 我们知道欧拉函数的公式为phi(n) = n*(1-1/i1)*(1-1/i2).......i1, i2为素因子。 那么我们就可以先将每一个数的欧拉函数值预处理出来。具体看代码 1 #include 2 using namesp...
分类:其他好文   时间:2015-12-14 15:55:41    阅读次数:139
欧拉(BC)
输入样例1 12 13 2输出样例222f(x)打表找规律的 fx=x+1,fn(x)=x+n+1;然后用欧拉公式 1 #include 2 #include 3 using namespace std; 4 5 __int64 euler(__int64 n) 6 { 7 __in...
分类:其他好文   时间:2015-12-12 23:16:47    阅读次数:334
502条   上一页 1 ... 25 26 27 28 29 ... 51 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!