代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/187475/8637530
txt param.txt
no of dimensions
min value
max value
size of interval
branching factor
number of data rows
path of data file
www.eeworm.com/read/287363/8689614
cpp 2363.cpp
#include
#include
using namespace std;
int getMinPaper(int iNum)
{
int k;
int iMinResult = 4*iNum + 2;
int factor1, factor2;
int temp = 0;
int sum = 0;
for(k = 1
www.eeworm.com/read/430134/8764575
m matlab-gps.m
% convcon.m
% Scope: This MATLAB macro sets the most used conversion constants as
% global variables.
% Usage: convcon
% Description of global parameters:
www.eeworm.com/read/427960/8908761
cpp lenstra.cpp
/*
* Program to factor big numbers using Lenstras elliptic curve method.
* Works when for some prime divisor p of n, p+1+d has only
* small factors, where d depends on the particular curve
www.eeworm.com/read/427960/8909748
cpp brent.cpp
/*
* Program to factor big numbers using Brent-Pollard method.
* See "An Improved Monte Carlo Factorization Algorithm"
* by Richard Brent in BIT Vol. 20 1980 pp 176-184
*
* Requires:
www.eeworm.com/read/383688/8927627
h font.h
#define __ 0x00 // EMPTY
#define _DEGREE 0x78 // K-Degree
#define _PLUS 0x72 // +
#define _DASH
www.eeworm.com/read/284309/8945862
m tfrrmsc.m
function [tfr,rtfr,hat] = tfrrmsc(x,t,N,f0T,trace,K);
%TFRRMSC Reassigned Morlet Scalogram time-frequency distribution.
% [TFR,RTFR,HAT] = TFRRMSC(X,T,N,F0T,TRACE)
% computes the Morlet scalogram and
www.eeworm.com/read/283085/9043564
m st.m
function [st,t,f] = st(timeseries,minfreq,maxfreq,samplingrate,freqsamplingrate)
% Returns the Stockwell Transform of the timeseries.
% Code by Robert Glenn Stockwell.
% DO NOT DISTRIBUTE
% B
www.eeworm.com/read/184327/9109511
pas ac1138.pas
program tju1138;
const
maxterms=1000;
type
term=record factor,index:longint;end;
formula=array[1..maxterms]of term;
var
a,b,c:formula;
p,la,lb,lc,i,j:longint;
s:ansistring;
fir
www.eeworm.com/read/184327/9109807
pas ac1030.pas
program tju1030;
const
maxl=100;
type
factorlist=record
count:byte;
value:array[1..3]of byte;
e:array[1..3]of byte;
end;
var
prime:array[1..maxl]of byte;
factor:array[