代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/268798/11121103
b factor.b
* factor an arbitrarily large positive integer
*
* Copyright (C) 1999-2001 by Brian Raiter
* under the GNU General Public License
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>-
*
* read in the number
*
www.eeworm.com/read/268798/11121130
asm factor.asm
;; factor.asm: Copyright (C) 1999-2001 by Brian Raiter, under the GNU
;; General Public License (version 2 or later). No warranty.
;;
;; To build:
;; nasm -f bin -o factor factor.asm && chmod +x facto
www.eeworm.com/read/413044/11168987
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/265723/11255358
m factor.m
% <mark>FACTOR</mark> 慺場悢暘夝
%
% <mark>FACTOR</mark>(N) 偼丄N 偺慺場悢暘夝傪娷傓儀僋僩儖傪弌椡偟傑偡丅
%
% 偙偺娭悢偼丄娙扨側sieve傾儖僑儕僘儉傪巊偭偰偄傑偡丅梌偊傜傟偨悢帤偑
% 旕忢偵戝偒偄応崌丄懡偔偺儊儌儕傪昁梫偲偟傑偡丅媄弍揑偵丄懡偔偺応崌丄
% 妱傝摉偰傞儊儌儕偺検傪尭傜偟丄幚峴帪娫傕彮側偔偡傞傛偆偵丄偙偺傾儖僑
% 儕僘儉傪夵椙偡傞偙偲偑偱偒傑偡丅偟偐偟丄忦 ...
www.eeworm.com/read/265723/11255455
m factor.m
function f = factor(n)
%FACTOR Prime factors.
% FACTOR(N) returns a vector containing the prime factors of N.
%
% This function uses the simple sieve approach. It may require large
% memory
www.eeworm.com/read/237997/13913584
c factor.c
/*
file name : factor.c
Description : 利用递归函数调用计算N 阶乘
ex : n = 3 时,递归函数执行如下 :
if ( n == 1)
return (1);
else
return( 3* Factorial(3-1) );
→
return( 2* Factoria
www.eeworm.com/read/237896/13921340
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.