代码搜索:QL

找到约 821 项符合「QL」的源代码

代码结果 821
www.eeworm.com/read/453950/7403363

bak jiaotongdeng.v.bak

module jiaotongdeng(clk,clr,qh,ql,ra,ya,ga,rb,yb,gb); input clk,clr; //output[1:0] scan; //output[6:0] seg7; output ra,ya,ga,rb,yb,gb; output[3:0] qh,ql; reg clk1khz,clk1hz; reg count1,count2
www.eeworm.com/read/453950/7403428

bak jiaotongdeng_con.v.bak

module jiaotongdeng_con(clk,clr,qh,ql,ra,ya,ga,rb,yb,gb); input clk,clr; //output[1:0] scan; //output[6:0] seg7; output ra,ya,ga,rb,yb,gb; output[3:0] qh,ql; reg clk1khz,clk1hz; reg count1,co
www.eeworm.com/read/448932/7522028

cpp 4838851_re.cpp

#include #include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[41000]; int ql; int hash[200000]; int x[210]; int y[210]; int n; int getgong
www.eeworm.com/read/448932/7522030

cpp 4838367_wa.cpp

#include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[400010]; int ql; int hash[100000]; int x[210]; int y[210]; int n; int getgong(int x,int y) {
www.eeworm.com/read/448932/7522035

cpp 4838512_re.cpp

#include #include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[40010]; int ql; int hash[300010]; int x[210]; int y[210]; int n; int getgong
www.eeworm.com/read/448932/7522037

cpp 4838345_wa.cpp

#include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[400010]; int ql; int hash[100000]; int x[210]; int y[210]; int n; int getgong(int x,int y) {
www.eeworm.com/read/448932/7522039

cpp 4838493_re.cpp

#include #include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[400010]; int ql; int hash[200010]; int x[210]; int y[210]; int n; int getgon
www.eeworm.com/read/448932/7522040

cpp 4838826_re.cpp

#include #include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[41000]; int ql; int hash[300010]; int x[210]; int y[210]; int n; int getgong
www.eeworm.com/read/448932/7522041

cpp 4838385_wa.cpp

#include #define key 99983 using namespace std; struct ve { int x,y; int num; }q[400010]; int ql; int hash[100000]; int x[210]; int y[210]; int n; int getgong(int x,int y) {
www.eeworm.com/read/445555/7593633

cpp 007.cpp

#include #include #include #include int *qx,*qy,*qr,*ql,*line,quse=0; int pd(int ,int); void main() { char k; printf(" 2005级王恩涛 求解n皇后的全部