-
mp3
The first task at hand is to set up the endpoints appropriately for this example. The following code switches the CPU clock speed
to 48 MHz (since at power-on default it is 12 MHz), and sets up EP2 as a Bulk OUT endpoint, 4x buffered of size 512, and EP6
as a Bulk IN endpoint, also 4x buffered of size 512. This set-up utilizes the maximum allotted 4-KB FIFO space. It also sets up
the FIFOs for manual mode, word-wide operation, and goes through a FIFO reset and arming sequence to ensure that they are
ready for data operations(The first task at hand is to set up the endpoints appropriately for this example. The following code switches the CPU clock speedto 48 MHz (since at power-on default it is 12 MHz), and sets up EP2 as a Bulk OUT endpoint, 4x buffered of size 512, and EP6as a Bulk IN endpoint, also 4x buffered of size 512. This set-up utilizes the maximum allotted 4-KB FIFO space. It also sets upthe FIFOs for manual mode, word-wide operation, and goes through a FIFO reset and arming sequence to ensure that they areready for data operations)
- 2007-12-26 19:22:07下载
- 积分：1
-
1Button-Devices
说明： 1 button device with bascom avr
- 2019-05-06 19:09:58下载
- 积分：1
-
TP Texture
tp texture for try upload object in c
- 2019-06-24 06:40:21下载
- 积分：1
-
vc++专家门诊
说明： vc++专家门诊，很实用，适于初学者(vc++ expert,very practical,be fit for beginner!)
- 2005-10-10 11:41:40下载
- 积分：1
-
Texture-Mipmap
基于OpenSceneGraph手动构建Miapmap，实现纹理自动Miapmap加载，可以调节纹理的精细级别～(Based on OpenSceneGraph manually build Miapmap, to achieve automatic Miapmap texture loading, you can adjust the level of the fine texture ~)
- 2013-12-19 23:04:54下载
- 积分：1
-
EULER1
说明： Euler 回路问题
.问题描述：
对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次
的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。
.编程任务：
对于给定的图G，编程计算图G 的一条Euler 回路。
.数据输入：
由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个
顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示
图G 的一条边(u,v) 。
.结果输出:
将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)
- 2006-03-29 21:31:15下载
- 积分：1
-
zuiduanlujing
基于VB的最短路径分析，用于地图最短路径的实现(VB-based shortest path analysis, shortest path for the realization of the map)
- 2010-05-15 00:30:23下载
- 积分：1
-
aoyunwuhuan
在VC++下面用MFC类库实现的绘制奥运五环的程序源码(In VC++ Following MFC class library with five Olympic rings realize the mapping procedure source)
- 2008-05-10 19:24:27下载
- 积分：1
-
Vc6
模拟银行卡交易流程的详细讲解，内涵丰富，采用VC++(Explain in detail the simulated bank card transaction process, rich content, using VC++)
- 2013-12-26 20:09:23下载
- 积分：1
-
20171204
日常基本练习，开关灯实现，蛇形输出，竖式输出(Daily basic exercises, switch lights, serpentine output)
- 2017-12-16 13:37:23下载
- 积分：1
