代码搜索：MAXQ

找到约 72 项符合「MAXQ」的源代码

代码结果 72
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/441258/7672236

pdf maxq3180_cn.pdf

·
www.eeworm.com/read/396768/8091204

pdf maxq3180_cn.pdf

·
www.eeworm.com/read/256998/11961536

cpp nhuanghou ok.cpp

#include //#include #define MAXQ 100 int N, t; int qx[MAXQ], qy[MAXQ]; int cure; //char c; int cheak(int x, int y) //检测(x,y)处的皇后是否与已有皇后冲突，同列、同斜线均为冲突。 { if
·
www.eeworm.com/read/362570/9990816

cpp poj3288_bfs.cpp

#include using namespace std; const int MAXN = 2010; const int MAXQ = 1000000; int n, m; int g[MAXN][MAXN], d[MAXN][MAXN], qx[MAXQ], qy[MAXQ]; int qn; void update(int x, int y, in
·
www.eeworm.com/read/452050/7451428

cpp 3078801_wa.cpp

#include #include using namespace std; struct node { char name[21], type[21]; int id; int price, quality; }com[1001]; int n, b; int pos[1001]; bool cmp(node
·
www.eeworm.com/read/452050/7451430

cpp 3078796_ce.cpp

#include #include using namespace std; struct node { char name[21], type[21]; int id; int price, quality; }com[1001]; int n, b; int pos[1001]; bool cmp(node
·
www.eeworm.com/read/452050/7451431

java 3078800_ce.java

#include #include using namespace std; struct node { char name[21], type[21]; int id; int price, quality; }com[1001]; int n, b; int pos[1001]; bool cmp(node
·
www.eeworm.com/read/307959/13712691

txt 在c51上实现的队列.txt

在c51上实现的队列 /******************************************** File:q.c Description: 在51上实现的队列 ********************************************/ ＃i nclude #define MAXQ 10 typedef struct {
·
www.eeworm.com/read/372058/9523444

m 8qam调制仿真.m

clc clear all M=8; %8QAM调制，这里可以修改成任意的数，16、32、64 m=100; %发送的符号数 n=10; %每个符号的抽样数 levels=sqrt(M); %QAM调制个数 l = m*n; %总的发送长度 yd = zeros(1,l-n+1); %
·
www.eeworm.com/read/452050/7451433

cpp 3078886_wa.cpp

#include #include using namespace std; struct node { char name[21], type[21]; int id; int price, quality; }com[1001]; int n, b, ID; int pos[1001]; bool cmp(
·