代码搜索：push
找到约 10,000 项符合「push」的源代码
代码结果 10,000
www.eeworm.com/read/474431/6809328
c g_client.c
/*
** A client that uses the generic stack module to create two stacks
** holding different types of data.
*/
#include
#include
#include "g_stack.h"
/*
** Create two sta
www.eeworm.com/read/135259/13944982
h msado15.h
#pragma option push -b -a8 -pc -A- /*P_O_Push*/
#include "adoint.h"
#pragma option pop /*P_O_Pop*/
www.eeworm.com/read/405817/11456406
cpp drainage ditches(high_label_preflow_push)o(v^2e).cpp
//high label preflow push O(V^2*E)
#include
#include
#include
#include
#include
using namespace std;
const int NMAX = 210;
//earn盈余,net剩余网络,hi
www.eeworm.com/read/383614/8932617
txt 顺序栈入栈算法.txt
int push(int s[],int x,int top)
{
if(top==M)
{ printf("overflow");
return(-M);
}
s[top]=x;
return(++top);
}
www.eeworm.com/read/174714/9575881
hin brnstnd.hin
Best Of Show: Daniel J. Bernstein
Daniel J. Bernstein
New York University
Judges' comments:
Make and run. Try:
make brnstnd
brnstnd < sorta.i2+2
For info on more e
www.eeworm.com/read/278221/10559367
asm cstart.asm
; File : $Workfile: CSTART.ASM$
;
; Description :
;
; Original Author : DIGITAL RESEARCH
;
; Last Edited By : $CALDERA$
;
;---------------------------------
www.eeworm.com/read/462726/7197469
txt ch3_1.txt
int push(int s[],int x,int top)
{
if(top==M)
{ printf("overflow");
return(-M);
}
s[top]=x;
return(++top);
}
www.eeworm.com/read/462721/7197503
txt ch3_1.txt
int push(int s[],int x,int top)
{
if(top==M)
{ printf("overflow");
return(-M);
}
s[top]=x;
return(++top);
}
www.eeworm.com/read/145241/12743879
txt ch3_1.txt
int push(int s[],int x,int top)
{
if(top==M)
{ printf("overflow");
return(-M);
}
s[top]=x;
return(++top);
}
www.eeworm.com/read/329762/12935194
asm cstart.asm
; File : $Workfile: CSTART.ASM$
;
; Description :
;
; Original Author : DIGITAL RESEARCH
;
; Last Edited By : $CALDERA$
;
;---------------------------------