Res - 2009ÏÄѧÆÚCÓïÑÔÉÏ»úÁ·Ï°²Î¿¼´ð°¸»ã×Ü

ÏÄѧÆÚC³ÌÐòÉè¼ÆÉÏ»úÁ·Ï°²Î¿¼´ð°¸

break;} } } * * * *

#include int main(void) printf(\ } } int prime(int n) { if (n == 1) return 0; for(i=2;i<=n/2;i++){ int i; return 0; { int n; int repeat, ri; scanf(\ for(ri = 1; ri <= repeat; ri++){ scanf(\ for (nRow = 1; nRow <= n*2-1; nRow++) { } } if (nRow <= n) nVal = nRow; int nRow, nVal, nCol; if(n%i==0) return 0; } 40067

´òӡͼ°¸ } return 1; else nVal = 2*n - nRow; for (nCol=1; nCol <= n-nVal ;nCol++) printf(\ \ }

ÊäÈëÒ»¸öÕýÕûÊýrepeat (0

ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈë

2 (repeat=2) 3 (n=3) 4 (n=4) Êä³ö

* £¨n=3µÄÁâÐÎͼ°¸£© * * * * * * * * * * * *

* £¨n=4µÄÁâÐÎͼ°¸£© * * * * * * * * * * * * * * * * * * * *

for (nCol=1;nCol<= nVal*2-1; nCol++) printf(\ printf(\ÏÄ6ÖÜ

30062 Êä³ö21ÊÀ¼ÍËùÓÐÈòÄê

ÊäÈë21ÊÀ¼ÍËùÓеÄÈòÄê¡£ÅжÏÈòÄêµÄÌõ¼þÊÇ£ºÄܱ» 4 Õû³ýµ«²»Äܱ» 100 Õû³ý£¬»òÕßÄܱ» 400 Õû³ý¡£ Êä³öʹÓÃÓï¾ä printf(\ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚÊÇ˵Ã÷ Êä³ö 2000 2004 ¡£¡£¡£ 2092 2096

29

ÏÄѧÆÚC³ÌÐòÉè¼ÆÉÏ»úÁ·Ï°²Î¿¼´ð°¸

#include int main(void) { int year; for(year = 2000; year <= 2099; year++){ }

90001 µ÷ÊÔʾÀýerror09_1.cpp

ÊäÈëÒ»¸öÕýÕûÊýn£¨3¡Ün¡Ü10£©£¬ÔÙÊäÈën¸ö¹ÍÔ±µÄÐÅÏ¢£¬°üÀ¨ÐÕÃû¡¢»ù±¾¹¤×Ê¡¢¸¡¶¯¹¤×ʺÍÖ§³ö£¬Êä³öÿÈ˵ÄÐÕÃûºÍʵ·¢¹¤×Ê£¬Êµ·¢¹¤×Ê£½»ù±¾¹¤×Ê+¸¡¶¯¹¤×Ê-Ö§³ö¡£ ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈ룺 3

(n=3)

if((year%4==0&&year0!=0)||(year@0==0)) } printf(\s[i].jbg + s[i].fdg - s[i].zc); } ÔÚTC 2.0ÖУ¬ÈçÏÂÓï¾äÎÞ·¨Í¨¹ý£º scanf(\&s[i].jbg,&s[i].fdg,&s[i].zc); ¿ÉÒÔͨ¹ýÖмä±äÁ¿»ñµÃ¸¡µãÐ͵ĽṹµÄ³ÉÔ±±äÁ¿£º double t1,t2,t3; scanf(\&s[i].jbg,&s[i].fdg,&s[i].zc); s[i].jbg=t1; s[i].fdg=t2; s[i].zc=t3;

90002 ʱ¼ä»»Ëã

ÊäÈëÒ»¸öÕýÕûÊý repeat (0

ÊäÈëÒ»¸öʱ¼äÊýÖµ£¬ÔÙÊäÈëÃëÊý n£¬Êä³ö¸Ãʱ¼äÔÙ¹ý n ÃëºóµÄʱ¼äÖµ£¬Ê±¼äµÄ±íʾÐÎʽΪʱ:·Ö:Ã룬³¬¹ý 24 ʱ´Ó 0 Ê±ÖØÐ¿ªÊ¼¼ÆÊ±¡£

ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈ룺 3 0:0:1 59

11:59:40 30

23:59:40 301 Êä³ö£º

time: 0:1:0 (0:0:01¼ÓÉÏ59ÃëµÄÐÂʱ¼ä) time: 12:0:10 ¼ä)

time: 0:4:41 (23:59:40¼ÓÉÏ301ÃëµÄÐÂʱ¼ä)

#include int main(void) { int n; int repeat, ri; struct time{ int hour, minute, second; }time; scanf(\ (11:59:40¼ÓÉÏ30ÃëµÄÐÂʱ

(ÃëÊýn=301) (ÃëÊýn=30) (ÃëÊýn=59) (repeat=3)

zhao 240 400 75 qian 360 120 50 zhou 560 0 80 Êä³ö£º

zhao ʵ·¢¹¤×Ê£º 565.00 qian ʵ·¢¹¤×Ê£º 430.00 zhou ʵ·¢¹¤×Ê£º 480.00

#include int main (void) { int i, n; struct emp{ char name[10]; double jbg; double fdg; double zc; } s[10]; scanf(\ for(i=0;i

ÏÄѧÆÚC³ÌÐòÉè¼ÆÉÏ»úÁ·Ï°²Î¿¼´ð°¸

for(ri = 1; ri <= repeat; ri++){ scanf(\%d:%d:%d\&time.hour, &time.minute, &time.second); scanf(\ time.minute=time.minute+time.second/60; time.second=time.second`; if(time.minute>=60){ time.second=time.second+n; if(time.second>=60){ char name[10]; int score; }s[10]; scanf(\ scanf(\ } average=sum/n; sum+=s[i].score; sum=0; for(i=0;i=24) printf(\}

90004 ¼ÆËãÁ½¸ö¸´ÊýÖ®»ý

ÊäÈë4¸öÕûÊýa1,b1,a2,b2£¬·Ö±ð±íʾÁ½¸ö¸´ÊýµÄʵ²¿ÓëÐ鲿£¬ÇóÁ½¸ö¸´ÊýÖ®»ý(a1£«b1i)*(a2£«b2i)£¬³Ë»ýµÄʵ²¿Îª£º

time.hour=time.hour-24; } %d:%d:%d\\n\time.hour, } printf(\time.minute, time.second); } }

90003 ¼ÆËãÆ½¾ù³É¼¨

a1*a2£­b1*b2£¬Ð鲿Ϊ£ºa1*b2£«a2*b1¡£ ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈ룺 3 4 5 6 Êä³ö£º

(3+4i) * (5+6i) = -9 + 38i

#include int main(void) { struct complex{ int real; ÊäÈëÕûÊýn(n<10)£¬ÔÙÊäÈën¸öѧÉúµÄ»ù±¾ÐÅÏ¢£¬°üÀ¨ÐòºÅ¡¢ÐÕÃûºÍ³É¼¨£¬ÒªÇó¼ÆËã²¢Êä³öËûÃÇµÄÆ½¾ù³É¼¨(±£Áô2λСÊý)¡£

ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈ룺 3

(n=3)

int imag; }product, x, y; scanf(\&x.real, &x.imag, &y.real, &y.imag); product.real=x.real*y.real-x.imag*y.imag; product.imag=x.real*y.imag+x.imag*y.real; 1 zhang 70 2 wang 80 3 qian 90 Êä³ö£º average: 80.00

#include int main(void) { int i, n; double average, sum; struct student{ int num; printf(\x.imag, y.real, y.imag, product.real, product.imag); }

90005 ²éÕÒÊé¼®

31

ÏÄѧÆÚC³ÌÐòÉè¼ÆÉÏ»úÁ·Ï°²Î¿¼´ð°¸

±àд³ÌÐò£¬´Ó¼üÅÌÊäÈë n (n<10)±¾ÊéµÄÃû³ÆºÍ¶¨¼Û²¢´æÈë½á¹¹Êý×éÖУ¬²éÕÒ²¢Êä³öÆäÖж¨¼Û×î¸ßºÍ×îµÍµÄÊéµÄÃû³ÆºÍ¶¨¼Û¡£

ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈ룺 3

(n=3)

book[max_index].price, book[max_index].name); printf(\price: %.1f, %s\\n\book[min_index].price, book[min_index].name); }

90006 ͨѶ¼ÅÅÐò

ÊäÈën(n<10)¸öÅóÓѵÄÐÅÏ¢£¬°üÀ¨ÐÕÃû¡¢ÉúÈÕ¡¢µç»°ºÅÂ룬°´ÕÕÄêÁä´Ó´óµ½Ð¡µÄ˳ÐòÒÀ´ÎÊä³öͨѶ¼¡£ ÊäÈëÊä³öʾÀý£ºÀ¨ºÅÄÚΪ˵Ã÷ ÊäÈ룺 3

(n=3)

Programming in C 21.5

Programming in VB 18.5

Programming in Delphi 25.0 Êä³ö£º

highest price: 25.0, Programming in Delphi lowest price: 18.5, Programming in VB #include int main (void) { int i, max_index, min_index, n; double x; struct book{ char name[50]; double price; }book[10]; scanf(\ getchar(); for(i = 0; i < n; i++){ gets(book[i].name); scanf(\ getchar(); book[i].price = x; } max_index=1; min_index=1; for(i = 1; i < n; i++){ } price: %.1f, %s\\n\if(book[max_index].price

wang 19821020 0571-88018448 qian 19840619 13609876543 zhang 19850403 13912345678

#include #include int main (void) { int i, index, j, n; struct address_list{ char name[20]; long birthday; char phone[20]; }temp, friends[10]; scanf(\ for(i = 0; i < n; i++) scanf(\&friends[i].birthday, friends[i].phone); for(i = 0; i < n; i++){ index = i; for(j = i+1; j < n; j++) if friends[i].name, if(book[min_index].price>book[i].price) min_index=i; (friends[index].birthday>friends[j].birthday) index = j; temp =friends[index]; friends[index]=friends[i]; printf(\ 32

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