¹ØÓÚPS2¼üÅ̵ÄC³ÌÐò
ÓÃ51²Ù×÷ºÍ¼ì²âPS2¼üÅÌ£¬½ÓÊÕÊý¾ÝÒѾ¸ã¶¨ÁË£¬¿ÉÊÇ·¢ËÍÊý¾ÝÈ´³ö´í£¬²»ÖªµÀÔõô»ØÊ¡£¸øËüµÄÃüÁîºÍËüËùÖ´ÐеÄÍêÈ«²»Í¬£¬Çë¸ßÊÖÖ¸½ÌÏ£¬µ½µ×ÊÇÄÄÀï´íÁË£¬»¹ÊÇû´í£¬µç·½ÓµÃ²»¶Ô£¿£¿½ÓÊÕº¯ÊýÊÇÕâÑùµÄ¡£
void send(uchar Data)
{
uchar i,high=0;
EA=0;
EX0=0;//¹Ø±ÕÖжÏ
CLK=0;
delay10us(11);
DATA=0;
delay10us(2);
CLK=1;
while(CLK==1);
//¿ªÊ¼·¢ËͰËλÊý¾Ý
for(i=0;i<=7;i++)
{
if(Data & 0x01)
{
DATA=1;
high++;
}
DATA=(Data>>1);
while(CLK==0);
while(CLK==1);
}
if(high%2==0) DATA=1; //ÉèÖÃÆæÐ£Ñéλ
else DATA=0;
while(CLK==0);
while(CLK==1);
DATA=1;
while(DATA==1);
while(CLK==1);
while(DATA==0);
while(CLK==0);
EA=1;
EX0=1;//дÊý¾Ý³ÌÐò½áÊøºó¿ªÖжÏ
}
È«²¿³ÌÐòÊÇÕâÑùµÄ£º
#include <reg52.H>
#include <intrins.H>
#include <head.h>
#define uchar unsigned char
#define uint unsigned int
#define LCD_DATA P2 //Êý¾Ý¿Ú
sbit RS = P1^5; //²¢ÐеÄÖ¸Áî/Êý¾ÝÑ¡ÔñÐźÅ, HÊý¾Ý, LÃüÁî
sbit RW = P1^7; //²¢ÐжÁдѡÔñÐźÅ, H¶Á, Lд
sbit E = P1^6; //²¢ÐÐʹÄܶË, HÓÐЧ, LÎÞЧ
sbit PSB = P1^1; //²¢/´®½Ó¿ÚÑ¡Ôñ, H²¢,L´®
sbit RET
Ïà¹ØÎÊ´ð£º
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
ÓÐÒ»10*10¾ØÕ󣬳ýÈ¥µÚÒ»¸öµã£¨0£¬0£©ºÍ×îºóÒ»µã£¨9£¬9£©£¬»¹Óа˸öµãΪ1£¬ÆäËû¶¼Îª0£¬ÒªÇóÓöþάÊý×é±íʾ¡£°Ë¸öµãÊÇËæ»úÉú³ÉµÄ£¬±àдÏà¹Ø³ÌÐò±íʾ¾ØÕóËùÓпÉÄÜÇé¿ö¡£
ÕæÐÄÇó½Ì¸÷λ¸ßÊÖ£¬°¥£¡±¾ÈËÌ«²ËÁË£¡ºÇºÇ£¡
......
°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
ÇëÎÊC++ÀïµÄÓÃCInternetSession Ä£ÄâHTTP·¢ËÍÇëÇóºó£¬ ÈçºÎ»ñµÃ·þÎñÆ÷ÔÚä¯ÀÀÆ÷ÀïÏìÓ¦µÄURL´®°¡£¿
¾ÍÊÇ ·þÎñÆ÷»á·µ»ØÒ»¸ö Ò³Ãæ¸øÎÒÁË ¶ø´Ëʱä¯ÀÀÆ÷µÄURLµØÖ·Ò²¾ÍÏ൱ÊÇ·þÎñ ......
±ÈÈçµ±³ÌÐò³öÏֶδíÎóʱ£¬ÈçºÎÈóÌÐòÖØÐ¿ªÊ¼£¬¶ø²»ÊDZ»ÏµÍ³ÖÕÖ¹¡£
ÄãÏëÒì³£´¦ÀíÂð£¿
C²»Ö§³Ö¡£
ÔÙ˵£¬Òì³£ºÍ´íÎóÊDz»Í¬µÄ¡£
¶Î´íÎó¾ÍÓ¦¸ÃÖÕÖ¹¡£
assert()
abort()
exit()
µ±³ÌÐò³öÏֶδíÎóʱ,ÎÞ· ......