代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/494289/6381475
exe factor.exe
www.eeworm.com/read/494289/6381574
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/491236/6437937
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/489524/6472668
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/480287/6669195
m factor.m
www.eeworm.com/read/410432/11287525
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/405084/11472047
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/402117/11542994
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.