资源列表
Files1
- avr uart filea vr uart filea vr uart filea vr uart filea vr uart fileavr uart file-avr uart fileavr uart fileavr uart fileavr uart fileavr uart fileavr uart fileavr uart fileavr uart fileavr uart fileavr uart file
capitalreversesmall
- converts capital to small letters
simplescan.c.tar
- this is a good c++ example to scan
daima3
- 找出两个字符串中的最大公共字串，如"abccaddde"和"dgcacadde"的最大公共字串是"cadd"-Identify the largest public string two strings, such as the largest the " abccaddde" and " dgcacadde" public string " cadd"
SRAM_Control
- common sram controller
1
- 题目：输入两个非降序列，转换成两个非升序列，合并成一个非升序列。 要求：用链表实现。-Title: Enter the two nondecreasing sequence into two non-l sequences into a non-l sequence. Requirements: Chain implementation.
mysql.class
- 一个实现分页的类,非常不错哦，初次学习php的可以使用下-A class that implements paging, very good, oh
add_train_files
- Add train by matlab project
sampling
- power sampling in noise . u can test it .its my first code i hav uploaded
beibao
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2） （1，4，5） （8，2） （3，5，2）。 提示：可利用回溯法的设计思想来解决背包问题。首先将物品排成一列，然后顺序选取物品装入背包，假设已选取了前i 件物品之后背包还没有装满，则继
Query-Tugas
- Please read your package and describe it at least 40 bytes in English
radius
- 根据半径计算圆的周长和面积，定义计算圆的周长的函数fCir_L()，定义计算圆的面积的函数-Function calculates the circumference of a circle of radius calculated according to function fCir_L perimeter and area of a circle, defined (), the definition of the calculation of the area of a circle