代码搜索：countt
找到约 48 项符合「countt」的源代码
代码结果 48
www.eeworm.com/read/169299/9868214
vhw countt1.vhw
-- D:\FPGA\XC_9572
-- VHDL Test Bench created by
-- HDL Bencher 6.1i
-- Tue Apr 25 14:49:45 2006
--
-- Notes:
-- 1) This testbench has been automatically generated from
-- your Test Bench Wa
www.eeworm.com/read/169299/9868329
ant countt1.ant
-- D:\FPGA\XC_9572
-- VHDL Annotation Test Bench created by
-- HDL Bencher 6.1i
-- Tue Apr 25 14:49:46 2006
LIBRARY IEEE;
USE IEEE.STD_LOGIC_1164.ALL;
USE IEEE.STD_LOGIC_ARITH.ALL;
USE IEEE.STD_
www.eeworm.com/read/169299/9868363
ado countt1.ado
source {D:/Xilinx/data/projnav/scripts/VsimStopServer.tcl}
initIPC 1200
-- Auto Generated by Project Navigator to simulate
-- HDL Bencher Annotated Test Bench
--
vlib work
onbreak {resume}
oner
www.eeworm.com/read/169299/9869051
tbw countt1.tbw
www.eeworm.com/read/169299/9869068
ano countt1.ano
Annotate[10,Qout,0000]
Annotate[30,Qout,0000]
Annotate[50,Qout,0000]
Annotate[70,Qout,0000]
Annotate[90,Qout,0000]
Annotate[110,Qout,0000]
Annotate[130,Qout,0000]
Annotate[150,Qout,0001]
Annot
www.eeworm.com/read/395965/8141737
obj countt~1.obj
www.eeworm.com/read/375812/9349039
cpp acm.cpp
#include
void Fifo()
{
int p = 0; //物理块的数量
int physical[7] = {-1,-1,-1,-1,-1,-1,-1}; //存入物理块中的页号
int num = 0;
www.eeworm.com/read/366666/9805457
cpp usaco_4_3_1_buylow-最长不下降子序列的个数.cpp
/*
PROB: buylow
LANG: C++
*/
/*
这道题很有意思，乍一看，它就是最长下降子序列，第一个问题确实是这样，对于5000的规模我们很容易给出O(NlogN)的算法。
不过这道题目的第二问是要得出最长序列的个数，而且序列相同位置不同的都只能算一个。不知道各位大牛有没有NLgN的算法，反正我是想不出了……
那么都用N^2的动归算法吧，第一个问题：
ls[i]=m ...
www.eeworm.com/read/318184/13483638
bak rf51.c.bak
#include
#include
#define uint unsigned int
#define uchar unsigned char
uchar a _at_ 0x30;
uchar b _at_ 0x31;
uchar c _at_ 0x32;
uchar d _at_ 0x33;
uchar counth,countl
www.eeworm.com/read/318184/13483655
c copy of rf51.c
#include
#include
#define uint unsigned int
#define uchar unsigned char
uchar a _at_ 0x30;
uchar b _at_ 0x31;
uchar c _at_ 0x32;
uchar d _at_ 0x33;
uchar counth,countl