代码搜索：minimum

找到约 5,594 项符合「minimum」的源代码

代码结果 5,594
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/248950/12534011

code15-101

1 0 1 0 0 0 0 1 1 1 0 1 1 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 1 0 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 1 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 1 1 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0
·
www.eeworm.com/read/248950/12534012

code15-140

1 0 0 0 1 0 0 1 0 1 1 0 0 1 1 1 0 0 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1 1 0 0 0 1 1 1 1 1 0 0 1 0 1 0 0 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 0 0 0 0 1 0 0
·
www.eeworm.com/read/248950/12534015

code15-132

1 1 1 0 0 0 1 1 1 1 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 1 1 1 0 1 1 1 0 0 0 0 1 0 1 0 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 0 1 1 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 0 1 0 0 1 1 1 0 0 0 1 1 1 0 0 0 1 0 0
·
www.eeworm.com/read/248950/12534022

code15-158

1 0 0 1 1 0 1 0 1 1 0 0 0 0 1 0 0 1 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 1 1 1 0 0 1 1 1 0 1 0 1 0 0 1 0 0 0 1 0 0 0 1 0 1 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 0 1 0 1 1 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 0 0
·
www.eeworm.com/read/334567/12585973

readme

README AND QUICK REFERENCE FS-1015 LPC-10E FOR MATLAB 2/5/96 1.0 SYSTEM REQUIREMENTS * 386SX w/ 387 FPU minimum; 486DX4-100 or better recommended. * 4 MB RAM minimum; 8+ MB recommended.
·
www.eeworm.com/read/134894/13971920

m direct_search.m

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Nelder/Mead Simplex Method for Direct Search %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %
·
www.eeworm.com/read/201477/15407497

out rvbits.out

Minimum length is 82 kay values are 1 2 2 3 4 New segment begins at 1 New segment begins at 2
·
www.eeworm.com/read/201477/15407782

out rcvbits.out

Minimum length is 82 kay values are 1 2 2 3 4 New segment begins at 1 New segment begins at 2
·
www.eeworm.com/read/107065/15613814

h random.h

// This file needs -*- c++ -*- mode // ============================================================================ // Random number generation interface // // (c) 2003 Ken Reed // // This is fr
·
www.eeworm.com/read/405817/11456376

cpp minimum cost(带权二分匹配km算法).cpp

#include #include #include using namespace std; const int NMAX = 160; int n,m,k; int xn,yn,num; int w[NMAX][NMAX]; int need[60][60]; int supply[60][60]; int c
·