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

ÈçºÎÓÃvs2008¿ª·¢C/S°æµÄ³ÌÐò

ÈçºÎÓÃvs2008¿ª·¢C/S°æµÄ³ÌÐò,Çë´ó¼Ò¸ø¸ø³ö¾ßÌåµÄ·½·¨£¬Ð¡µÜ³õѧ£¬ÇëºÃÐĵĴó¸ç´ó½ã¶à¶à¹ØÕÕÁË£¡£¡
½¨¸öWinFormsÏîÄ¿ÈçºÎ£¿

¸ÃÔõô¿ª·¢¾Í¿ª·¢ß£¬ºÍvs2008Î޹أ¬ºÍc#ÎÞ¹Ø

н¨Winform³ÌÐò¾Í¿ÉÒÔÁË

¾ßÌåÀ´ËµÓ¦¸ÃÈçºÎ²Ù×÷

ÒýÓÃ
н¨Winform³ÌÐò¾Í¿ÉÒÔÁË


ÍÛ¹þ¹þ


н¨--ÏîÄ¿--Windows´°ÌåÓ¦ÓóÌÐò

ÒýÓÃ
н¨Winform³ÌÐò¾Í¿ÉÒÔÁË


µÄÈ·Èç´Ë£¬ÎÒҲ˳´øÑ§Ï°ÁË£¬ºÇºÇ¡£¡£¡£

ÏÈÁ˽â»ù±¾Óï·¨¡£¡£¡£ÕÒ¼¸¸öÀý×Ó×ö×ö¡£¡£¡£ÔÙ¿´¿´ÒªÊµÏÖʲô¹¦ÄÜ¡£¡£¡£²éÕÒÏîÄ¿×ÊÁÏ¡£¡£¡£¿ª·¢¡£¡£¡£


Ïà¹ØÎÊ´ð£º

linux»·¾³ÏÂgethostbynameº¯ÊýÎÊÌâ - C/C++ / CÓïÑÔ

дÁ˸ö²âÊÔ³ÌÐòÈçÏÂ
   
  struct hostent *hp; 
char AlarmDevIP[20];  
  int x2;

hp = gethostbyname("www.google.com");
if (hp)
{ ......

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

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

C/SÏîÄ¿¼Ü¹¹Éè¼Æ----ÇóÖú - Java / Java SE

±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬ 
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£ 
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......

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

Ϊʲôxml²»ÄÜÏÔʾ°¢À­²®ÎÄ - C/C++ / C++ ÓïÑÔ

ΪʲôÎҵijÌÐòµ÷ÓÃXMLÅäÖÃÎļþÖеİ¢À­²®ÎÄÏÔʾ²»³öÀ´£¿ÆäËûµÄÓïÖÖ¶¼¿ÉÒÔ£¬ÈçÖÐÎÄ£¬Ó¢ÎÄ£¬µÂÎͼ¿É¡£
ÎÒ½«XMLµÄ±àÂë¸ÄΪutf-8ºÍunicodeµÄµ½µÃ½á¹û¶¼Ò»Ñù.
°¢À­²®ÎĵÄ×Ö¿âÄãÓÐô£¿

ÓÐ,ÎÒµÄEXEÊÇ·ÅÔÚpc»úÉÏÖ´Ðе ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ