代码搜索：combination
找到约 1,190 项符合「combination」的源代码
代码结果 1,190
www.eeworm.com/read/234146/14120979
c combination.c
#include
#define MAX_NUM 20
int comb[MAX_NUM];
void combination(int m, int n)
{
int i, j;
for (i = m; i >= n; i--){
comb[n] = i;
if (n > 1){
comb
www.eeworm.com/read/128512/14292448
txt combination.txt
www.eeworm.com/read/124283/14579157
c combination.c
#include
#include
int
main (void)
{
gsl_combination * c;
size_t i;
printf ("All subsets of {0,1,2,3} by size:\n") ;
for (i = 0; i
www.eeworm.com/read/124283/14579182
out combination.out
All subsets of {0,1,2,3} by size:
{ }
{ 0 }
{ 1 }
{ 2 }
{ 3 }
{ 0 1 }
{ 0 2 }
{ 0 3 }
{ 1 2 }
{ 1 3 }
{ 2 3 }
{ 0 1 2 }
{ 0 1 3 }
{ 0 2 3 }
{ 1 2 3 }
{ 0 1 2 3 }
www.eeworm.com/read/124283/14579524
texi combination.texi
@cindex combinations
This chapter describes functions for creating and manipulating
combinations. A combination @math{c} is represented by an array of
@math{k} integers in the range 0 .. @math{n-1},
www.eeworm.com/read/124283/14579756
c combination.c
/* combination/combination.c
* based on permutation/permutation.c by Brian Gough
*
* Copyright (C) 2001 Szymon Jaroszewicz
*
* This program is free software; you can redistribute it and/or modi
www.eeworm.com/read/122887/14662176
dpr combination.dpr
program Combination;
uses
Forms,
WndCom in 'WndCom.pas' {ComForm},
WndSave in 'WndSave.pas' {FrmSave},
WndChoose in 'WndChoose.pas' {FrmChoose};
{$R *.res}
begin
Application.In
www.eeworm.com/read/122887/14662180
cfg combination.cfg
-$A8
-$B-
-$C+
-$D+
-$E-
-$F-
-$G+
-$H+
-$I+
-$J-
-$K-
-$L+
-$M-
-$N+
-$O+
-$P+
-$Q-
-$R-
-$S-
-$T-
-$U-
-$V+
-$W-
-$X+
-$YD
-$Z1
-cg
-AWinTypes=Windows;WinProcs=Windows;Dbi
www.eeworm.com/read/122887/14662192
exe combination.exe
www.eeworm.com/read/122887/14662201
dof combination.dof
[FileVersion]
Version=7.0
[Compiler]
A=8
B=0
C=1
D=1
E=0
F=0
G=1
H=1
I=1
J=0
K=0
L=1
M=0
N=1
O=1
P=1
Q=0
R=0
S=0
T=0
U=0
V=1
W=0
X=1
Y=1
Z=1
ShowHints=1
ShowWarnings=1