strtemp.Format("%c",bt)ʲôÒâ˼£¿
strtemp.Format("%c",bt)ʲôÒâ˼£¿%c´ú±íʲô£¿Ð»Ð»
±ä³É×Ö·û¡£ %c±íʾ½«btÀàÐ͵ıäÁ¿×ª»»ÎªCString±äÁ¿¡£ %c´ú±íbtÊÇÒ»¸ö×Ö·û¡£lzÕâÊÇ»ù´¡ÖеĻù´¡ÎÊÌâ°¡¡£ ÄܸøÒ»¸öÏà¹ØÖªÊ¶µÄÁ´½ÓÂðÒýÓà ¶Ô²»Í¬µÄÀàÐÍÓв»Í¬µÄ¸ñʽ×Ö·û¡£ £¨1£©%md,mΪָ¶¨µÄÊä³ö×ֶοí¶È¡£Èç¹ûÊý¾ÝµÄλÊýСÓÚm£¬Ôò×ó¶Ë²¹ÒÔ¿Õ¸ñ£¬Èô´óÓÚm£¬Ôò°´Êµ¼ÊλÊýÊä³ö¡£È磺 printf("%4d,%4d", a, b); Èôa=123, b=12345,ÔòÊä³ö½á¹ûΪ" 123", "12345". (2)%ldÊä³ö³¤ÕûÐÍ¡£ (3)%o¸ñʽ·û£¬Ò԰˽øÖÆÐÎʽÊä³öÕûÊý¡£ ·ûºÏλҲ½«Ò»Æð×÷Ϊ°Ë½øÖÆÊýÊä³ö¡£ (4)%x¸ñʽ·û£¬ÒÔÊ®Áù½øÖÆÐÎʽÊä³öÕûÊý¡£Í¬ÑùÒ²²»»á³öÏÖ¸ºÊýµÄÊ®Áù½øÖÆÊý¡£ (5)%u¸ñʽ·û£¬ÓÃÀ´Êä³öunsignedÐÍÊý¾Ý£¬¼´ÎÞ·ûºÅÊý£¬ÒÔÊ®½øÖÆÐÎʽÊä³ö¡£ (6)%c¸ñʽ·û£¬ÓÃÁ¦Êä³öÒ»¸ö×Ö·û£¬Ò²¿ÉÒÔÖ¸¶¨Êä³ö×ÖÊý¿í¶È£¬È磺 printf("%3c", c); //Èç¹ûc='a'ÄÇôÊäΪ" a" (7)%s¸ñʽ·û£¬Êä³ö×Ö·û´®¡£Óм¸ÖÖÓ÷¨£º 1.%ms£¬Èô×Ö·û´®±¾Éí³¤ÓÚm£¬ÔòÈ«²¿Êä³ö£¬ÈôСÓÚmÔò×󲹿ոñ¡£ 2.%-ms,Èô×Ö·û´®³¤Ð¡ÓÚmÔòÓÒ²¹¿Õ¸ñ¡£ 3.%m.ns,Êä³ömÁУ¬µ«Ö»È¡×Ö·û´®×ó¶Ën¸ö×Ö·û£¬Õân¸ö×Ö·ûÊä³öÔÚmÁеÄÓÒÔò£¬×󲹿ոñ¡£ 4.%-m.ns,ÆäÖÐm¡¢nͬÉÏ£¬n¸ö×Ö·ûÊä³öÔÚmÁеÄ×óÔò£¬ÓÒ²¹¿Õ¸ñ¡£Èç¹ûn>m,Ôòm×Ô¶¯È¡nÖµ£¬±£Ö¤n¸ö×Ö·ûÕý³£Êä³ö¡£ (8)%f¸ñʽ·û£¬Êä³öʵÊý(°üÀ¨µ¥¡¢Ë«¾«¶È¸¡µãÊý),ÒÔСÊýÐÎʽÊä³ö¡£ 1.%f£¬²»Ö¸¶¨×Ö¿í¡£ 2.%m.nf,Ö¸¶¨Êä³öµÄÊý¾Ý¹²Õ¼mÁУ¬ÆäÖÐÓÐnλСÊý¡£Èç¹ûÊýÖµ³¤¶ÈСÓÚmÔò×󲹿ոñ¡£ 3.%-m.nf,»ù±¾Í¬ÉÏ£¬µ«Õâ´ÎÓÒ²¹¿Õ¸ñ¡£ (9)%e¸ñʽ·û£¬ÒÔÖ¸ÊýÐÎʽÊä³öʵÊý¡£printf£¨"%e",123.456£©;Êä³ö1.23456+002
Ïà¹ØÎÊ´ð£º
ÇëÎÊÓÃC»òC++ÈçºÎ±àдÇó½â3Dħ·½µÄ³ÌÐò£¬¸Ã´ÓºÎ¿ªÊ¼£¿ лл¸÷룬°ïæÌáµã½¨Òé°É¡£ http://www.mofang.net/code/176/182/6581.html ÎÒÖ»ÄÜÍ»ÆÆ60Ã룡°¦¡£ ÎÒ¸Õ¹ý40Ãë googleµÄandroidÖÐÓиöOpenGL ES + ......
Á½¸öÎļþ1.PC£¬1.inc 1.PCÓвÙ×÷oracleÊý¾Ý¿âµÄ ,1.incÒ²ÓвÙ×÷oracleÊý¾Ý¿â ÔÚÆäËûÊý¾ÝÖÐÈçinformix ÖÐ$include 1.inc¾Í¿ÉÒÔʹÓÃÁË ÔÚORACLEÊý¾Ý¿âÖØ $include 1.inc²»¿ÉÓà EXEC SQL include 1.incÒ²²»¿É ......
´ó¼ÒºÃ£º ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿ ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......
CÓïÑÔ±à³Ì ´Ó¼üÅÌÉÏÊäÒ»¸öµ¥´Ê Åжϵ¥´ÊÊÇ·ñÔÚ´Ê¿âÓУ¬´Ê¿âÊÇÒ»¸öÎı¾¡£ scanf("%c",&c); if()ÅжϾÍÐÐÁË¡£ ÇÀSF¡£ дµÄ¶Ì ÒýÓà scanf("%c",&c); if()ÅжϾÍÐÐÁË¡£ ÇÀSF¡£
......
°ï°ï棬лл~ 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 ......