代码搜索:Num

找到约 10,000 项符合「Num」的源代码

代码结果 10,000
www.eeworm.com/read/299792/7832411

c 15ikey0.c

#define HEAPSORT struct student #define KEY age HEAPSORT { int num; char name[8]; char sex; int age; double score; }; #include "stdio.h" #include
www.eeworm.com/read/399765/7838576

c iicdisplay.c

#include "relpc764.h" #include "..\IIcDriver.h" #include "IIcDisplay.h" extern data char* IIcXmtptr; char data n; void DisplayInit() { IIcSlvAdr = IIcDisplay; IIcByteCnt = 4;
www.eeworm.com/read/399640/7843816

cpp loser tree.cpp

#include "funtion.h" #include "stdio.h" #include "stdlib.h" #include "string.h" #include "iostream.h" #include "time.h" #define k 4 #include "stack.h" #define M 10 FILE *fp[k +
www.eeworm.com/read/299577/7844553

cpp 回溯法.cpp

#include #include #include #include using namespace std; inline int good(int x,int y,int s[30][30],int n) { if(x>=0&&x=0&&y
www.eeworm.com/read/299495/7846909

c 小数四位显示.c

/*用到的变量 i,w,num ;*/ void ledwork(void) /*数码管工作函数*/ { wei( ); if(i==0) disp0(); if(i==1&&w>=2) disp1(); if(i==2&&w>=3) disp2(); if(i==3&&w>=4) disp3(); } void wei(v
www.eeworm.com/read/299495/7846911

c 四位小数显示.c

/*用到的变量 i,sum ;*/ void ledwork(void) /*数码管工作函数*/ { /*要用的全局变量 uint led[10]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d,0x07,0x7f,0x6f}; uint ledp[10]={0xbf,0x86,0xdb,0xcf,0xe6,0xed,0xfd,0x8
www.eeworm.com/read/299495/7846929

c compute.c

#include #define uint unsigned int static unsigned char data dl,temp,de; static unsigned char data IRCode[3],IRCON,IRCON2; bit DT=0; bit flag; /////////// 0 对应串口 1 遥控 u
www.eeworm.com/read/299495/7846933

c 小数compute.c

#include #define uint unsigned int static unsigned char data dl,temp,de; static unsigned char data IRCode[3],IRCON,IRCON2; bit DT=0; bit flag,flag_p; /////////// 0 对应串口 1
www.eeworm.com/read/299495/7846945

c check.c

#include unsigned char code led[16]={0x3f,0x06,0x5b,0x4f, 0x66,0x6d,0x7d,0x07,0x7f,0x6f, 0x77,0x7c, 0x39,0x5e,0x79,0x71}; unsigned int k,i,num=0,w,j; sbit led0=P1^0; sbit led1=P1^1; sbi
www.eeworm.com/read/434704/7847326

c 8_5_1.c

/* ======================================== */ /* 程式实例: 8_5_1.c */ /* 找寻加权图形的最短路径(Dijkstra方法) */ /* ======================================== */ #define MAXLEN 1000