CÓïÑÔÁ·Ï°Ìâ´ð°¸

}

}

{

letter++; }

elseif('0'<= str[i]&&str[i] <= '9') {

digit++; }

elseif(str[i] == ' ') {

space++; } else

other++;

printf(\Ó¢ÎÄ×Ö·ûÊý:%d\\n\ printf(\Êý×Ö×Ö·ûÊý:%d\\n\ printf(\¿Õ¸ñÊý:%d\\n\

printf(\ÆäËû×Ö·ûÊý:%d\\n\

--------------------39 40.

±à³ÌÅжÏÊäÈëµÄÒ»¸ö×Ö·û´®ÊÇ·ñÊÇ¡°»ØÎÄ¡±¡£Ëùν¡°»ØÎÄ¡±×Ö·û´®¾ÍÊÇ×ó¶ÁºÍÓÒ¶Á¶¼Ò»ÑùµÄ×Ö·û´®¡£ÀýÈç: \¾ÍÊÇÒ»¸ö»ØÎÄ×Ö·û´®¡£

ÊäÈëÌáʾÐÅÏ¢£º\ÊäÈë¸ñʽ£ºgets()

ÅжÏÊÇ»ØÎĵÄÊä³öÌáʾÐÅÏ¢£º\

Åжϲ»ÊÇ»ØÎĵÄÊä³öÌáʾÐÅÏ¢£º\

³ÌÐòÔËÐÐʾÀý1£º Input a string: abcba¨L

This string is a plalindrome.

³ÌÐòÔËÐÐʾÀý2£º Input a string: friend¨L

This string is not a plalindrome.

´ð°¸£º

#include charstr_1[81];

voidInverse(charstr[]); intmain()

{

printf(\ gets(str_1); Inverse(str_1); }

voidInverse(charstr[]) {

charb; inta, c;

for(a = 0;a < 81;a++) {

if(str[a] == '\\0') break; else

continue; }

for(c = 0;c < (a) / 2.0; c++) {

if(str[c] == str[(a - 1) - c]) continue; else {

printf(\plalindrome.\

return; } }

printf(\ }

------------------------------40 41.

±à³ÌʵÏÖ´Ó¼üÅÌÊäÈë5¸ö¹úÃû£¨Ã¿¸ö¹úÃû×80¸ö×Ö·û£©£¬ ÕÒ³ö²¢Êä³ö°´×Öµä˳ÐòÅÅÔÚ×îÇ°ÃæµÄ¹úÃû ÒªÇó£º

(1)ÓÃgetsÊäÈë×Ö·û´®¡£ (2)

**ÊäÈëÌáʾÐÅϢΪ£º\**Êä³ö¸ñʽΪ:\

´ð°¸£º

#include main() {

inti;

}

chara[5][81] = {0}, b, c;

printf(\ for(i = 0; i < 5;i++) {

gets(a[i]); }

b = a[0][0];

for(i = 1; i < 5; i++) {

if(a[i][0] < b) {

b = a[i][0]; c = i; }

elseif(a[i][0] == b) {

if(a[i][1] < a[i - 1][1]) c = i; else

c = i - 1; } else

continue; }

printf(\

---------------41 42.

Ò»¸önλÕýÕûÊýÈç¹ûµÈÓÚËüµÄn¸öÊý×ÖµÄn´Î·½ºÍ£¬¸ÃÊý³ÆΪnλ×Ô·½ÃÝÊý¡£Éè¼ÆÇó3~6λ×Ô·½ÃÝÊý¡£ **Êä³ö¸ñʽҪÇó£º\λ×ÔÃÝÊýÓÐ:\ÿλÍêºó»»ÐÐ)

³ÌÐòÔËÐÐʾÀýÈçÏ£º

3λ×ÔÃÝÊýÓÐ:153 370 371 407 4λ×ÔÃÝÊýÓÐ:1634 8208 9474 5λ×ÔÃÝÊýÓÐ:54748 92727 6λ×ÔÃÝÊýÓÐ:548834 ÉÐδÍê³É

---------------------42 43.

93084

´Ó¼üÅÌΪ3*3µÄ¾ØÕóÊäÈëÊý¾Ý£¬ÕÒ³öÖ÷¶Ô½ÇÏßÉÏ×î´óµÄÔªËØ£¬ÒÔ¼°ËùÔÚµÄÐкš£ **ÊäÈëÌáʾÐÅÏ¢£ºÎÞ **ÊäÈë¸ñʽҪÇó£º\

**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º

1 2 3 4 5 6 7 8 9

max=9 ,row=2

×¢£º²»ÔÊÐíʹÓÃgotoÓï¾ä

´ð°¸£º

#include

main()

{ inti, j, row = 0, max; inta[3][3];

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

{ for(j = 0; j < 3; j++)

{

scanf(\ } }

max = a[0][0];

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

{ if(max < a[i][i])

{

max = a[i][i]; row = i; } }

printf(\ }

--------------------43 44.

ÈÎÒâÊäÈëÓ¢ÎĵÄÐÇÆÚ¼¸£¬Í¨¹ý²éÕÒÐÇÆÚ±í£¬Êä³öÆä¶ÔÓ¦µÄÊý×Ö£¬ Èô²éµ½±í⣬ÈÔδÕÒµ½£¬ÔòÊä³ö´íÎóÌáʾÐÅÏ¢¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\²éÕÒ±íÖÐÐÅÏ¢£º

\\

³ÌÐòÔËÐÐʾÀý1ÈçÏ£º Please enter a string:

ÁªÏµ¿Í·þ£º779662525#qq.com(#Ì滻Ϊ@)