cÓïÑÔϰÌâ¼°´ð°¸-°®¿Î³Ìmooc

loading ·ÖÏí 2026-7-15 ÏÂÔØÎĵµ

1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1

ÊäÈë¸ñʽ: \ Êä³ö¸ñʽ£º

ÊäÈëÌáʾÐÅÏ¢£º\ Êä³öÊý¾Ý¸ñʽ£º\ Êý¾Ý»»ÐУº \

ÊäÈëÑùÀý£º Êä³öÑùÀý£º

×¢Ò⣺Ϊ±ÜÃâ³öÏÖ¸ñʽ´íÎó£¬ÇëÖ±½Ó¿½±´Õ³ÌùÉÏÃæ¸ø³öµÄÊäÈë¡¢Êä³öÌáʾÐÅÏ¢ºÍ¸ñʽ¿ØÖÆ×Ö·û´®£¡

#include int main() {

int n;

int i,j,a[10][10];

printf(\ scanf(\ for(i=0; i

for(j=0; j

a[i][0]=1; a[i][i]=1; }

for(i=2; i

for(j=1; j<=i-1; j++)

a[i][j]=a[i-1][j-1]+a[i-1][j]; for(i=0; i

for(j=0; j<=i; j++)

printf(\ printf(\

} }

µÚʮһÕÂ

11.1

ÕÒÊý×é×îÖµ£¨4·Ö£©

ÌâÄ¿ÄÚÈÝ£º

°´ÈçϺ¯ÊýÔ­Ðͱà³Ì´Ó¼üÅÌÊäÈëÒ»¸ömÐÐnÁеĶþάÊý×飬Ȼºó¼ÆËãÊý×éÖÐÔªËØµÄ×î´óÖµ¼°ÆäËùÔÚµÄÐÐÁÐϱêÖµ¡£ÆäÖУ¬mºÍnµÄÖµÓÉÓû§¼üÅÌÊäÈë¡£ÒÑÖªmºÍnµÄÖµ¶¼²»³¬¹ý10¡£ void InputArray(int *p, int m, int n);

int FindMax(int *p, int m, int n, int *pRow, int *pCol);//º¯Êý·µ»Ø×î´óÖµ£¬pRowºÍpCol·Ö±ð·µ»Ø×î´óÖµËùÔÚµÄÐÐÁÐϱê ÀýÈ磬³ÌÐòµÄ1´ÎÔËÐнá¹ûÈçÏ£º Input n: 3,4¨L

Input 3*4 array: 1 2 3 4¨L 5 6 7 8¨L 9 0 -1 -2¨L

max=9,row=2,col=0 ÊäÈë¸ñʽ:

ÌáʾÐÅÏ¢: \ÊäÈëÊý×éάÊý£º\ÌáʾÐÅÏ¢: \ÊäÈëÊý×éÔªËØ£º\Êä³ö¸ñʽ£º

\ÊäÈëÑùÀý£º Êä³öÑùÀý£º

#include

void InputArray(int (*p)[10], int m, int n);

int FindMax(int (*p)[10], int m, int n, int *pRow, int *pCol); int i,j;

int num[10][10]; int main() {

int m,n; int max=0; int row,col;

int *pRow=&row; int *pCol=&col;

printf(\ scanf(\

printf(\ InputArray(num,m,n);

max=FindMax(num,m,n,pRow,pCol);

printf(\ return 0; }

int FindMax(int (*p)[10], int m, int n, int *pRow, int *pCol) {

int tem=p[0][0]; for(i=0;i

for(j=0;jtem){

tem=p[i][j]; *pRow=i; *pCol=j; } return tem; }

void InputArray(int (*p)[10], int m, int n) {

for(i=0;i

scanf(\}

11.2

ðÅÝÅÅÐò£¨4·Ö£©

ÌâÄ¿ÄÚÈÝ£º

²ÉÓÃðÅÝ·¨½øÐÐÉýÐòÅÅÐò·¨µÄ»ù±¾Ô­ÀíÊÇ£º¶ÔÊý×éÖеÄn¸öÊýÖ´ÐÐn-1±é¼ì²é²Ù×÷£¬ÔÚÿһ±éÖ´ÐÐʱ£¬¶ÔÊý×éÖÐÊ£ÓàµÄÉÐδÅźÃÐòµÄÔªËØ½øÐÐÈçϲÙ×÷£º¶ÔÏàÁÚµÄÁ½¸öÔªËØ½øÐбȽϣ¬ÈôÅÅÔÚºóÃæµÄÊýСÓÚÅÅÔÚÇ°ÃæµÄÊý£¬Ôò½»»»ÆäλÖã¬ÕâÑùÿһ±é²Ù×÷Öж¼½«²ÎÓë±È½ÏµÄÊýÖеÄ×î´óµÄÊý³Áµ½Êý×éµÄµ×²¿£¬¾­¹ýn-1±é²Ù×÷ºó¾Í½«È«²¿n¸öÊý°´´ÓСµ½´óµÄ˳ÐòÅźÃÐòÁË¡£³ÌÐòµÄij´ÎÔËÐнá¹ûÈçÏ£º Input n:10¨L

Input 10 numbers:2 9 3 4 0 6 8 7 5 1¨L

Sorting results: 0 1 2 3 4 5 6 7 8 9 ÊäÈë¸ñʽ: \Êä³ö¸ñʽ£º

ÊäÈëÊý¾Ý¸öÊýÌáʾ£º\ÊäÈëÊý¾ÝÌáʾ£º\Êä³öÌáʾ£º\Êä³ö¸ñʽ£º\ÊäÈëÑùÀý£º Êä³öÑùÀý£º

#include int i,j;

int num[10000];

void Swap(int *m,int *n); int main() {

int n;

printf(\ scanf(\

printf(\ for(i=0;i

scanf(\ for(i=0;i

if (num[j]

Swap(&num[j],&num[i]); printf(\ for (i=0;i

printf(\ return 0; }

void Swap(int *m,int *n) {

int tem; tem=*m; *m=*n; *n=tem; }

11.3

ɾ³ý×Ö·û´®ÖÐÓëij×Ö·ûÏàͬµÄ×Ö·û£¨4·Ö£©

ÌâÄ¿ÄÚÈÝ£º

ÔÚ×Ö·û´®ÖÐɾ³ýÓëij×Ö·ûÏàͬµÄ×Ö·û£¬ÒªÇóÓÃ×Ö·ûÊý×é×÷º¯Êý²ÎÊý¡£ ³ÌÐòÔËÐнá¹ûʾÀý£º Input a string: hello, my friend!¨L Input a character: !¨L

Results:hello, my friend ÊäÈë¸ñʽ:

×Ö·û´®ÊäÈëÓà gets()º¯Êý µ¥¸ö×Ö·ûÊäÈëÓà getchar()º¯Êý Êä³ö¸ñʽ£º

ÊäÈë×Ö·û´®µÄÌáʾÐÅÏ¢£º \ ÊäÈëµ¥¸ö×Ö·ûµÄÌáʾÐÅÏ¢£º \ Êä³ö¸ñʽ£º \ ÊäÈëÑùÀý£º Êä³öÑùÀý£º

#include #include #define maxn 1000

void delete_string(char str[],char ch); int main() {

char m[maxn],l[maxn]; char n;


cÓïÑÔϰÌâ¼°´ð°¸-°®¿Î³Ìmooc.doc ½«±¾ÎĵÄWordÎĵµÏÂÔØµ½µçÄÔ
ËÑË÷¸ü¶à¹ØÓÚ£º cÓïÑÔϰÌâ¼°´ð°¸-°®¿Î³Ìmooc µÄÎĵµ
Ïà¹ØÍÆ¼ö
Ïà¹ØÔĶÁ