Ò»¸öC³ÌÐò£¬½«×Ö·û´®Ç°ÒÆbλ£¬È»ºóÊä³ö
È磺ÊäÈëb=3£¬×Ö·û´®ÊäÈëΪ£ºabcdefg£¬Êä³ö£ºefgabc ÎÒдÕâ¸ö£¬Èç¹ûÊäÈëbСÓÚµÈÓÚ10Õý³££¬b´óÓÚ10£¬Êä³ö×Ö·û´®»á³öÏÖ ºº×Ö £» ÔõÃÇ»ØÊ £¬¸ßÊÖ°ïÏÂæ £¬ÎÒдµÄÈçÏ #include <stdio.h> #include <string.h> #define N 80 f(char *s,int a,int b) { int i; char c[N],*p; p=c; for(i=0;i <10;i++) *(p+i)=*(s+a-b+i); for(i=0;i <a-b;i++) *(p+b+i)=*(s+i); *(p+a)='\0'; puts(c); } void main() { int a,b; char s[N]; scanf("%d\n",&b); gets(s); a=strlen(s); f(s,a,b); }
ºÇºÇ~~¶Ô°¡£¬ ллÄãÁË ÒýÓà for(i=0;i <10;i++) ÕâÀïµÄi <10²»¶Ô°É£¬Ó¦¸ÃÊÇÒÆ¶¯b¸öÊý£¬Ó¦¸ÃÊÇi <b°É d²»ÒªÁË£¿ char* str = "abcdefg"; int b = 3; char format[100]; sprintf(format, "%%s%%.%ds", b + 1);//%s%.(b+1)s printf(format, str + b, str);
Ïà¹ØÎÊ´ð£º
¸÷λ´óÏÀ£º ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
°ï°ï棬лл~ 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 ......
¸øÒÑ֪ͼÏñÌí¼Ó¸ß˹ÔëÉù£¬ÇëÎʸß˹ÔëÉùÊÇÔõôʵÏֵģ¿¾ùÖµ·½²î·Ö±ðΪu£¬v¡£ ½²Ò»ÏÂ˼·ҲÐа¡¡£¡£¡£¡£¡£¡£ csdn ¸ßÊÖÔÆ¼¯µÄµØ·½¡£¡£¡£¡£¡£¡£ http://zhidao.baidu.com/question/71224083.html 2Â¥¸øµÄÊÇÒ»¸ ......