CÓïÑÔÁ·Ï°Ìâ´ð°¸ ÁªÏµ¿Í·þ

·¢²¼Ê±¼ä : ÐÇÆÚÈý ÎÄÕÂCÓïÑÔÁ·Ï°Ìâ´ð°¸¸üÐÂÍê±Ï¿ªÊ¼ÔĶÁ

{

unsigned int i; for(i = 1;i <= n; i++) {

printf(\ } } main() {

unsigned int i;

printf(\ scanf(\ Fact(i); }

---------------------------25 26.

°®Òò˹̹Ôø³ö¹ýÕâÑùÒ»µÀÊýѧÌ⣺ÓÐÒ»Ìõ³¤½×ÌÝ£¬Èôÿ²½¿ç2½×£¬×îºóÊ£ÏÂ1½×£»Èôÿ²½¿ç3½×£¬×îºóÊ£ÏÂ2½×£»Èôÿ²½¿ç5½×£¬×îºóÊ£ÏÂ4½×£»Èôÿ²½¿ç6½×£¬Ôò×îºóÊ£ÏÂ5½×£»Ö»ÓÐÿ²½¿ç7½×£¬×îºó²ÅÕýºÃ1½×²»Ê£¡£²Î¿¼Àý6.15³ÌÐò£¬±àд¼ÆËãÕâÌõ½×Ìݹ²ÓжàÉٽ׵ijÌÐòÈçÏÂËùʾ£¬ÆäÖдæÔÚһЩÓï·¨ºÍÂß¼­´íÎó£¬ÇëÕÒ³ö²¢¸ÄÕýÖ®£¬È»ºóÉÏ»úÔËÐгÌÐò²¢Ð´³ö³ÌÐòµÄÔËÐнá¹û¡£

#include main() {

int x = 1, find = 0; while (!find); {

if (x%2=1 && x%3=2 && x%5=4 && x%6=5 && x%7=0) {

printf(\ find = 1;

x++; } } } ´ð°¸£º

#include main()

{ int x = 1, find = 0; while (!find) {

if (x % 2 == 1 && x % 3 == 2 && x % 5 == 4 && x % 6 == 5 && x % 7 == 0) {

printf(\ find = 1; } x++; } }

---------------26 27.

´Ó¼üÅÌÈÎÒâÊäÈëÒ»¸öÕýÕûÊý£¬±à³ÌÅжÏËüµÄÆæżÐÔ¡£ÒªÇóÊäÈë±äÁ¿¶¨ÒåΪintÀàÐÍÇÒÓÉÓû§´Ó¼üÅÌÊäÈë¡£

³ÌÐòµÄÔËÐÐʾÀý1£º Input an integer number: 4¨L

4 is an even number

³ÌÐòµÄÔËÐÐʾÀý2£º Input an integer number: 3¨L

3 is an odd number

ÊäÈë¸ñʽ: \

Êä³ö¸ñʽ£º

ÊäÈëÐÅÏ¢Ìáʾ£º\żÊýÊä³ö¸ñʽ£º\ÆæÊýÊä³ö¸ñʽ£º\´ð°¸£º

#include main() { }

-------------------------------------27 28.

int n, m;

printf(\scanf(\m = n % 2; if (m)

printf(\printf(\else

Óö¯Ì¬Êý×é±à³ÌÊäÈëÈÎÒâm¸ö°àѧÉú£¨Ã¿°àn¸öѧÉú£©µÄijÃſεijɼ¨£¬¼ÆËã×î¸ß·Ö£¬²¢Ö¸³ö¾ßÓиÃ×î¸ß·Ö³É¼¨µÄѧÉúÊǵڼ¸¸ö°àµÄµÚ¼¸¸öѧÉú¡£ÆäÖУ¬mºÍnµÄÖµÓÉÓû§´Ó¼üÅÌÈÎÒâÊäÈ루²»ÏÞ¶¨mºÍnµÄÉÏÏÞÖµ£©¡£ ÊäÈëÌáʾÐÅÏ¢£º

\\ÊäÈë¸ñʽ£º\

Êä³öÌáʾÐÅÏ¢ºÍ¸ñʽ£º\´ð°¸£º

#include #include

void InputScore(int *p, int m, int n);

int FindMax(int *p, int m, int n, int *pRow, int *pCol); int main() {

int *pScore, m, n, maxScore, row, col; printf(\ scanf(\

pScore = (int *)calloc(m * n, sizeof (int)); /* ÉêÇ붯̬ÄÚ´æ */ if (pScore == NULL) {

printf(\ exit(0); }

InputScore(pScore, m, n);

maxScore = FindMax(pScore, m, n, &row, &col);

printf(\ free(pScore); /* ÊͷŶ¯Ì¬ÄÚ´æ */ return 0; }

/* º¯Êý¹¦ÄÜ£ºÊäÈëmÐÐnÁжþάÊý×éµÄÖµ */ void InputScore(int *p, int m, int n) { int i, j;

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

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

scanf(\ } }

}

/* º¯Êý¹¦ÄÜ£º¼ÆËãÈÎÒâmÐÐnÁжþάÊý×éÖÐÔªËصÄ×î´óÖµ£¬²¢Ö¸³öÆäËùÔÚÐÐÁÐϱêÖµ */

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

int i, j, max = p[0]; *pRow = 0; *pCol = 0;

for (i = 0; i < m; i++) {

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

if (p[i * n + j] > max) { max = p[i * n + j];

*pRow = i; /*¼Ç¼ÐÐϱê*/ *pCol = j; /*¼Ç¼ÁÐϱê*/ } } }

return max; }

-----------------------------28 29.

ÏÂÃæ³ÌÐòµÄ¹¦ÄÜÊǽ»»»±äÁ¿aºÍbÖеÄÖµ¡£ ÕÒ³öÆäÖеĴíÎ󲢸ÄÕýÖ®¡£

#include main() {

int a,b,*p,*q,*t; p=&a; q=&b;

printf(\ÇëÊäÈë±äÁ¿aºÍbµÄÖµ:\ scanf(\ *t=*p ; *p=*q ; *q=*t ;

printf(\½»»»ºóaºÍbµÄÖµ£ºa=%d b=%d\\n\} ´ð°¸£º

#include

main() {

int a,b,*p,*q,*t; p=&a; q=&b;