CÈçºÎµ÷ÓÃÆäËûÎļþ
Ãź¯ÊýÔÚmain.cÖУ¬ÏÖÏëµ÷ÓÃaÀïµÄº¯Êý£¬aÀïÓÐa.hºÍa.cÎļþ, ÎÒÏÖÔÚÔõôÒýÓÃÎļþÄØ£¿ÎÒʹÓÃvc6.0£¬²»ÖªµÀÔõô°ÑÎļþ°üº¬µ½ÏîÄ¿ÖУ¬ »¹ÓУ¬a.hÊÇÍ·Îļþ£¬a.cÊǾßÌåʵÏÖ£¬ÎÒ¸ÃʹÓÃʱ£¬¸ÄÒýÓÃÄĸöÎļþÄØ£¿ ºÜеÄÐÂÈË£¬ÇëÇó¸÷λǰ±²µÄ°ïÖú¡£
Õâ¸öÊÇ»ù±¾µÄ ¼ÈÈ»ÊÇ.c£¬±íʾΪC£¬¶ø²»ÊÇC++ ÄãֻҪʹÓÃ#include"a.h"¾ÍÐÐÁË¡¡¶ø²»ÓùÜa.c ×¢Ò⣬#include"a.h"ÒªÉèÖúù¤×÷·¾¶£¬»òÕßÖ±½Ó°üº¬µÄʱºò£¬¾ÍʹÓþø¶Ô»òÕßÏà¶Ô·¾¶ лл£¬¹âÒýÓÃa.h¾ÍÐаɣ¿ µ«Ôõô°Ñ¹¤×÷·¾¶ÉèÖõ½ÏîÄ¿ÖÐÄØ£¿ÎÒÔÙÕÒÕÒ.... a.hÀï¾ÍÒ»¸öº¯Êý int Test() { printf("aaa"); return 0; } ÎÒÔÚmain()ÖÐÈçºÎµ÷ÓÃÄØ£¿ ÕâÊÇÎÒÏÖÔÚµÄд·¨£¬µ±È»£¬a.h»¹Ã»ÓÐÌí¼Óµ½ÏîÄ¿ÖУ¬ÏÖÔÚ»¹ÊÇ´íÎóµÄ£¬µ«Èç¹ûÒýÓõ½ÏîÄ¿ÖкóÈçºÎÕýÈ·µ÷Óã¿ #include "a.h" int main() { a.Test(); return 0; } Ä㵱ǰ¹¤³ÌÎļþ(dsp/dsw)ËùÔÚĿ¼×Ô¶¯»áµ±×÷µ±Ç°Ä¿Â¼£¬²»ÐèÒªÄãÉèÖà ÎÒ¾õµÃÄãÊÇÐèÒª¶àµãµã½çÃæ£¬ÊìϤһϼ´¿É£¬±ðÈËÖ¸µ¼¿ÖÅÂûÓÐÄãÕҵĿì ÒýÓà лл£¬¹âÒýÓÃa.h¾ÍÐаɣ¿ µ«Ôõô°Ñ¹¤×÷·¾¶ÉèÖõ½ÏîÄ¿ÖÐÄØ£¿ÎÒÔÙÕÒÕÒ.... a.hÀï¾ÍÒ»¸öº¯Êý int Test() { printf("aaa"); return 0; } ÎÒÔÚmain()ÖÐÈçºÎµ÷ÓÃÄØ£¿ ÕâÊÇÎÒÏÖÔÚµÄд·¨£¬µ±È»£¬a.h»¹Ã»ÓÐÌí¼Óµ½ÏîÄ¿ÖУ¬ÏÖÔÚ»¹ÊÇ´íÎóµÄ£¬µ«Èç¹ûÒýÓõ½ÏîÄ¿ÖкóÈçºÎÕýÈ·µ÷Óã¿ #include "a.h" int main() { a.Test(); return
Ïà¹ØÎÊ´ð£º
#include"stdio.h" #include"stdlib.h" void ContrTwo(char i) { char str1[8]; itoa(i,str1,2); printf("%s",str1); } unsigned char leftRot(char str,int i); unsign ......
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡ ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
ÎÒÕâÀïÓÐÒ»¸öµÇ½WIFIÍøÂçµÄÒ³Ãæ¡£ÓÉÓÚWIFI¾³£¶ÏÏߣ¬ËùÒÔÒª·´¸´µØÔÚÕâ¸öÍøÒ³Éϵǽ£¬Ã»·¨ÎÞÈËÖµÊØ¡£ ËùÒÔ£¬ÎÒÏë×öÒ»¸öC#³ÌÐò£¬·ÅÒ»¸öwebbrowser¿Ø¼þ£¬×Ô¶¯Ìî±í²¢×Ô¶¯µã»÷Ìá½»°´Å¥¡£ ÎÊÌâÒ»£º »ù±¾ÕÕÍøÉÏÕҵijÌÐò ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
°ï°ï棬лл~ 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 ......