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

Èç¹ûÒ»ÐÐÓï¾ä±È½Ï³¤£¬Òª·ÖÐУ¬ÔÚC/C++ÖÐÔõôʵÏÖ£¿

ÈçÌ⣬Çë´ó¼Ò½â´ð
Ö±½Ó»»ÐÐ
c/c++Óï¾äÒÔ;½áÊø

µ«ÊÇÎҼǵÃÔÚʲôÊéÉÏ¿´µ½¿ÉÒÔÓÃ/À´Á¬½Ó£¬ÄܾßÌå˵˵Âð£¿

×¢ÒⶺºÅ¡­¡­
C/C++ code:

printf("%c%c%c%c%c",
'a',
'b',
'c',
'd',
'e'
);


ÄãµÄÕâ¸öÒ»ÐÐʲô¸ÅÄ

ÓеÄÖ±½Ó»»ÐУ¬ÓеÄÒª¼Ó: ¿Õ¸ñ+\

ÒýÓÃ
µ«ÊÇÎҼǵÃÔÚʲôÊéÉÏ¿´µ½¿ÉÒÔÓÃ/À´Á¬½Ó£¬ÄܾßÌå˵˵Âð£¿

ÕâÊÇ ºê µÄд·¨£¬ÐÐβÓà \

printf("1222222 \
        1222222");

×Ö·û´®»»ÐÐ
±ÈÈçchar* pChar = "ÎÒÃǶ¼ÊÇÖйúÈË£¬"
                  ¡°ÎÒÃÇÒ²ÊǵØÇòÈË£¬"
                  "ºÇºÇ"

ÒýÓÃ
µ«ÊÇÎҼǵÃÔÚʲôÊéÉÏ¿´µ½¿ÉÒÔÓÃ/À´Á¬½Ó£¬ÄܾßÌå˵˵Âð£¿


Óï¾ä»»ÐУº
printf("%c%c%c%c%c",\
          'a',\
          'b',\
          'c',\
          'd',\
          'e'\
          );


Ïà¹ØÎÊ´ð£º

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

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

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

¸ß·ÖÇó!×îºÃÊÇC/C++ - C/C++ / CÓïÑÔ

·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ


ѧϰ£¬¿´¿´

¼ÌÐø¶¥Å¶

ѧϰÁË¡£

go o ......

C/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý - C/C++ / C++ ÓïÑÔ

´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......

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