代码搜索：Algorithm
找到约 10,000 项符合「Algorithm」的源代码
代码结果 10,000
www.eeworm.com/read/363772/9936361
txt readme.txt
This zip file contains ...
1. Source code for the freeware component - TDiff - written in
Borland's Delphi programming language. This component dramatically
simplify programming tasks tha
www.eeworm.com/read/167647/9957512
cmd link.cmd
/*
* Copyright 2002 by Texas Instruments Incorporated.
* All rights reserved. Property of Texas Instruments Incorporated.
* Restricted rights to use, duplicate or disclose this code are
*
www.eeworm.com/read/363292/9962819
cpp md5about.cpp
#include "stdafx.h"
#include "MD5About.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
//Copyright text for help-about dialog
const C
www.eeworm.com/read/362573/9990578
cpp zoj2019.cpp
#include
#include
using namespace std;
map a, b;
int n, m;
int main(){
int t;
while (EOF != scanf("%d %d", &n, &m)){
a.clear(); b.clear();
www.eeworm.com/read/362573/9990596
cpp zoj1820.cpp
#include
using namespace std;
int num[10010];
int n;
int main(){
while (scanf("%d", &n) != EOF && n != 0){
if ((n * (n + 1)) % 4 != 0){
printf("0\n\n");
www.eeworm.com/read/362570/9990655
cpp poj2386.cpp
#include
const int dx[8] = { 0, -1, -1, -1, 0, 1, 1, 1};
const int dy[8] = { -1 ,-1, 0, 1, 1, 1, 0, -1};
int n, m, i, j, t;
char g[110][110];
int mk[110][110];
v
www.eeworm.com/read/362570/9990747
cpp poj3273.cpp
#include
using namespace std;
int a[100000];
int n, m;
int low, high, mid;
bool ok(int x)
{
int i, t = a[0], p = 1;
for (i = 1; i < n; i++)
{
www.eeworm.com/read/362246/10009854
pl references.pl
{
"Anderson62" =>"T.W.Anderson and R.R.Bahadur. Classification into two
multivariate normal distributions with differrentia covariance matrices.
Anals of Mathematical Statistics, 33:420--431, Ju
www.eeworm.com/read/362008/10023882
m contents.m
% HMM's
% HMM_Backward - HMM backward algorithm
% HMM_Boltzmann - Find the transition matrices of an HMM using Boltzmann networks
% HMM_Decoding - Find probable states fro
www.eeworm.com/read/166306/10024354
m linprog.m
function [x,fval,exitflag,output,lambda]=linprog(f,A,B,Aeq,Beq,lb,ub,x0,options)
%x=linprog(f, A, b)求解线性规划
% min z = f'x, Ax ≤ b；
%x=linprog(f, A, b, Aeq, beq)求解线性规划：
% min