Ò»¸ö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»òC++ÈçºÎ±àдÇó½â3Dħ·½µÄ³ÌÐò£¬¸Ã´ÓºÎ¿ªÊ¼£¿ лл¸÷룬°ïæÌáµã½¨Òé°É¡£ http://www.mofang.net/code/176/182/6581.html ÎÒÖ»ÄÜÍ»ÆÆ60Ã룡°¦¡£ ÎÒ¸Õ¹ý40Ãë googleµÄandroidÖÐÓиöOpenGL ES + ......
#include"stdio.h" #include"stdlib.h" void ContrTwo(char i) { char str1[8]; itoa(i,str1,2); printf("%s",str1); } unsigned char leftRot(char str,int i); unsign ......
ÓÃvc±àдµÄdllÔÚdebugģʽºÍreleaseģʽÏÂÆô¶¯vbµÄexe³ÌÐòµ÷ÓÃvcµÄdll¿ÉÒԵõ½ÕýÈ·½á¹û£¬µ«ÊÇÈç¹ûÖ±½ÓË«»÷vbµÄexe³ÌÐòµ÷ÓÃdll±¨´í£¬ÔÚdllÄÚ²¿Ìí¼Ómessageboxºó·¢ÏÖÖ»ÒªÔÚº¯ÊýÄÚ²¿ÉùÃ÷std::stringÀàÐ͵ıäÁ¿¾Í»á³öÏÖÄ ......
°ï°ï棬лл~ 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 ......