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

server2003 ϵͳ CÅ̲»¹»ÓÃÁË£¬Ôõôµ÷Õý´óС

ÓÐʲôÈí¼þÂð£¿
Server Magic?



¸ã¸öpeϵͳ°É,UÅ̹âÅ̵ͼÐÐ,ÀïÃæÓй¤¾ß¿ÉÒÔµ÷,ÕâÑù¸úÄãµÄ03ϵͳ¾Íûʲô¹ØÏµÁË,·½±ã

pq 8.05 ¼´¿É½â¾ö£¡





ÖØÐÂ×°¸ö°É

Ö»ÇÀ7Â¥¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£

µ÷ÏÂÐéÄâÄÚ´æÄØ(¡Ño¡Ñ)£¿


Ïà¹ØÎÊ´ð£º

VFPÈçºÎµ÷ÓÃCº¯Êý - ÆäËûÊý¾Ý¿â¿ª·¢ / VFP

ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿

ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£

Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......

C#ÌîÍøÒ³±íµ¥µÄÎÊÌâ - .NET¼¼Êõ / C#

ÎÒÕâÀïÓÐÒ»¸öµÇ½WIFIÍøÂçµÄÒ³Ãæ¡£ÓÉÓÚWIFI¾­³£¶ÏÏߣ¬ËùÒÔÒª·´¸´µØÔÚÕâ¸öÍøÒ³Éϵǽ£¬Ã»·¨ÎÞÈËÖµÊØ¡£
ËùÒÔ£¬ÎÒÏë×öÒ»¸öC#³ÌÐò£¬·ÅÒ»¸öwebbrowser¿Ø¼þ£¬×Ô¶¯Ìî±í²¢×Ô¶¯µã»÷Ìá½»°´Å¥¡£
ÎÊÌâÒ»£º
»ù±¾ÕÕÍøÉÏÕҵijÌÐò ......

Çóc³ÌÐò - C/C++ / CÓïÑÔ

CÓïÑÔ±à³Ì ´Ó¼üÅÌÉÏÊäÒ»¸öµ¥´Ê Åжϵ¥´ÊÊÇ·ñÔÚ´Ê¿âÓУ¬´Ê¿âÊÇÒ»¸öÎı¾¡£
scanf("%c",&c);
if()ÅжϾÍÐÐÁË¡£
ÇÀSF¡£
дµÄ¶Ì

ÒýÓÃ
scanf("%c",&c);
if()ÅжϾÍÐÐÁË¡£
ÇÀSF¡£ ......

°ïæ¿´¿´Õ⼸¸ö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 ......

ÓÃC±àдָ¶¨¾ùÖµ·½²îµÄ¸ß˹ÔëÉù - C/C++ / CÓïÑÔ

¸øÒÑ֪ͼÏñÌí¼Ó¸ß˹ÔëÉù£¬ÇëÎʸß˹ÔëÉùÊÇÔõôʵÏֵģ¿¾ùÖµ·½²î·Ö±ðΪu£¬v¡£
½²Ò»ÏÂ˼·ҲÐа¡¡£¡£¡£¡£¡£¡£
csdn ¸ßÊÖÔÆ¼¯µÄµØ·½¡£¡£¡£¡£¡£¡£

http://zhidao.baidu.com/question/71224083.html

2Â¥¸øµÄÊÇÒ»¸ ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ