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

1.ÒÑÖªÈý½ÇÐεÄÈý±ß³¤Îªa£¬b£¬c£¬¼ÆËãÈý½ÇÐÎÃæ»ýµÄ¹«Ê½Îª£º area=sqrt(s(s-a)(s-b)(s-c))£¬ÆäÖÐs=(a+b+c)/2¡£

ÊÔ±à³Ì´Ó¼üÅÌÊäÈëa£¬b£¬cµÄÖµ£¨¼ÙÉèa£¬b£¬cµÄÖµ¿ÉÒÔ±£Ö¤Æä¹¹³ÉÒ»¸öÈý½ÇÐΣ©£¬¼ÆËã²¢Êä³öÈý½ÇÐεÄÃæ»ý¡£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input a,b,c:3,4,5 area = 6.00

´ð°¸£º#include #include int main(void) { }

-----------------1

2.´Ó¼üÅÌÈÎÒâÊäÈëÒ»¸ö4λÕûÊý,±à³Ì¼ÆËã²¢Êä³öËüµÄÄæÐòÊý.ÀýÈç:ÊäÈë1234,·ÖÀë³öǧλ1¡¢°Ùλ2¡¢Ê®Î»3ºÍ¸öλ4£¬È»ºó¼ÆËã4*1000+3*100+2*10+1=4321£¬²¢Êä³ö4321¡£ **ÒªÇóÊäÈëÌáʾÐÅϢΪ:ÎÞ **ÒªÇóÊäÈë¸ñʽΪ: \**ÒªÇóÊä³ö¸ñʽΪ£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º 1234 ´Ë´¦ÎªÊäÈë 4321 ´Ë´¦ÎªÊä³ö ´ð°¸£º

#include int main(void) {

int a, b, c, d,e; scanf(\b = a/1000; c = a00/100; d = a0/10; e = a;

a = e*1000+d*100+c*10+b; printf(\return 0;

float a, b, c, s, area; printf(\scanf(\s = (a + b + c) / 2;

area = sqrt(s*(s - a)*(s - b)*(s - c)); printf(\return 0;

}

--------------2

3.ÓйØÊäÈëÊä³öÎÊÌâ¡£ ÊäÈëΪ£º12a¨L b¨L

ÔËÐнá¹ûΪ£º1,2,a,b,123.300000,65535 Çë¸ÄÕý³ÌÐòÖеĴíÎó£¬Ê¹ËüÄܵóöÕýÈ·µÄ½á¹û¡£ #include main() {

int b;

unsigned short a = 65535; short k = a; char c, d; int f, g;

b = (1234.0 - 1) / 10; scanf(\ scanf(\ scanf(\ scanf(\

printf(\}

´ð°¸£º#include main() { double b; int a = 65535; char c, d; int f, g;

b = (1234.0 - 1) / 10; scanf(\scanf(\scanf(\scanf(\

printf(\}

--------3

4.ÊäÈëÒ»ÐÐ×Ö·û£¬Í³¼ÆÆäÖеÄÓ¢ÎÄ×Ö·û¡¢Êý×Ö×Ö·û¡¢¿Õ¸ñ×Ö·û£¬ÒÔ¼°ÆäËû×Ö·ûµÄ¸öÊý¡£ÇëÕÒ³öÒÔϳÌÐòµÄ´íÎ󣬲¢¸ÄÕýÖ®¡£ #include #include

#define ARR_SIZE = 80; main() {

charstr[ARR_SIZE]; int len, i;

int letter=0,digit=0,space=0,other=0;

printf(\ÇëÊäÈëÒ»¸ö×Ö·û´®:\ gets(str);

len = strlen(str);

for(i=0; i

if(a=

letter ++;

} elseif(0=

digit ++; } elseif(str[i]=' ')

{ space ++; } else

other ++; }

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

´ð°¸ £º#include #include

#define ARR_SIZE 80 main() {

charstr[ARR_SIZE]; int len, i;

int letter = 0, digit = 0, space = 0, other = 0;

printf(\ÇëÊäÈëÒ»¸ö×Ö·û´®:\ gets(str);

len = strlen(str);

for(i = 0; i

if('a'<= str[i]&&str[i] <= 'z'|| 'A'<= str[i]&&str[i] <= 'Z') {

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\ }

--------------------4

5.¶ÔÊäÈëµÄÒ»¸öÊýÅжÏÊÇ·ñÊÇËØÊý¡£ËùÎ½ËØÊýÊÇÖ¸Õâ¸öÊýÖ»Äܱ»1ºÍ×ÔÉíÕû³ý¡£ÒªÇóÔÚÖ÷º¯ÊýÊäÈëÒ»¸öÊý£¬µ÷Óú¯ÊýFun()ÅжϸÃÊýÊÇ·ñÊÇËØÊý¡£´òÓ¡ÐÅÏ¢ÔÚÖ÷º¯ÊýÖнøÐС£ÀýÈ磺´Ó¼üÅÌÊäÈë5£¬5ÊÇËØÊýÔò´òÓ¡ÈçÏÂÐÅÏ¢£º\¡£ÓÖÈç:´Ó¼üÅÌÊäÈë4, 4²»ÊÇËØÊýÔò´òÓ¡ÈçÏÂÐÅÏ¢:\¡£¸ºÊý¡¢0ºÍ1¾ù²»ÊÇËØÊý¡£¶ÔÊäÈëµÄÊý¾ÝÒª¿¼ÂÇÊý¾ÝµÄºÏ·¨ÐÔ£¬²»Âú×ãÌõ¼þµÄÊýÒªÖØÐÂÊäÈëÖ±µ½Âú×ãÌõ¼þΪֹ¡£²»ÄÜʹÓÃÈ«¾Ö±äÁ¿,²»°´¸ø¶¨µÄº¯ÊýÔ­Ðͱàд³ÌÐò ²»¸ø·Ö¡£Fun()º¯ÊýÔ­ÐÍΪ£º int Fun(int m)£» **ÊäÈëÊý¾ÝÌáʾÐÅÏ¢£º\ ×¢£º¸ÃÌáʾÐÅÏ¢Çë·ÅÔÚÑ­»·ÌåÍâ

**ÊäÈëÊý¾Ý¸ñʽΪ£º\**Êä³ö¸ñʽҪÇó£º

ÈôÊÇËØÊýÊä³öÊý¾Ý¸ñʽΪ£º\ Èô²»ÊÇËØÊýÊä³öÊý¾Ý¸ñʽΪ£º \²»ÍêÕû´ð°¸£º#include intFun(inta) {

inti; if(a>1) {

for(i = 2;i

if(a%i==0) return0; else continue; } return1; } else return0; } main() {

intb,c;

printf(\ scanf(\ c = Fun(b); if(0 == c)

printf(\ else

printf(\ }

²Î¿¼´ð°¸£º#include \ intFun(intm); intmain()

{ intm, flag;

printf(\ do

{

scanf(\ }

while(m < 2); //e1

flag = Fun(m); //3

if(flag) //1

printf(\ else

printf(\

return0;

} intFun(intm)//2

{ inti, flag = 1; //1

for(i = 2; i < m; i++) //1 { if(m % i == 0) //1

{ flag = 0; //1 break; } }

returnflag;//2 }

- ---------------------------------------------------------5 6.Çó1898

ÏÖŒ¢²»³¬¹ý2000µÄËùÓÐËØÊý´ÓСµ½´óÅųɵÚÒ»ÐУ¬µÚ¶þÐÐÉϵÄÿ¸öÊý¶¼µÈÓÚËü¡°ÓҼ硱ÉϵÄËØÊýÓë¡°×ó¼ç¡±ÉϵÄËØÊýÖ®²î¡£Çë±à³ÌÇó³ö£ºµÚ¶þÐÐÊýÖÐÊÇ·ñ´æÔÚÕâÑùµÄÈô¸É¸öÁ¬ÐøµÄÕûÊý£¬ËüÃǵĺÍÇ¡ºÃÊÇ1898£¿¼ÙÈç´æÔڵϰ£¬ÓÖÓм¸ÖÖÕâÑùµÄÇé¿ö£¿ **ÊäÈë¸ñʽҪÇó£ºÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º

There are follwing primes in first row : (1).101,......,1999 (2). 89,......,1987 (3). 53,......,1951 (4). 3,......,1901 ´ð°¸£º

#include #defineN 330 int a[N]; int main()

{ }

7.´Ó¼üÅÌÈÎÒâÊäÈëÒ»¸öÕûÊým£¬Èôm²»ÊÇËØÊý£¬Ôò¶Ôm½øÐÐÖÊÒòÊý·Ö½â£¬²¢½«m±íʾΪÖÊÒòÊý´ÓСµ½´ó˳ÐòÅÅÁеij˻ýÐÎʽÊä³ö£¬·ñÔòÊä³ö\¡£ÀýÈ磬Óû§ÊäÈë90ʱ£¬³ÌÐòÊä³ö90 = 2 * 3 * 3 * 5£»Óû§ÊäÈë17ʱ£¬³ÌÐòÊä³ö\prime number\¡£

ÊäÈëÌáʾÐÅÏ¢£º\ÊäÈë¸ñʽ£º\Êä³ö¸ñʽ£º

ÊÇËØÊýʱÊä³ö\

}

printf(\); for (c = 329;c >= 0;c--)

for (b = c + 1;c < b;b++)

if (b < 330) { } else

break;

if ((a[b] - a[c]) == 1898) { } else

continue;

printf(\, d, a[c], a[b]); d++;

int c = 0, b = 0, d = 1; int i = 0, j = 0, k = 0; for (i = 3;i <= 2000;i++) {

for (j = 2;j < i;j++) { }

if (j == i) { } else

continue; a[k] = i; k++;

if (i%j == 0) else

continue; break;

·ñÔòÊä³öÓÃ\£¬\ÔËÐÐʾÀý1£º Input m:90¨L 90 = 2 * 3 * 3 * 5 ÔËÐÐʾÀý2£º Input m:13¨L It is a prime number ´ð°¸£º

#include #include intIsPrime(intx);

voidOutputPrimeFactor(intx); intmain() { intm;

printf(\ scanf(\ if(IsPrime(m)) {

printf(\ } else {

printf(\ OutputPrimeFactor(m); } return0; }

intIsPrime(intx) {

inti,flag=1;

intsquareRoot=sqrt(x); if(x<=1) { flag=0; }

for(i=2;i<=squareRoot&&flag;i++) {

if(x%i==0) { flag=0; } }

returnflag;

}

voidOutputPrimeFactor(intx) { inti;

for(i=2;i

if(x%i==0) {

printf(\ OutputPrimeFactor(x/i); return; } }

printf(\ }

---------------------------7 8.

½«ÈÎÒ»ÕûÊýת»»Îª¶þ½øÖÆÐÎʽ¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\

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

number of decimal form:876

it's binary form: 00000000000000000000001101101100

´ð°¸£º

#include #include int main() { }

---------------------------8 9.

Çó×ÔÈ»Êýn×î½üµÄËØÊýk, k>n¡£

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

int a; char b[32];

printf(\); scanf(\, &a);

printf(\, a); printf(\); printf(\, itoa(a, b, 2));

ʾÀý ÊäÈ룺 257 Êä³ö£º

Please input n:263 ´ð°¸£º

#include int main() {

int n, i = 1, k;

printf(\ scanf(\ for (k = n + 1;i;k++) {

for (i = 2;i < k;i++) if (k%i == 0) break; else

continue; if (i == k) {

printf(\ i = 0; break; } } }

---------------9 10.

Èç¹ûÒ»¸öÕýÕûÊýmµÄËùÓÐСÓÚmµÄ²»Í¬Òò×Ó£¨°üÀ¨1£©¼ÓÆðÀ´ÕýºÃµÈÓÚm±¾Éí£¬ÄÇô¾Í±»³ÆËüΪÍêÈ«Êý¡£ËüÊÇÖ¸ÕâÑùµÄÒ»Ð©ÌØÊâµÄ×ÔÈ»Êý£¬ËüËùÓеÄÕæÒò×Ó£¨¼´³ýÁË×ÔÉíÒÔÍâµÄÔ¼Êý£©µÄºÍ£¬Ç¡ºÃµÈÓÚËü±¾Éí¡£

×¢Ò⣺1ûÓÐÕæÒò×Ó£¬ËùÒÔ²»ÊÇÍêÈ«Êý¡£ÀýÈ磬6¾ÍÊÇÒ»¸öÍêÈ«Êý£¬ÊÇÒòΪ6 = 1 + 2 + 3¡£ Çë±àдһ¸öÅжÏÍêÈ«ÊýµÄº¯ÊýIsPerfect()£¬È»ºóÅжϴӼüÅÌÊäÈëµÄÕûÊýÊÇ·ñÊÇÍêÈ«Êý¡£

ÒªÇ󣺰´ÈçÏÂÔ­ÐͱàдÅжÏÍêÈ«ÊýµÄº¯Êý£¬Èôº¯Êý·µ»Ø0£¬Ôò´ú±í²»ÊÇÍêÈ«Êý£¬Èô·µ»Ø1£¬Ôò´ú±íÊÇÍêÈ«Êý¡£

int IsPerfect(int x);

**ÒªÇóÊäÈëÌáʾÐÅϢΪ: \**ÒªÇóÊäÈë¸ñʽΪ: \**ÒªÇóÊä³ö¸ñʽΪ

\\

×¢£º²»ÄÜʹÓÃÖ¸Õë¡¢½á¹¹Ìå¡¢¹²ÓÃÌå¡¢Îļþ¡¢goto¡¢Ã¶¾ÙÀàÐͽøÐбà³Ì£¬Ö÷º¯Êý²»ÄÜʹÓÃint mainºÍreturn 0¡£ ´ð°¸£º

#include int IsPerfect(int x); int main() {

int m;

printf(\ scanf(\ if (IsPerfect(m))

printf(\ else

printf(\}

int IsPerfect(int x) {

int i = 1,b = 0; for (i = 1;i < x;i++) if (x%i == 0) {

b = b + i; continue; } else

continue; if (b == x) return 1; else

return 0; }

---------------------10 11.

Óú¯Êý±à³Ì¼ÆËãÁ½ÕûÊýµÄ×î´óÖµ£¬ÔÚÖ÷º¯ÊýÖе÷Óøú¯Êý¼ÆËã²¢Êä³ö´Ó¼üÅÌÈÎÒâÊäÈëµÄÁ½ÕûÊýµÄ×î´óÖµ¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input a,b:5,8 max = 8 ´ð°¸£º

#include int max(int a, int b)

{

if(a >= b) return a; else

return b; } main() {

int a = 0,b = 0; printf(\ scanf(\

printf(\}

---------------------------11 12.

ÀûÓÃÇó½×³Ëº¯ÊýFact()£¬±à³Ì¼ÆËã²¢Êä³ö1! + 2! + ¡­+ n!µÄÖµ¡£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\´ð°¸£º

#include int sum_s(int i); main() {

unsigned int n = 0; unsigned long b = 0; printf(\ scanf(\ for (b;n;n--) {

b = b +sum_s(n); }

printf(\}

int sum_s(int i) {

int a;

for(a = 1;i;i--) {

if (i > 1) a = a * i; else

a = a * 1; }

return a;

}

--------------------------------------12 13.

±à³ÌÊä³öÈçϲ˵¥½çÃæ£¨¾ßÌåµÄÊä³öÔòÒÔÏÂÃæÌáʾÖÐÒªÇóµÄÊä³ö¸ñʽΪ׼£©:

=======´óѧÐÅÏ¢¹ÜÀíϵͳ======= ------------------------------ °ì¹«ÊÒ¹ÜÀí ²ÆÎñ¹ÜÀí ½ÌÎñ¹ÜÀí ͼÊé¹ÜÀí ¿ÆÑйÜÀí É豸¹ÜÀí ÈËʹÜÀí ºóÇÚ¹ÜÀí Í˳öϵͳ

------------------------------ ÇëÄúÔÚÉÏÊö¹¦ÄÜÖÐÑ¡Ôñ£¨0¡ª¡ª8£©:

Ìáʾ£ºÊä³öÈçϸñʽ

\´óѧÐÅÏ¢¹ÜÀíϵͳ======= \\n\\\°ì¹«ÊÒ¹ÜÀí 5. ²ÆÎñ¹ÜÀí \\n\\½ÌÎñ¹ÜÀí 6. ͼÊé¹ÜÀí \\n\\¿ÆÑйÜÀí 7. É豸¹ÜÀí \\n\\ÈËʹÜÀí 8. ºóÇÚ¹ÜÀí \\n\\Í˳öϵͳ\\n\

\

\ÇëÄúÔÚÉÏÊö¹¦ÄÜÖÐÑ¡Ôñ£¨0¡ª¡ª8£©:\\n\´ð°¸£º

#include main() {

printf(\´óѧÐÅÏ¢¹ÜÀíϵͳ======= \\n\ printf(\ printf(\°ì¹«ÊÒ¹ÜÀí 5. ²ÆÎñ¹ÜÀí \\n\ printf(\½ÌÎñ¹ÜÀí 6. ͼÊé¹ÜÀí \\n\ printf(\¿ÆÑйÜÀí 7. É豸¹ÜÀí \\n\ printf(\ÈËʹÜÀí 8. ºóÇÚ¹ÜÀí \\n\ printf(\Í˳öϵͳ\\n\

printf(\ printf(\ÇëÄúÔÚÉÏÊö¹¦ÄÜÖÐÑ¡Ôñ£¨0¡ª¡ª8£©:\\n\}

-------------------------------------13 14.

ÀûÓþ²Ì¬±äÁ¿¼ÆËãnµÄ½×³Ë¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input n:10 1! = 1 2! = 2 3! = 6 4! = 24 5! = 120 6! = 720 7! = 5040 8! = 40320 9! = 362880 10! = 3628800 ´ð°¸:

#include int sum_s(int i); main() {

unsigned int n = 0,b = 1; printf(\ scanf(\ for (b = 1;b <= n;b++) {

printf(\ } }

int sum_s(int i) {

int a;

for(a = 1;i;i--) {

if (i > 1) a = a * i; else

a = a * 1; }

return a; }

------------------------------------------------14 15.

дһ¸ö³ÌÐò´Ó¼üÅÌÊäÈëÁ½¸öÕûÊý£¬È»ºóÏÔʾÊä³öµÚ1¸öÊý³ýÒÔµÚ2¸öÊýµÄ½á¹û¡£ÀýÈ磬ÊäÈë123ºÍ12£¬³ÌÐòµÄÊä³ö½á¹û¸ñʽÈçÏ£º

10 Remainder = 3 ------ 12 ) 123

Ìáʾ£ºÊ¹ÓÃÇóÓàÔËËã·û»ñµÃÓàÊý£¬Ê¹ÓÃÕûÊý³ý·¨»ñµÃÉÌ¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\ÇëÊäÈëÁ½¸öÕûÊý£º\**Êä³ö¸ñʽҪÇó£º \\\´ð°¸£º

#include main() {

int a, b, c, d;

printf(\ÇëÊäÈëÁ½¸öÕûÊý£º\ scanf(\ c = a / b; d = a % b;

printf(\ printf(\ printf(\}

-------------------------------------------15 16.

дһ¸ö³ÌÐò£¬½«½ÓÊÕµÄÉãÊÏζÈת»»Îª¶ÔÓ¦µÄ»ªÊÏζȡ£³ÌÐòÓ¦ÏÔʾÈçϵÄÌáʾÐÅÏ¢£º Please input cels:

È»ºóÊäÈëÒ»¸öÊ®½øÖÆÊý²¢»Ø³µ£¬È»ºó³ÌÐòÒÔºÏÊʵÄÏûÏ¢ÐÎʽÊä³öת»»ºóµÄ»ªÊÏζȡ£ ³ÌÐòʹÓÃÈçÏµĹ«Ê½Íê³Éת»»£ºÉãÊÏÎÂ¶È = 5.0 *£¨»ªÊÏÎÂ¶È ¨C 32.0£© / 9.0 **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\´ð°¸£º

#include main() {

double a,b;

printf(\ scanf(\

b = (9.0 * a)/5.0 + 32.0; printf(\}

--------------------------16 17.

дһ¸ö³ÌÐò£¬½«½ÓÊյĻªÊÏζÈת»»Îª¶ÔÓ¦µÄÉãÊÏζȡ£³ÌÐòÓ¦ÏÔʾÈçϵÄÌáʾÐÅÏ¢£º

Please input fahr:

È»ºóÊäÈëÒ»¸öÊ®½øÖÆÊý²¢»Ø³µ£¬È»ºó³ÌÐòÒÔºÏÊʵÄÏûÏ¢ÐÎʽÊä³öת»»ºóµÄ»ªÊÏζȡ£ ³ÌÐòʹÓÃÈçÏµĹ«Ê½Íê³Éת»»£ºÉãÊÏÎÂ¶È = 5.0 *£¨»ªÊÏÎÂ¶È ¨C 32.0£© / 9.0 **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\´ð°¸£º

#include main() {

double a,b;

printf(\ scanf(\

b = 5.0 * (a - 32.0) / 9.0; printf(\}

-----------------------------------17 18.

±àдһ¸ö³ÌÐò£¬ÊäÈëÒ»¸ö3λÕûÊý£¬ÒªÇóÄæÐòÊä³ö¶ÔÓ¦µÄÊý¡£ÀýÈ磺ÊäÈë123£¬ÔòÊä³ö321¡£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º

Please enter a positive integer: 345 345-->543 ´ð°¸£º

#include int main(void) {

int a, b, c, d,e;

printf(\ scanf(\ b = a/100; d = a0/10; e = a;

c = e*100+d*10+b; printf(\ return 0; }

-------------------------------------------18 19.

¼ÆËãÁ½¸öÊýµÄƽ·½ºÍ

´Ó¼üÅ̶ÁÈëÁ½¸öʵÊý£¬±à³Ì¼ÆËã²¢Êä³öËüÃÇµÄÆ½·½ºÍ£¬ÒªÇóʹÓÃÊýѧº¯Êýpow(x,y)¼ÆËãÆ½·½Öµ£¬Êä³ö½á¹û±£Áô2λСÊý¡£

Ìáʾ£ºÊ¹ÓÃÊýѧº¯ÊýÐèÒªÔÚ³ÌÐòÖмÓÈë±àÒëÔ¤´¦ÀíÃüÁî #include

ÒÔÏÂΪ³ÌÐòµÄÊä³öʾÀý£º Please input x and y: 1.2,3.4¨L result=13.00

ÊäÈë¸ñʽ: \

Êä³ö¸ñʽ£º

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

#include #include main() {

float x,y,z;

printf(\ scanf(\ z = pow(x,2) + pow(y,2); printf(\}

¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª19 20.

дһ¸ö³ÌÐò´Ó¼üÅÌÊäÈëÁ½¸öÕûÊý£¬È»ºóÏÔʾµÚ1¸öÕûÊýÕ¼µÚ¶þ¸öÕûÊýµÄ°Ù·Ö±È£¬±£Áôµ½Ð¡Êýµãºó1λ¡£ÀýÈçÊäÈë5ºÍ40£¬³ÌÐòÊä³ö½á¹ûÈçÏ£º 5 is 12.5 percent of 40

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\ÇëÊäÈëÁ½¸öÕûÊý£º\**Êä³ö¸ñʽҪÇó£º\´ð°¸£º

#include main() {

int a, b; float c;

printf(\ÇëÊäÈëÁ½¸öÕûÊý£º\ scanf(\ c = (float)a / (float)b; c = c *100;

printf(\}

----------------------------------20 21.

ÇóÈý½ÇÐÎÃæ»ý¡£ÊäÈëÈý½ÇÐεÄÈý¸ö±ß³¤£¬¼ÆËãÈý½ÇÐεÄÃæ»ý¡£ÉèÈý½ÇÐεÄÈý¸ö±ß³¤·Ö±ðΪa¡¢b¡¢c£¬Îª¼òµ¥Æð¼û£¬ÎÒÃÇÈÏΪÊäÈëµÄÈý¸ö±ß³¤Êý¾ÝÊÇÕýÈ·µÄ£¬¿ÉÒÔ×é³ÉÒ»¸öÈý½ÇÐΡ£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Enter 3 floats:2,2,3 area=1.98 ´ð°¸£º

#include #include int main(void) {

float a, b, c, s, area; printf(\ scanf(\ s = (a + b + c) / 2;

area = sqrt(s*(s - a)*(s - b)*(s - c)); printf(\ return 0; }

------------------------------------------21 22.

дһ¸ö³ÌÐò¼ÆË㳤Ϊ11.5ÀåÃ×£¬¿íΪ2.5ÀåÃ×£¬¸ßΪ10ÀåÃ׵ĺÐ×ÓµÄÌå»ýºÍ±íÃæ»ý¡£ ³ÌÐò˵Ã÷£º²ÉÓÃÖ±½Ó¸³Öµ£¬²»ÓÃÊäÈë¡£ **Êä³ö¸ñʽҪÇó\´ð°¸£º

#include main() {

float a, b;

a = (11.5 * 2.5 + 11.5*10 +10 * 2.5)*2; b = 11.5 * 2.5 * 10;

printf(\} 23.

Óõݹ鷽·¨¼ÆËãÕûÊýnµÄ½×³Ën£¡¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input n:5 5! = 120 ´ð°¸;

#include int f(int n)

{

if(n==1 ||n==0) return 1; else

return n * f(n - 1); } main() {

int n;

o: printf(\ scanf(\ while (n<0) {

printf(\ goto o; }

printf(\}

------------------------------------23 24.

Óõݹ鷽·¨±à³Ì¼ÆËãFibonacciÊýÁеÄǰNÏî¡£ÆäÖÐfib(0)=0,fib(1)=1,fib(n)=fib(n-1)+fib(n-2)¡£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input n:10 Fib(1)=1 Fib(2)=1 Fib(3)=2 Fib(4)=3 Fib(5)=5 Fib(6)=8 Fib(7)=13 Fib(8)=21 Fib(9)=34 Fib(10)=55 ´ð°¸£º

#include int Fib(int n) {

if (n == 0) return 0; else if (n == 1) return 1; else

return Fib(n - 1) + Fib(n - 2); } main() {

int n, a;

printf(\ scanf(\ for (a = 1; a <= n;a++) {

printf(\ } }

--------------------------------------------24 25.

ÀûÓÃÇó½×³Ëº¯ÊýFact()£¬±à³Ì¼ÆËã²¢Êä³ö´Ó1µ½nÖ®¼äËùÓÐÊýµÄ½×³ËÖµ¡£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input n(n>0):10 1! = 1 2! = 2 3! = 6 4! = 24 5! = 120 6! = 720 7! = 5040 8! = 40320 9! = 362880 10! = 3628800 ´ð°¸£º

#include

int sum_s(unsigned int i) {

unsigned int a; for(a = 1;i;i--) {

if (i > 1) a = a * i; else

a = a * 1; }

return a; }

int Fact(unsigned int n)

{

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;

}

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

printf(\½»»»ºóaºÍbµÄÖµ£ºa=%d b=%d\\n\

-----------------------------------29 30.

±à³Ì´òÓ¡200~300Ö®¼äËùÓÐËØÊý¡£ÒªÇóÅжÏÒ»¸öÊýÊÇ·ñÊÇËØÊýÓú¯ÊýʵÏÖ£¬´òÓ¡½á¹ûÇëÔÚÖ÷º¯ÊýʵÏÖ¡£ÅжÏÒ»¸öÊýÊÇ·ñÊÇËØÊýº¯ÊýÔ­ÐÍΪ: int fun(int m); ²ÎÊý˵Ã÷£º

²Î Êý£ºmÊÇÒª½øÐÐÅжϵÄÊý£»

·µ»ØÖµ£ºÈô´ËÊýÊÇËØÊý£¬Ôò·µ»ØÖµÎª1£»·ñÔò·µ»ØÖµÎª0 **ÊäÈëÌáʾÐÅÏ¢: ÎÞ **ÊäÈëÊý¾Ý¸ñʽҪÇó: ÎÞ **Êä³öÊý¾Ý¸ñʽҪÇó: \×¢£º²»ÔÊÐíʹÓÃgotoÓï¾ä ´ð°¸£º

#include int fun(int m); main() {

int a;

for (a = 200;a <= 300;a++) {

if (fum(a))

printf(\ else continue; } }

int fum(int m) {

int i;

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

if(m%i == 0) return 0; else continue; } return 1;

}

------------------------------30 31.

ÊäÈëij°àѧÉúijÃſεijɼ¨£¨×î¶à²»³¬¹ý40ÈË£©£¬µ±ÊäÈëΪ¸ºÖµÊ±£¬±íʾÊäÈë½áÊø£¬ Óú¯Êý±à³Ìͳ¼Æ³É¼¨¸ßÓÚÆ½¾ù·ÖµÄѧÉúÈËÊý¡£

ÒªÇó°´ÈçÏÂÔ­Ðͱàдͳ¼Æ³É¼¨ÔÚÈ«°àƽ¾ù·Ö¼°Æ½¾ù·ÖÖ®ÉϵÄѧÉúÈËÊý int GetAboveAver(int score[], int n); **ÊäÈëÒªÇó£º\**Êä³öÒªÇó£º

\\

\´ð°¸£º

#include int a[40] = { 0 }, i = 0;

int GetAboveAver(int score[], int n); int main() { }

int GetAboveAver(int score[], int n) {

d = sum / i;

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

if (score[c] > d) int sum = 0, c; int d, e = 0;

for (c = 0;c < i; c++) { }

sum = sum + score[c]; for (i; i <= 40; i++) { }

printf(\GetAboveAver(a, i);

int b = 0; scanf(\if (b >= 0)

a[i] = b; break; else

}

}

e++; continue;

else

printf(\return 0;

-----------------------------30 31. /*

±à³ÌʵÏÖ¼òµ¥µÄ¼ÆËãÆ÷¹¦ÄÜ£¬ÒªÇóÓû§°´Èçϸñʽ´Ó¼üÅÌÊäÈëËãʽ£º ²Ù×÷Êý1 ÔËËã·ûop ²Ù×÷Êý2

¼ÆËã²¢Êä³ö±í´ïʽµÄÖµ£¬ÆäÖÐËãÊõÔËËã·û°üÀ¨£º¼Ó£¨+£©¡¢¼õ£¨-£©¡¢³Ë£¨*£©¡¢³ý£¨/£©¡¢^(´ÎÃÝ£©¡£ ÒªÇóʹÆäÄܽøÐи¡µãÊýµÄËãÊõÔËË㣬ͬʱÔÊÐíʹÓÃ×Ö·û*¡¢xÓëX×÷Ϊ³ËºÅ£¬²¢ÇÒÔÊÐíÊäÈëµÄËãÊõ±í´ïʽÖеIJÙ×÷ÊýºÍÔËËã·ûÖ®¼ä¿ÉÒÔ¼ÓÈëÈÎÒâ¶à¸ö¿Õ¸ñ·û¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\

**Êä³ö¸ñʽҪÇó£º\+ %f = %f \\n\- %f = %f \\n\* %f = %f \\n\/ %f = %f \\n\by zero!\\n\ ³ÌÐòÔËÐÐʾÀý1ÈçÏ£º

Please enter the expression: 2.0 + 4.0 2.000000 + 4.000000 = 6.000000 ³ÌÐòÔËÐÐʾÀý2ÈçÏ£º

Please enter the expression: 2.0 - 4.0 2.000000 - 4.000000 = -2.000000 ³ÌÐòÔËÐÐʾÀý3ÈçÏ£º

Please enter the expression: 2.0 * 4.0 2.000000 * 4.000000 = 8.000000 ³ÌÐòÔËÐÐʾÀý4ÈçÏ£º

Please enter the expression: 2.0 x 4.0 2.000000 * 4.000000 = 8.000000 ³ÌÐòÔËÐÐʾÀý5ÈçÏ£º

Please enter the expression: 2.0 X 4.0 2.000000 * 4.000000 = 8.000000 ³ÌÐòÔËÐÐʾÀý6ÈçÏ£º

Please enter the expression: 2.0 / 4.0 2.000000 / 4.000000 = 0.5000000 ³ÌÐòÔËÐÐʾÀý7ÈçÏ£º

Please enter the expression: 2.0 / 0 Division by zero! ³ÌÐòÔËÐÐʾÀý8ÈçÏ£º

Please enter the expression:2.0 ^5.0 2.000000 ^ 5.000000 = 32.000000 ³ÌÐòÔËÐÐʾÀý9ÈçÏ£º

Please enter the expression: 2.0 \\ 4.0

Invalid operator! */

#include #include int main() { }

-----------------------------31 32.

float a, b; char c;

printf(\); scanf(\,&a, &c, &b); if (c == '+') { }

elseif (c == '*' || c == 'x' || c == 'X')

printf(\, a, b, a*b); printf(\,a, b,pow(a,b)); printf(\); elseif (c == '^') else

if (b != 0)

printf(\, a, b, a / b); printf(\); else

printf(\, a, b, a + b); printf(\,a, b, a - b); elseif (c == '-') elseif (c == '/')

ÏÂÃæ³ÌÐòµÄ¹¦ÄÜÊǼÆËãÁ½¸öÕýÕûÊýµÄ×îС¹«±¶Êý£¬Çë¸ÄÕýÆäÖеĴíÎó¡£ #include

intMinCommonMultiple(inta, intb)

main() {

inta, b, x;

printf(\ scanf(\

x=MinCommonMultiple(inta,intb);

printf(\ }

intMinCommonMultiple(inta, intb); {

inti;

for(i=1; i

if(i%a==0 || i%b==0) returni; } }

´ð°¸£º

#include

int MinCommonMultiple(int a, int b);

int main() { }

int MinCommonMultiple(inta, intb) { }

--------------------------------------32 33.

Çë±àдº¯Êýfuc£¨£©,º¯ÊýµÄ¹¦ÄÜÊÇ£º ¸ù¾ÝÒÔϹ«Ê½Çó³öpµÄÖµ£¬½á¹ûÓɺ¯ÊýÖµ·µ»Ø¡£m , n ÊÇÁ½¸öÕýÕûÊý£¬ÇÒ m>n. P= m!/(n!*(m-n)!)

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\ÇëÊäÈëm,nµÄÖµ( m>n )£º\\n\**Êä³ö¸ñʽҪÇó£º\ÏîÖ®ºÍΪ£º%lf\\n\³ÌÐòÔËÐÐʾÀýÈçÏ£º ÇëÊäÈëm,nµÄÖµ( m>n )£º 5 3

nÏîÖ®ºÍΪ£º10.000000 ´ð°¸£º

int i;

for (i = 1; i <= a*b; i++) { }

if (i%a == 0 && i%b == 0)

return i;

int a, b, x;

printf(\); scanf(\, &a, &b); x = MinCommonMultiple(a, b);

printf(\, x);

#include intfuc(intm, intn); intsum_s(inti);

intmain() {

intm, n;

printf(\ÇëÊäÈëm,nµÄÖµ( m>n )£º\\n\ scanf(\

printf(\ÏîÖ®ºÍΪ£º%lf\\n\ }

intfuc(intm, intn) {

intp;

p = sum_s(m) / (sum_s(n) * sum_s(m - n)); returnp; }

intsum_s(inti) {

ints_ = 1, a;

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

s_ = s_ *a; }

returns_; }

----------------------------------33 34.

²ÉÓÃÇî¾Ù·¨£¬°´ÈçϺ¯ÊýÔ­ÐÍ

/* º¯Êý¹¦ÄÜ£º¼ÆËãaºÍbµÄ×îС¹«±¶Êý£¬µ±a»òÕßbΪ·ÇÕýÕûÊýʱ·µ»Ø-1 */ int Lcm(int a, int b);

Óú¯Êý±à³ÌʵÏÖ¼ÆËãÁ½¸öÕýÕûÊýµÄ×îС¹«±¶Êý£¨Least Common Multiple£¬LCM£©µÄº¯Êý£¬ÔÚÖ÷º¯ÊýÖе÷Óøú¯Êý¼ÆËã²¢Êä³ö´Ó¼üÅÌÈÎÒâÊäÈëµÄÁ½ÕûÊýµÄ×îС¹«±¶Êý¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\

**Êä³ö¸ñʽҪÇó£º\error!\\n\

³ÌÐòÔËÐÐʾÀýÈçÏ£º Input a,b:16,24

Least Common Multiple of 16 and 24 is 48 ×¢£º²»ÔÊÐíʹÓÃgotoÓï¾ä

´ð°¸£º

#include intLcm(inta, intb); intmain() {

inta, b;

printf(\ scanf(\ if(Lcm(a,b) > 0)

printf(\Common Multiple of %d and %d is %d\\n\a, b, Lcm(a, b)); else

printf(\ }

intLcm(inta, intb) {

inti;

if(a > 0 && b > 0) {

for(i = 1;i < a*b;i++) {

if((i % a == 0) && (i % b == 0)) returni; } } else

return-1; }

--------------------34 35.

ÊäÈëij°àѧÉúijÃſεijɼ¨£¨×î¶à²»³¬¹ý40ÈË£©£¬ µ±ÊäÈëΪ¸ºÖµÊ±£¬±íʾÊäÈë½áÊø£¬

Óú¯Êý±à³Ìͳ¼Æ³É¼¨²»µÍÓÚÆ½¾ù·ÖµÄѧÉúÈËÊý¡£ ÒªÇó£º

(1)°´ÈçϺ¯ÊýÔ­ÐͽøÐбà³Ì£º

int GetAboveAver(int score[], int n); (2)ÔÚÖ÷º¯ÊýÖУº ÊäÈëѧÉú³É¼¨£¬

È»ºóµ÷Óú¯ÊýGetAboveAver¼ÆËã³É¼¨²»µÍÓÚÆ½¾ù·ÖµÄѧÉúÈËÊý£¬ ×îºóÊä³ö¸ÃÈËÊý¡£ ÒªÇó:

(1)ѧÉú³É¼¨ºÍƽ¾ù·Ö¾ù¶¨ÒåΪintÀàÐÍ (2)**ÎÞÊäÈëÌáʾÐÅÏ¢ **ÊäÈë¸ñʽΪ£º\

**Êä³ö¸ñʽΪ£º\

´ð°¸£º

#include

inta[40] = { 0 }, i = 0;

intGetAboveAver(intscore[], intn); intmain()

{

for(i; i <= 40; i++) {

intb = 0;

scanf(\ if(b >= 0)

a[i] = b; else

break; }

GetAboveAver(a, i); }

intGetAboveAver(intscore[], intn) {

intsum = 0, c; intd, e = 0;

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

sum = sum + score[c]; }

d = sum / i;

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

if(score[c] >= d) e++; else

continue; }

printf(\ return0; }

----------------------------35 36.

´Ó¼üÅÌÈÎÒâÊäÈë10¸öÕûÊý´æÈëÒ»¸öÊý×éÖУ¬

È»ºóÈÎÒâÊäÈëÒ»¸öÕûÊýx£¬²ÉÓÃ˳Ðò²éÕÒ·¨£¬ÔÚÊý×éÖвéÕÒ¸ÃÊý£¬ Èç¹ûÕÒµ½£¬Ôòº¯Êý·µ»Ø¸ÃÊýÔÚÊý×éÖеÄϱêλÖ㬠²¢ÔÚÖ÷º¯ÊýÖдòÓ¡¸ÃÖµ£»

Èç¹ûûÓÐÕÒµ½£¬Ôò·µ»Ø-1£¬²¢ÔÚÖ÷º¯ÊýÖдòÓ¡¡°Not found!¡±¡£ ÒªÇó°´ÈçϺ¯ÊýÔ­Ðͱà³ÌʵÏÖ²éÕÒ¹¦ÄÜ¡£ int Search(int a[], int n, int x); ÔÚÖ÷º¯ÊýÖе÷Óú¯ÊýSearch˳Ðò²éÕÒx£¬ È»ºóÔÚÖ÷º¯ÊýÖдòÓ¡²éÕÒ½á¹û¡£

ÒªÇó±ØÐë°´ÕÕÌâĿҪÇóºÍÓú¯Êý±à³Ì£¬·ñÔò²»¸ø·Ö¡£

**ÒªÇóÊäÈë10¸öÕûÊýµÄÌáʾÐÅÏ¢¸ñʽΪ£º

\£¨Ã¿ÊäÈëÒ»¸öÊý£¬¼üÒ»´Î»Ø³µ£©£» **ÒªÇóÊäÈëÕûÊýxµÄÌáʾÐÅÏ¢¸ñʽΪ£º \

**ÒªÇóÊä³ö¸ñʽΪ:

ÕÒµ½Ê±µÄ´òÓ¡¸ñʽΪ\ûÕÒµ½Ê±µÄ´òÓ¡¸ñʽΪ\

´ð°¸£º

#include

intSearch(inta[], intn, intx); intb[10] = {0}; intmain() {

intx, n;

printf(\ for(x = 0; x < 10; x++) {

scanf(\ b[x] = n; }

printf(\ scanf(\ Search(b,n,x);

if(Search(b,n,x) > 0)

printf(\ else

printf(\ }

intSearch(inta[], intn, intx ) {

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

if(a[n] == x) returnn; else

continue; }

return-1; }

-------------------36 37.

ÀûÓÃÒ»¸ö×Ö·ûÊý×é×÷º¯Êý²ÎÊý,ʵÏÖ×Ö·û´®£¨×î´ó³¤¶ÈΪ80¸ö×Ö·û £©µÄÄæÐò´æ·Å¡£

ÒªÇóÈçÏ£º

(1)ÔÚ×Óº¯ÊýInverseÖÐʵÏÖ×Ö·û´®µÄÄæÐò´æ·Å¡£º¯ÊýÔ­ÐÍΪ£º void Inverse(char str[]); (2)ÔÚÖ÷º¯ÊýÖÐ

´Ó¼üÅÌÊäÈë×Ö·û´®(ʹÓÃgetsº¯Êý) È»ºó£¬µ÷ÓÃInverseº¯Êý£¬ ×îºó£¬Êä³öÄæÐòºóµÄ×Ö·û´®¡£

(3)**ÊäÈëÌáʾÐÅÏ¢£º\ **Êä³öÌáʾÐÅÏ¢£º\ **Êä³ö¸ñʽ£º\

×¢£º²»ÄÜʹÓÃÖ¸Õë¡¢½á¹¹Ìå¡¢¹²ÓÃÌå¡¢Îļþ¡¢goto¡¢Ã¶¾ÙÀàÐͽøÐбà³Ì£¬Ö÷º¯Êý²»ÄÜʹÓÃint mainºÍreturn 0¡£

´ð°¸£º

#include char str_1[81];

void Inverse(char str[]); int main() { }

void Inverse(charstr[]) { }

-----------------------37 38.

char b; int a, c;

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

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

printf(\); printf(\, str);

b = str[c];

str[c] = str[(a - 1) - c]; str[(a - 1) - c] = b; if (str[a] == '\\0')

break; continue; else

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

´Ó¼üÅÌÈÎÒâÊäÈëÒ»¸ö×Ö·û´®£¬¼ÆËãÆäʵ¼Ê×Ö·û¸öÊý²¢´òÓ¡Êä³ö£¬¼´²»Ê¹ÓÃ×Ö·û´®´¦Àíº¯Êýstrlen()±à³ÌʵÏÖstrlen()µÄ¹¦ÄÜ¡£

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

Please enter a string:Hello China The length of the string is: 11

´ð°¸£º

#include main() {

inta;

charstr[100];

printf(\ gets(str);

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

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

continue; }

printf(\ }

----------------------38 39.

ÊäÈëÒ»ÐÐ×Ö·û£¬Í³¼ÆÆäÖеÄÓ¢ÎÄ×Ö·û¡¢Êý×Ö×Ö·û¡¢¿Õ¸ñ×Ö·û£¬ÒÔ¼°ÆäËû×Ö·ûµÄ¸öÊý¡£ÇëÕÒ³öÒÔϳÌÐòµÄ´íÎ󣬲¢¸ÄÕýÖ®¡£ #include #include

#define ARR_SIZE = 80;

main() {

char str[ARR_SIZE]; int len, i;

int letter=0,digit=0,space=0,other=0;

printf(\ÇëÊäÈëÒ»¸ö×Ö·û´®:\ gets(str);

len = strlen(str);

for (i=0; i

if (a=

letter ++; }

else if (0=

digit ++; }

else if (str[i]=' ' ) { space ++; } else

other ++; }

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

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

´ð°¸£º

#include #include

#define ARR_SIZE 80

main() {

charstr[ARR_SIZE]; int len, i;

int letter = 0, digit = 0, space = 0, other = 0;

printf(\ÇëÊäÈëÒ»¸ö×Ö·û´®:\ gets(str);

len = strlen(str);

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

if('a'<= str[i] && str[i] <= 'z'|| 'A'<= str[i] && str[i]<= 'Z')

}

}

{

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:

Monday

Monday is 1

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

Not found!

´ð°¸£º

#include #include #define WEEKDAYS 7

#define MAX_STR_LEN 10 intmain()

{ inti, pos;

intfindFlag = 0; charx[MAX_STR_LEN];

charweekDay[][MAX_STR_LEN] = {\\

printf(\ scanf(\

for(i = 0; i < WEEKDAYS && !findFlag; i++)

{ if(strcmp(x, weekDay[i]) == 0)

{ pos = i;

findFlag = 1; } }

if(findFlag)

{ printf(\ } else

{ printf(\ }

return0; }

-----------------------44 45.

ÓÐÒ»¸ö3*4µÄ¾ØÕó£¬ÇóÆäÖеÄ×î´óÔªËØµÄÖµ¡£¾ØÕóΪ£º {{1,3,5,7},{2,4,6,8},{15,17,34,12}};

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

´ð°¸£º

#include main() {

inta[3][4] = {{1,3,5,7},{2,4,6,8},{15,17,34,12}}; inti, j, c; c = a[0][0];

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

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

if(a[i][j] >= c) c = a[i][j]; else

continue; } }

printf(\ }

-------------------45 46.

°´ÈçϺ¯ÊýÔ­Ðͱàд³ÌÐò£¬ÊäÈën¡Án½×¾ØÕó£¬Óú¯Êý±à³Ì¼ÆËã²¢Êä³öÆäÁ½Ìõ¶Ô½ÇÏßÉϵĸ÷ÔªËØÖ®ºÍ¡£

void InputMatrix(int a[N][N], int n); int AddDiagonal(int a[N][N], int n); ÊäÈëÌáʾÐÅÏ¢£º \

\ÊäÈë¸ñʽ£º\

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

´ð°¸£º

#include #define PL 50 main() {

inta[PL][PL];

inti, j, n, sum = 0; printf(\ scanf(\

printf(\ for(i = 0; i < n; i++)

}

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

scanf(\ }

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

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

if(i == j || (i + j) == (n - 1)) sum = sum + a[i][j]; }

printf(\

------------------46 47.

ÓÐÈçÏÂ3*4µÄ¾ØÕó£¬Çó³öÆäÖÐÖµ×î´óµÄÔªËØµÄÖµ¡£ 1 2 3 4 9 8 7 6 10 -1 -4 4

ÔÚ¶ÔÊý×é½øÐгõʼ»¯Ê±£¬¸ø³öÉÏÃæÊý¾Ý¡£

**ÒªÇóÊäÈëÌáʾÐÅϢΪ£ºÎÞÊäÈëÌáʾÐÅÏ¢ºÍÊäÈëÊý¾Ý **ÒªÇóÊä³ö¸ñʽΪ£º\

´ð°¸£º

#include main() {

inta[3][4] = { { 1,2,3,4 },{ 9,8,7,6 },{ 10,-1,-4,4 } }; inti, j, c; c = a[0][0];

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

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

if(a[i][j] >= c)

c = a[i][j]; else

continue; } }

printf(\ }

--------------------47 48.

ÊäÈëÒ»¸öÕýÕûÊýn£¬ÔÙÊäÈën¸öѧÉúµÄ³É¼¨£¬¼ÆËãÆ½¾ù·Ö£¬²¢Í³¼Æ²»¼°¸ñ³É¼¨µÄ¸öÊý¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\grade #%d: \ÌáʾÐÅÏ¢£º\n: \

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

Enter grade #1: 67 Enter grade #2: 54 Enter grade #3: 88 Enter grade #4: 73 Grade average = 70.50 Number of failures = 1

´ð°¸£º

#include doublea[40] = { 0 }; inti = 0;

intGetAboveAver(doublescore[], intn); intmain() {

intn;

printf(\ scanf(\ for(i; i < n; i++) {

printf(\ doubleb = 0; scanf(\ if(b >= 0)

a[i] = b; else

break; }

GetAboveAver(a, n); }

intGetAboveAver(doublescore[], intn) {

int c;

doublesum = 0, d; int e = 0;

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

sum = sum + score[c]; }

d = sum / i;

}

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

if(score[c] < 60) e++; else

continue; }

printf(\ return0;

---------------------48 49.

Ö±½ÇÈý½ÇÐεÄÈý±ßÂú×ãa^2+b^2=c^2,Èç¹ûÈý±ß¶¼ÊÇÕûÊý£¬Ôò³Æa¡¢b¡¢cΪһ×é¹´¹ÉÊý¡£

±à³ÌÊä³öÿ±ß³¤¶¼²»´óÓÚ20µÄËùÓй´¹ÉÊý¡£ **ÊäÈëÌáʾÐÅÏ¢¸ñʽ: ÎÞ **ÊäÈëÊý¾Ý¸ñʽҪÇó: ÎÞ

**Êä³öÊý¾Ý¸ñʽҪÇó: \

´ð°¸£º

#include #include main() {

inta, b, c;

for(a = 1; a <= 20; a++)

for(b = 1;b <= 20; b++)

for(c = 1;c <= 20; c++) {

if(c >= b && b >=a)

if(pow(c,2) == pow(b,2)+pow(a,2)) printf(\n\

} }

---------------------49 50.

Ç󷯲¨ÄÇÆæÊýÁУºÊýÁÐ1¡¢1¡¢2¡¢3¡¢5¡¢8¡¢13¡¢21¡¢?£¬ÊÇÖøÃûµÄ·Æ²¨ÄÇÆæÊýÁУ¬ÆäµÝÍÆÍ¨ÏʽΪ£ºU_1=U_2=1, (n=1,2)U_n=U_{n-1}+U_{n-2},(n>=3) Çó³öµÚnÏîµÄÖµ£¬Çë±àд³ÌÐò¡£

**ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input n=?10

No. 10 is 55

´ð°¸£º

#include intFct(intn); main() {

intn;

printf(\ scanf(\

printf(\ }

intFct(intn) {

if(n <= 2) return1; else

returnFct(n-1)+Fct(n - 2); }

-----------------------50 51.

ÏÂÃæ³ÌÐòµÄ¹¦ÄÜÊǶÁÈ¡7¸öÊý£¨1¡ª50£©µÄÕûÊýÖµ£¬Ã¿¶Áȡһ¸öÖµ£¬³ÌÐò´òÓ¡³ö¸ÃÖµ¸öÊýµÄ£ª¡£ÕÒ³öÆäÖеĴíÎ󣬲¢¸ÄÕýÖ®¡£ #include \ main()

{ inti,a,n=1; while(n<=7) {

do

{

scanf(\ }while(a<1 && a>50); for(i=1;i<=a;i++) printf(\ printf(\ n++; } }

´ð°¸£º

#include \ intmain() {

inti, a, n = 1; while(n <= 7) {

}

scanf(\

if(a >= 1 && a <= 50);

for(i = 1;i <= a;i++) printf(\

printf(\ n++; }

-----------------51 52.

±àд³ÌÐò£ºÓÐ1,2,3,4¹²ËĸöÊý×Ö,ÄÜ×é³É¶àÉÙ¸ö»¥²»ÏàͬµÄÇÒÎÞÖØ¸´Êý×ÖµÄÈýλÊý,¶¼ÊǶàÉÙ¡£

**Êä³ö¸ñʽҪÇó£º\¹²ÓÐ%dÖÖ×éºÏ£¡\³ÌÐòÔËÐÐʾÀýÈçÏ£º 1 2 3 1 2 4 1 3 2 1 3 4 1 4 2 1 4 3 2 1 3 2 1 4 2 3 1 2 3 4 2 4 1 2 4 3 3 1 2 3 1 4 3 2 1 3 2 4 3 4 1 3 4 2 4 1 2 4 1 3 4 2 1 4 2 3 4 3 1 4 3 2

¹²ÓÐ24ÖÖ×éºÏ£¡

´ð°¸£º

#include main() {

int a, b, c, d = 0; for (a = 1;a <= 4;a++) for (b = 1; b <= 4; b++ ) for (c = 1;c <= 4; c++) {

if(a != b && a != c && b != c) {

printf(\ d++; } }

printf(\¹²ÓÐ%dÖÖ×éºÏ£¡\}

---------------------------------52 53.

ÓÃwhileÓï¾ä±à³Ì£¬ÊäÈëÒ»×éÕûÐÍÊý¾Ý£¬È»ºóÏÔʾÿ´Î½«ÊäÈëÊý¾Ý½øÐÐÀÛ¼ÓÔËËãºóµÄ½á¹û¡£µ±ÊäÈë0ʱ£¬Í£Ö¹ÊäÈëÊý¾Ý£¬½áÊø³ÌÐòµÄÔËÐС£ **ÊäÈë¸ñʽҪÇó£º\ÌáʾÐÅÏ¢£º\**Êä³ö¸ñʽҪÇó£º\³ÌÐòÔËÐÐʾÀýÈçÏ£º Input num:1 sum = 1 Input num:2 sum = 3 Input num:3 sum = 6 Input num:4 sum = 10 Input num:0 sum = 10

´ð°¸£º

#include main() {

int sum = 0,num; do {

printf(\ scanf(\ sum = sum + num;

printf(\ }while(num); }

--------------------------------------53 54.

ÀûÓÃpi/2 = (2/1)*(2/3)*(4/3)*(4/5)*(6/5)*(6/7)*...ǰ100ÏîÖ®»ý£¬±à³Ì¼ÆËãpiµÄÖµ¡£

Ϊ±£Ö¤¼ÆË㾫¶È£¬ÇëÓÃdoubleÀàÐͼÆËã¡£ **Êä³ö¸ñʽҪÇó£º\

´ð°¸£º

#include main() {

doubled = 1, pi; inti, j;

for(i = 1; i <= 50; i++) for(j = 1; j <= 2; j++) {

if(j == 1)

d = d * (double)(i*2)/(i*2 - 1); else

d = d * (double)(i*2)/(i*2 + 1); } pi = 2*d;

printf(\ }

------------------------54 55.

ÀûÓæÐ4=1?13+15?17+¡­£¬±à³Ì¼ÆËã¦ÐµÄ½üËÆÖµ£¬Ö±µ½×îºóÒ»ÏîµÄ¾ø¶ÔֵСÓÚ10?4ʱΪֹ£¬Êä³ö¦ÐµÄÖµ²¢Í³¼ÆÀÛ¼ÓµÄÏîÊý¡£ **Êä³ö¸ñʽҪÇó£º\²ÉÓÃdouble¶¨ÒåÀۼӺͱäÁ¿

´ð°¸£º

#include intmain() {

doubled = 0, pi; inti, j = 0, k = 1;

for(i = 1;1 / (double)i >= 0.0001 || 1 /(double) i < -0.0001; i = i + 2) {

if(k % 2 == 0) {

d = d - 1 / (double)i; j++;

}

k++; } else {

d = d + 1 / (double)i; j++; k++; } }

d = d + 1/(double)i; j++;

pi = 4 * d;

printf(\

---------------------------------55 56.

´Ó¼üÅÌÊäÈë10¸öÕûÊý£¬±à³Ì¼ÆËã²¢Êä³öÆä×î´óÖµ¡¢×îСֵ¼°ÆäËùÔÚÔªËØµÄϱêλÖá£

ÊäÈë¸ñʽ£º\

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

1 2 3 4 5 6 7 8 9 10 Êä³öÑùÀý£º max=10, pos=9 min=1, pos=0

´ð°¸£º

#include main() {

inta[10] = {0}, j, i = 0, k = 0; intc, b;

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

scanf(\ if(a[j] > i) {

i = a[j]; c = j; } if(j == 0) {

k = a[j]; b = j;

ÁªÏµ¿Í·þ£º779662525#qq.com(#Ìæ»»Îª@)