3.5
来源:互联网 发布:java开发薪资 编辑:程序博客网 时间:2024/05/16 06:03
#include<reg52.h>
void delay(unsigned char cnt);
void main()
{
unsigned int j;
unsigned char cnt;
while(1)
{
P0 = ~(0x01<<cnt);
delay(200);
cnt++;
if(cnt == 7)
{
cnt = 1;
for(j=0;j<8;j++)
{
P0 = ~(0x80>>j);
delay(200);
}
//P0 = 0x00;
//delay(200);
//P0 = 0xFF;
//delay(200);
}
}
}
void delay(unsigned char cnt)
{
unsigned char i,j;
for(i=0;i<cnt;i++)
{
for(j=0;j<255;j++);
}
}
void delay(unsigned char cnt);
void main()
{
unsigned int j;
unsigned char cnt;
while(1)
{
P0 = ~(0x01<<cnt);
delay(200);
cnt++;
if(cnt == 7)
{
cnt = 1;
for(j=0;j<8;j++)
{
P0 = ~(0x80>>j);
delay(200);
}
//P0 = 0x00;
//delay(200);
//P0 = 0xFF;
//delay(200);
}
}
}
void delay(unsigned char cnt)
{
unsigned char i,j;
for(i=0;i<cnt;i++)
{
for(j=0;j<255;j++);
}
}
0 0
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.5
- 3.4 3.5
- TFT_LCD(3.5")
- hdu1.3.5
- javaSE 3.5
- TFT_LCD(3.5")
- CareerCup-3.5
- MQTT从零到实现发布端和订阅端相互通信实例
- 数据结构实验之栈一:数制转换
- MFC listCtrl 拖放文件
- JS中的正则表达式
- java再复习——线程的安全问题以及同步
- 3.5
- 问题 G: Vegetable and Road【并查集】
- [String Table] Boggler Solver
- 快速幂和素数筛
- #1473 : 小Ho的强迫症(扩展欧几里得)@
- LeetCode237. Delete Node in a Linked List
- 什么是Z语言
- 开始技术博客之旅
- [LeetCode]Longest Increasing Path in a Matrix(Java)