GIF images into RGB format decompression procedures can be, converted into gray

gif图像的编解码实现，在vc环境下直接编译即可！-realization of gif graphic compression/decompression,which can be compiled in VC environment.

#define Mess1 PORTB.0 #define Mess2 PORTD.7 #define Mess3 PORTD.6 #define Mess4 PORTD.5 #define Mess5 PORTB.7 #define Mess6 PORTB.6 #define Buzzer PORTD.0 #define Zone1 PINC.0 #define Zone2 PINC.1 #define Zone3 PINC.2 #define Zone4 PINC.3 #define Zone5 PINC.4 #define Zone6 PINC.5 #define Zone7 PIND.1 #define Red PORTB.7- #define Mess1 PORTB.0 #define Mess2 PORTD.7 #define Mess3 PORTD.6 #define Mess4 PORTD.5 #define Mess5 PORTB.7 #define Mess6 PORTB.6 #define Buzzer PORTD.0 #define Zone1 PINC.0 #define Zone2 PINC.1 #define Zone3 PINC.2 #define Zone4 PINC.3 #define Zone5 PINC.4 #define Zone6 PINC.5 #define Zone7 PIND.1 #define Red PORTB.7

数据卡哪家的黄金时代环境是否将获得积分获得尽快回复对方就会 几点回家-kjd.kjgkfjdkjsgklfjg.kdfj.kndklfdngfgjdhj,shvn,mccccxnjgnvcm,x dkslfkdj

单片机播放音乐,是学习单片机的最好途经,资料详细,认真仔细-SCM music, is to learn the best microcontroller through the data in detail, a careful look at

音频ADPCM编解码器，采用标准C语言编程，实现G.711,G.72 3,16K,24K,32K算法-ADPCM audio codec, using standard C language programming, realize G.711, G.72 3,16 K, 24K, 32K Algorithm

介绍各种压缩的特点以及应用，欢迎大家位下载！-Introducing a wide range of compression characteristics of the application, Welcome to the digital download!

12887时钟计数器,提供标准的时钟,定时,显示时间-12887 clock counter, provides a standard clock, time, display time

通过对键盘的编程，实验对键值的读取，实现计算器的功能，并将结果在数码管上显示。-Programming through the keyboard, the key test of reading, realize the functions of the calculator and the results in the digital tube display.

硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 硬币找钱 -Coin coin find money find money find money coins coin coin find money find money find money coins coin coin find money find money find money coins coin coin find money find money find money coins coin coin find money find money find money coins coin coin find money find money find money coins coin coin find money find money find money coins coin coin find money find money find money coins

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.