ÎÒ×ÔѧÁËcºÍc++£¬Ö÷ÒªÊÇÔÚvc6.0µÄÈí¼þÉϽøÐÐһЩ³ÌÐòµÄ±àдºÍÐ޸ģ¬ÎÒÏëÇë½Ì¸öλ±à³ÌµÄ¸ßÊÖ£¬ÔõÑù²ÅÄÜÈÃ×Ô¼º±àд³öÏñvc6.0¹¤¾ßÄÇÑùµÄʵÓÃÐÔÈí¼þ£¬Èç¹ûÓж®µÄ£¬ÇëÄãÖ¸½Ì£¿Ð¡µÜÔÚ´ËÏÈлл¸÷λ´ó¸çÁË¡£
mfc?
¾«ÉñÉÏÖ§³ÖÂ¥Ö÷£¡
mfc?
ÓÃMFCµÄ¶àÎĵµ¿ò¼Ü
LZÏë×ö±àÒëÆ÷Âð£¿
ÓïÑÔÊÇÁ¢×ãÖ®±¾£¬¹àË®ÊǵÚÒ»Éú²úÁ¦£¬½Ó· ......
ÄÄλ¸ßÊÖ°ïæ°ÑC·Òë³Édelphi£¬¶àл
static void encipher(unsigned int *const v, const unsigned int *const k, unsigned int *const w)
{
register unsigned int
y = ntohl(v[0]),
z = ntohl(v[1]),
a = ntohl(k[0]),
b = ......
ÈçÌ⣺ÇóWindowsƽ̨ϵĿªÔ´or²»¿ªÔ´C/C++±à³Ì»·¾³?
CÓïÑÔ±àÒëÆ÷¶¼ÓÐÄÇЩ?ÄãÃÇ×ÔÈÏΪÄÇЩºÃÓ㡵±È»ÎÒÊdzõѧÕß¡£Ö®Ç°ÓùýTCwinTCDev-c++ C-free ȱµãÈçÏ£º
1. TCÖ»ÄÜÓüüÅÌ,Âé·³µÄÒªËÀ£¬¶øÇÒÀË·ÑÎÒʱ¼ä£»£º
2. winTC²»ÄÜÊä³öÖÐÎÄ£¬±ðŤµÄºÜ£»
3. Dev-c++ ......
¼ÙÉèÏÖÔÚÓÐÒ»¸öanimalÀàÊÇ»ùÀà
×ÓÀàÊÇrabbitÀà tigerÀà pigeonÀà hawkÀà
È»ºóÓÐÈý¸ö·½·¨run() fly() hunt()
ÆäÖÐrabbitÓ¦¸ÃÓµÓÐrun()
tigerÓ¦¸ÃÓµÓÐrun() hunt()
pigeonÓ¦¸ÃÓµÓÐfly()
hawkÓ¦¸ÃÓµÓÐfly() hunt()
ÎÊÌâÀ´ÁË ²»ÏëÔÚÿ¸ö×ÓÀàÀïÃæÖØ¸´ÊµÏÖͬÑùµÄ·½·¨ Ôõô°ìÄØ£¿
Ïȶ¨ÒåÈ ......
°ï°ï棬лл~
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 of the Floyd‐Warshall algorithm.
СÐı»·â£¬lz¿ÉÒÔʹÓÃgoogle~~~
ÕâЩһËÑÒ»´ó¶Ñ¡£´úÂ룬½Ì³ ......
µ½Ä¿Ç°ÎªÖ¹£¬´òÌýµÄ10¼¸¸öµÄͬѧ£¬³ýÈ¥ÉÙÊý¡°¿´ÂÛÎÄ¡±µÄ£¬¾ø´ó¶àÊý¶¼ÊÇjavaºÍ½Å±¾£¬C/C++¾ÍÎÒÒ»¸ö£¬ÊÇÈÙÐÒ»¹ÊDZ¯°§¡¡
É¢·Ö¡¡
±ÏÒµÉè¼Æ»¹ÒªÖ¸¶¨ÓïÑÔ£¿£¡Ð´³ö¸öºÜ°ôµÄÈí¼þ²»¾Í¿ÉÒÔ£¿ÎÒÃǶ¼ÊÇ×ÔÎÒÑ¡ÌâµÄ;)
ÒýÓÃ
±ÏÒµÉè¼Æ»¹ÒªÖ¸¶¨ÓïÑÔ£¿£¡Ð´³ö¸öºÜ°ôµÄÈí¼þ²»¾Í¿ÉÒÔ£¿ÎÒÃǶ¼ÊÇ×ÔÎÒÑ¡ÌâµÄ;)
ÎÒÃǵıÏÒµÉ ......