Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

c/c++Ò²ºÜÀËÂþ

°®Ç飬һ¸ö¼ÈÎÂܰÓÖ¾À½áµÄ´Ê¡£

´Ó¿ªÊ¼µÄ¹Ø×¢ÏòÎü£¬ÖмäµÄÄ¥ºÏì¶Ü£¬µ½×îºóµÄºÍгÏàÖªÏà°®¡£
´ó¼Ò¿´¿´ÏÂÃæÕâ¸öÊDz»ÊÇÒ²ÓеãÕâ¸öζµÀ£¡

*pˆ= *q; 
*qˆ= *p;
*pˆ= *q;
Ö¸Õë°¡¡­¡­
Èç¹ûp==q£¬ÄÇôÉÏÃæ¾ÍÊÇÒ»³¡±¯¾ç¡­¡­

±¯¾ç¡£¡£¡£

ÒòΪ°®Çé±¾À´¾ÍÔÆÀïÎíÀïµÄ£¬ËùÒÔÓÃ*µã׺һÏ£¬Ôö¼ÓËýµÄÉî¶È


Ö¸ÕëµÄ°®Çé¡£¡£¡£

Ôõôû¿´¶®¡­¡­

LZºÜÓÐÒâ˼

df

Çó½âÊÍ

àÅ£¬ÎÒ½Óµã·Ö°É

ÒýÓÃ
Çó½âÊÍ
¶÷

ºÙºÙ¡£¡£ÓÐÒâ˼¡£¡£¡£

pºÍqºÃ±È˧¸çºÍö¦Å®

*p ^= *q;  Ãæ¶ÔÃæ£º´¦ÓÚÁÔÑÞ״̬£¬Ï໥ÎüÒý£¬»¥Ïà¹Ø×¢

*q ^= *p;  ±³¶Ô±³£º×ߵĽüÁË£¬·¢ÏÖÁ½¸öÈ˶¼Óд̣¬ÓÚÊÇì¶Ü£¬Ä¦²ÁÄÑÃâ³öÏÖÁË

*p ^= *q;  Ãæ¶ÔÃæ£º×îÖÕÏû³ýĦ²Á£¬Çóͬ´æÒ죬ºÍгµÄÈÚÈëÒ»¸öÕûÌåÁË¡££¨¶þÕßµÄÖµ½»»»ÁË£¬ÄãÊÇÎÒÁË£¬ÎÒ
Ò²ÊÇÄãÁË£¬Õß²»Êǰ®µÄÕæÚÐÂ

ÕâºÍ°®ÇéºÎÆäÏàËÆ£¡



²»ÊÇÖ¸Õ룬²»Ò²Ò»ÑùÂ𣿣¿
ÒýÓÃ
Ö¸Õë°¡¡­¡­
Èç¹ûp==q£¬ÄÇôÉÏÃæ¾ÍÊÇÒ»³¡±¯¾ç¡­¡­


´¿ÊôìÅÒ«£¬Ñо¿Õß»¹²»ÈçÈ¥¿´¿´²¼¶û´úÊý£¬»·ÄØ¡£

ûÓС£¡£¡£Õâ¸öζµÀ¡£


Ïà¹ØÎÊ´ð£º

execlÔõôµ÷ÓÃjava³ÌÐò - C/C++ / CÓïÑÔ

ÈçÌ⣬C/C++ÖеÄexeclÔõôµ÷ÓÃдºÃµÄjava³ÌÐò£¬
execl("/opt/java1.5/bin/java","MyClass",NULL);
ÕâÑùµÄ²»ÐÐŶ¡£

²»»á.

ÔËÐÐjava³ÌÐò
ÕÒ¹¤¾ß²é¿´Ò»ÏÂÄǸö³ÌÐòµÄÃüÁîÐÐ

ËÑË÷Ï£ºjni ......

C/C++/MFCȺ - C/C++ / ·Ç¼¼ÊõÇø

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

Çó½Ìc/c++ÓïÑÔÏà¹ØÎÊÌâ - C/C++ / CÓïÑÔ

ÓÐÒ»10*10¾ØÕ󣬳ýÈ¥µÚÒ»¸öµã£¨0£¬0£©ºÍ×îºóÒ»µã£¨9£¬9£©£¬»¹Óа˸öµãΪ1£¬ÆäËû¶¼Îª0£¬ÒªÇóÓöþάÊý×é±íʾ¡£°Ë¸öµãÊÇËæ»úÉú³ÉµÄ£¬±àдÏà¹Ø³ÌÐò±íʾ¾ØÕóËùÓпÉÄÜÇé¿ö¡£
ÕæÐÄÇó½Ì¸÷λ¸ßÊÖ£¬°¥£¡±¾ÈËÌ«²ËÁË£¡ºÇºÇ£¡
......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
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 ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ