代码搜索：PLEASE
找到约 10,000 项符合「PLEASE」的源代码
代码结果 10,000
www.eeworm.com/read/427233/8959597
m rdecision.m
% the program is with the risk decision analysis
% please input the decision matrix and the rule of your decision
input('the program is with the risk decision analysis')
m=input('Please input t
www.eeworm.com/read/427233/8959602
m lprogram.m
% the program is with the linear programming
% please input the parameter matrices and the standard form of the matlab optimization:"min" & "
www.eeworm.com/read/427233/8959618
m qprogram.m
% the program is with the quadratic programming
% please input the parameter matrices and the standard form of the matlab optimization:
input('the program is with the quadratic programming')
m=
www.eeworm.com/read/427233/8959677
m biprogram.m
% the program is with the binary integer linear programming
% please input the parameter matrices and the standard form of the matlab optimization:
input('the program is with the binary linear pro
www.eeworm.com/read/283815/8987208
txt readme.txt
______________________________________________________________________
> <
> PICos18 release 2.10
www.eeworm.com/read/185622/9002871
txt rfc356.txt
Network Working Group R. Alter
Request for Comments # 356 Bolt Beranek and Newman Inc.
NIC # 10598 June 21, 1972
Categories:
Updates:
Obsolet
www.eeworm.com/read/184656/9090479
txt gedebahe.txt
#include "math.h"
void Isprime()
{scanf("%d",&m);
k=sqrt(m);
for(i=2;ik) printf("%d is a prime muber\n",m);
else printf("%d is not a prime mnber",m);
}
v
www.eeworm.com/read/381378/9095469
m masked_fft.m
function y = masked_FFT(x,mask)
%
% Computes a 2D partial FFT transform,
% only for those frequencies for which
% mask is not zero. The result is returned
% in an array of size (k,1) where k is
% the
www.eeworm.com/read/379788/9176996
c 1.c
#include "stdio.h"
#include "conio.h"
main()
{
long a[256],b,d;
int n,i,j,m,k;
l1: m=1;
a[0]=1;
printf("Please input a number:");
scanf("%d",&n);
for(i=2
www.eeworm.com/read/182772/9191603
c knapsack01_dynprog.c
/* 0/1背包问题的动态规划法算法*/
#include
#include
#define ymax 100
#define nmax 100
double f[nmax][ymax];
void Knapsack(double p[], int w[], int c, int n) {
int y = 0, i =