代码搜索:factor

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

代码结果 6,651
www.eeworm.com/read/315275/3622019

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/307266/3726034

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/307266/3726382

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/285741/4046625

cpp factor.cpp

#include #include #include unsigned long factor (unsigned long Num); void main (int argc, char *argv[]) { if (argc < 2) return; u
www.eeworm.com/read/280590/4125493

in factor2.in

10
www.eeworm.com/read/280590/4125494

in factor3.in

22
www.eeworm.com/read/280590/4125497

in factor4.in

48
www.eeworm.com/read/280590/4125498

in factor1.in

6
www.eeworm.com/read/276984/4160429

java factor.java

/* * LA-CC 05-135 Trident 0.7.1 Copyright Notice Copyright 2006 (c) the Regents of the University of California. This Software was produced under a U.S. Government contract (W-7405-ENG-36) by Los
www.eeworm.com/read/273525/4204338

hlp factor.hlp

{smcl} {* 06apr2005}{...} {cmd:help factor} {right:dialogs: {bf:{dialog factor} {dialog factormat}} } {right:also see: {help factor postestimation}} {hline} {title:Title} {p 4 21 2} {