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

cºÍc++»ù´¡ÎÊÌâ

int a=5;
printf("%d %d",a=3,a+4);
cout<<(a=3)<<(a+4); 
½á¹ûÊÇʲô£¿Ë­¸ø·ÖÎöһϰ¡£¿
1¡£±í´ïʽÓи±×÷Óã»
2¡£ÇóÖµµÄ˳Ðò䶨¡£

ËùÒÔ¾ßÓÐ䶨ÒåµÄÐÐΪ¡£
LZ²»Òª°Ñ¾«Á¦ÀË·ÑÔÚÕâ¸öÉÏÁË¡£

ÓÐÐèÒªµÄ»°£¬°ÑÕâЩÓï¾ä·Ö³É¶à¸öÓï¾ä¡£





ºÃ¶àÍ·ÌÛµÄÎÊÌâ

ÊÇÀÏʦ³öµÄÌâÄ¿Âð£¿

  Èç¹ûÊÇ£¬ÄÇÕæÊDZä̬µÄÀÏʦ£¡

a=3,a+4
ÏÈÖ´ÐÐa+4=9£»
ºóÖØÐ¸øa¸³3µÄÖµ¡£Êä³ö3¡£

Êä³öÊÇ×ÔÓÒÖÁ×ó¡£

½áÌû×Ó°É

printfº¯ÊýÊÇ´ÓÓұ߿ªÊ¼Ö´Ðеġ£

<< ²Ù×÷·ûÒ²ÊÇ´ÓÓÒ±ßÍù×ó±ß¿ªÊ¼Ö´Ðеġ£

3 9 ———— Õâ¾äprintfÖ´ÐÐÍêÁË£¬a = 3£¬ËùÒÔϾäÊä³ö3 7
3 7  

ÔÚ³ÌÐòÖлìÓÃprintfºÍcout²»ÊÇʲôºÃϰ¹ß£¬¾¡Á¿±ÜÃâ


ºÇºÇ ÎÒµÄvs2005 ÔËÐнá¹ûÊÇ 3 7 3 7Ŷ £¡£¡

3 7 ,3 7

ÕâÖÖÎÊÌⲻͬµÄϵͳÔËÐнá¹û²»Ò»ÑùµÄ£¬²»ÒªÔÚÕâÖÖÎÊÌâÀË·ÑÌ«¶àʱ¼ä¡£
Èç¹ûÏëÖªµÀ½á¹û£¬ÔÚÄã×Ô¼ºµÄ»·¾³ÏÂÔËÐÐһϾÍÖªµÀÁË¡£

Á½¸öÊä³ö½á¹û¶¼ÊÇ3 9,
CÓïÑÔprintfº¯Êý²ÎÊýÇóֵ˳ÐòΪ×ÔÓÒÏò×ó,
C++ÖеÄ<<Ò²ÊÇÒ»¸öº¯Êý£¬ÊÇÔËËã·ûµÄÖØÔØ£¬ÔËËã·½ÏòΪÓÒ½áºÏ¡£

Á½¸öÊä³ö½á¹ûÊÇ
  3 9
  3 7
CÓïÑÔprintfº¯Êý²ÎÊýÇóֵ˳ÐòΪ×ÔÓÒÏò×ó, 
C++ÖÐµÄ < <Ò²ÊÇÒ»¸öº¯Êý£¬ÊÇÔËËã·ûµÄÖØÔØ£¬ÔËËã·½ÏòΪÓÒ½áºÏ¡£

ÊǽøÕ»µÄʱºò´ÓÓÒÏò×󣬳öÕ»µÄʱºò¾Í³ÉÁË´Ó×óÏòÓÒÊä³öÁË£¬¶Ô·ñ£¿

ÒýÓÃ
1¡£±í´ïʽÓи±×÷Óã»
2¡£ÇóÖµµÄ˳Ðò䶨¡£



Ïà¹ØÎÊ´ð£º

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

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

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

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

CµÄѧϰ;¾¶ - C/C++ / ÐÂÊÖÀÖÔ°

ÎÒֻѧ¹ýÇ廪À¶·âÃæµÄCÓïÑÔ»ù´¡£¬Ïë¸üÉîÈëµÄѧϰ£¬¸Ã¿´Ê²Ã´ÊéºÃ£¿
C Primer Plus
C³ÌÐòÉè¼ÆÓïÑÔ(µÚ2°æÐ°æ)
CÓïÑÔ³ÌÐòÉè¼Æ_ÏÖ´ú·½·¨
CÓïÑԲο¼ÊÖ²áµÚÎå°æ
CÓïÑÔ´óÈ«
CºÍÖ¸Õë
CÏÝÚåÓëȱÏÝ
Cר¼Ò±à³Ì

......

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

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

cÓïÑÔʵÏÖlinux timeÏà¹Øº¯Êý - C/C++ / CÓïÑÔ

ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......

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