代码搜索:factor

找到约 6,651 项符合「factor」的源代码

代码结果 6,651
www.eeworm.com/read/356723/10222183

m factor.m

function [val] = factor(n) % Compute the factorial of n using logarithms to avoid overflow. format long n = n + 9.0; n2 = n * n; temp = (n-1) * log(n) - n + log(sqrt(2.0 * pi * n)) ... + ((1.
www.eeworm.com/read/356183/10235458

m factor.m

function [val] = factor(n) % Compute the factorial of n using logarithms to avoid overflow. format long n = n + 9.0; n2 = n * n; temp = (n-1) * log(n) - n + log(sqrt(2.0 * pi * n)) ... + ((1.
www.eeworm.com/read/278599/10526712

m factor.m

function f=factor(n) if n
www.eeworm.com/read/278099/10572604

c factor.c

/* +++Date last modified: 05-Jul-1997 */ /* ** factor.c -- print prime factorization of a number ** Ray Gardner -- 1985 -- public domain ** Modified Feb. 1989 by Thad Smith > public domain **
www.eeworm.com/read/159920/10589797

c factor.c

/* ** factor.c -- print prime factorization of a number ** Ray Gardner -- 1985 -- public domain ** Modified Feb. 1989 by Thad Smith > public domain ** ** This version takes numbers up to the limi
www.eeworm.com/read/421785/10698760

c factor.c

// factor.c -- uses loops and recursion to calculate factorials #include long fact(int n); long rfact(int n); int main(void) { int num; printf("This program calculates facto
www.eeworm.com/read/349903/10785342

exe factor.exe

www.eeworm.com/read/349903/10786124

c factor.c

/* * Program to factor Integers * * Current parameters assume a large 32-bit address space is available. * * This program is cobbled together from the implementations of various *
www.eeworm.com/read/274525/10866811

class factor.class

www.eeworm.com/read/273606/10908739

m factor.m

function f=factor(n) if n