代码搜索:factor

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

代码结果 6,651
www.eeworm.com/read/470699/6906062

m factor.m

function f=factor(n) if n
www.eeworm.com/read/467764/7000996

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/221007/7074559

m factor.m

function f=factor(n) if n
www.eeworm.com/read/206562/7129748

m factor.m

function f=factor(n) if n
www.eeworm.com/read/462004/7213068

h factor.h

#include "Matrix.h" // Factor.h: interface for the Factor class. // ////////////////////////////////////////////////////////////////////// #if !defined(AFX_FACTOR_H__C5426C88_4CD6_46BF_B320_0CE4
www.eeworm.com/read/462004/7213069

cpp factor.cpp

// Factor.cpp: implementation of the Factor class. // ////////////////////////////////////////////////////////////////////// #include "stdafx.h" #include "ProGram2.h" #include "Factor.h" #incl
www.eeworm.com/read/461264/7230628

pro factor.pro

;------------------------------------------------------------- ;+ ; NAME: ; FACTOR ; PURPOSE: ; Find prime factors of a given number. ; CATEGORY: ; CALLING SEQUENCE: ; factor, x, p,
www.eeworm.com/read/459103/7282692

m factor.m

function f=factor(n) if n
www.eeworm.com/read/458257/7300324

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/457902/7315721

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