CÓïÑÔÁ·Ï°Ì⣨ɽ¶«¿Æ¼¼´óѧÍÂѪÕûÀí£© ÏÂÔر¾ÎÄ

int m,n,i,j,k,t;

scanf(\printf(\ for(i=n;i>=m;i--) { t=0; for(j=2;j<=sqrt(i);j++)//12 if(i%j==0) t=1; if(t==0&&i>1) printf(\ } printf(\return 0; }

22¡¢ Sum Problem (II) : Input/Output Pratice

Description

¼ÆËãÈô¸ÉÕûÊýµÄºÍ£¬ÕâЩÕûÊý¶¼ÊÇСÓÚ1000µÄ·Ç¸ºÕûÊý¡£ Input

ÊäÈëµÄµÚÒ»ÐÐÊÇÒ»¸öÕûÊýM£¬ºóÃæÓÐM¸ö²âÊÔÑùÀý¡£Ã¿¸ö²âÊÔÑùÀýÒÔÒ»¸öÕûÊýN¿ªÊ¼£¬ºóÃæ½Ó×ÅÊÇN¸öÕûÊý¡£ Output

ÿ×é²âÊÔÑùÀý¶ÔÓ¦Ò»ÐÐÊä³ö£¬ÎªËù¸øµÄN¸öÕûÊýÖ®ºÍ£¬Ë³ÐòÓëÊäÈë¶ÔÓ¦¡£ Sample Input 2

3 1 2 3

5 10 15 20 30 50 Sample Output 6 125

Answer

#include int main() {

int m,n,a,i,j,s; scanf(\ for(i=1;i<=m;i++) {

scanf(\ s=0;

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

scanf(\ s=s+a; }

printf(\ }

return 0; }

23¡¢Ê®½øÖÆÕûÊýת¶þ½øÖÆ

Description

¸ø³öÒ»¸öÊ®½øÖƵķǸºÕûÊýx£¬x<=216£¬°ÑËüת»»³É¶þ½øÖÆÊýÊä³ö¡£ Input

ÊäÈëΪ¶àÐУ¬Ã¿ÐÐÒ»¸öÕûÊýx£¬ÖÁ¶ÁÈëEOF½áÊø¡£ Output

ÿÐÐÊä³öx¶ÔÓ¦µÄ¶þ½øÖÆÊýÖµ¡£

Sample Input 0 1 3 33 65535

Sample Output 0 1 11

100001

1111111111111111 Answer

#include int main() {

int a[100],i,b;

while(scanf(\ {

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

a[i]=b%2; b=b/2; if(b==0) break; }

for(;i>=0;) {

printf(\ i--; }

printf(\ }

return 0; }

24¡¢¼òµ¥µÄÕûÊýÅÅÐò

Description

¶Ô¸ø³öµÄÈô¸ÉÕûÊý°´´ÓСµ½´óÅÅÐò¡£ Input

ÊäÈëµÄµÚÒ»¸öÊýΪn£¨n<=1000£©£¬ºó½Ón¸öÕûÊý¡£ Output

°´´ÓСµ½´óµÄ˳ÐòÊä³öÕâЩÕûÊý£¬Ã¿Á½¸öÕûÊýÖ®¼äÓÃÒ»¸ö¿Õ¸ñ·Ö¸ô¿ª£¬×îºóÒ»¸öÕûÊýºóÃæûÓпոñ¡£

Sample Input

10 3 9 1 5 2 8 5 6 7 3 Sample Output 1 2 3 3 5 5 6 7 8 9 Answer

#include int main() {

int c,i,n,j; int a[1000];

scanf(\ for (i=0;i

scanf(\ for(i=1;i<=n-1;i++) { for(j=0;ja[j+1]) { c=a[j]; a[j]=a[j+1]; a[j+1]=c; } } }

printf(\ for(i=1;i

25¡¢ÍÃ×ӵķ±Ö³ÎÊÌâ

Description

¼ÙÉèÒ»¶ÔÍÃ×ÓÿÔÂÄÜÉúÒ»¶ÔСÍã¨Ò»´ÆÒ»ÐÛ£©£¬Ã¿¶ÔСÍóöÉúºóµÄÏÂÒ»¸öÔÂÊÇûÓз±Ö³ÄÜÁ¦µÄ£¬ÖÁ³öÉúºóµÄµÚÈý¸öÔ¿ªÊ¼ÓÖ¿ÉÒÔÿÔÂÉúÒ»¶ÓСÍã¬ÎÊ´ÓÒ»¶Ô¸Õ³öÉúµÄСÍÿªÊ¼£¬¾­¹ýÈô¸É¸öÔºóÒ»¹²ÓжàÉÙÍÃ×Ó£¨¼ÙÉèÔڴ˹ý³ÌÖÐÍÃ×ÓûÓÐËÀÍö£©£¿

Õâ¸öÎÊÌâÊÇÒâ´óÀûÊýѧ¼Ò·Æ²¨ÄÇÆõ£¨Fibonacci£©ÔÚËû1202Äê³ö°æµÄ¡¶ËãÅÌÈ«Êé¡·ÖÐÌá³öÀ´µÄ£¬´ÓµÚÒ»¶Ô¸Õ³öÉúµÄСÍÿªÊ¼Ã¿ÔµÄÍÃ×ÓÊý±»³Ë×ø·Æ²¨ÄÇÆõÐòÁС£ Input

ÊäÈëµÄµÚÒ»¸öÊýΪn£¬½ÓÏÂÀ´ÓÐn¸öÊý×Ö¡£Ã¿¸öÊý×ÖΪһ¸öÔ·Ým£¨m<=45£©¡£ Output

Êä³öΪnÐУ¬Ã¿ÐÐΪµÚm¸öÔºóµÄÍÃ×Ó×ÜÊý¡£ Sample Input 6

1 2 3 4 5 10 Sample Output 1 2 3 5 8 89

Answer

#include int main() {

int n,x,i;

int a[50],b[50]; a[0]=1; a[1]=1; i=2;

while(i<50) {

a[i]=a[i-1]+a[i-2]; i++; }

scanf(\ for(i=1;i<=x;i++) {

scanf(\ b[i]=a[n]; }

for(i=1;i<=x;i++)

printf(\}

26µÇ¼ÃÜÂëÑéÖ¤

Description

±àдһ¸ö³ÌÐò£¬Ä£ÄâÓû§µÇ¼ϵͳµÄÃÜÂëÑéÖ¤¹ý³Ì¡£ÏµÍ³Ìṩ¸øÓû§µÄÃÜÂ볤¶È×Ϊ20¸ö×Ö·û£¬ÈôÃÜÂëÊäÈë´íÎó¿ÉÒÔÔÙ´ÎÊäÈë¡£µ«ÎªÁ˱£Ö¤Óû§ÃÜÂ밲ȫ£¬ÈôÁ¬ÐøÊäÈëÃÜÂë´íÎ󳬹ý5´Î¾Í»áËø¶¨Õ˺ÅÒ»¶Îʱ¼ä¡£ Input

ÊäÈëΪÈô¸É¸ö´®£¬ÖÁEOF½áÊø¡£ÊäÈëµÄµÚÒ»¸ö´®ÊÇÓû§µÄÕýÈ·ÃÜÂ룬ºóÃæµÄ´®ÎªÄ£ÄâÓû§µÇ¼ʱµÄÊäÈëµÄÃÜÂë¡£ Output

ÿ´ÎÊäÈë´íÎóµÄÃÜÂ룬Êä³öÒ»¸ö¡°Wrong!¡±£¬ÈôÊäÈëµÄÃÜÂëΪÕýÈ·µÄ£¬Êä³öÒ»¸ö¡°Welcome!¡±£¬²¢½áÊøÃÜÂë²âÊÔ¡£ÈôÇ°5´ÎÊäÈëµÄÃÜÂ붼ÊÇ´íÎóµÄ£¬ÔòºóÃæµÄÊäÈëÖв»¹ÜÊÇ·ñÓÐÕýÈ·µÄÃÜÂ붼Êä³ö¡°Out of limited!¡±¡£ Sample Input abcdefg

123456 kkkkkkkk abcdefg Sample Output Wrong! Wrong! Welcome! Answer

#include #include int main() {

char a[20],b[20]; int i,j=1;

scanf(\

while(scanf(\ {

if(j<=5) {

if((strcmp(a,b)==0)) {

printf(\ break; } else

printf(\ j++; }

else printf(\ } }

27¡¢ Matrix Problem : Array Pratice

Description ÇóÒ»¸öm¡Án½×¾ØÕóAµÄתÖþØÕóAT¡£¾ØÕóAµÄÿ¸öÔªËض¼ÔÚintÀàÐ͵ķ¶Î§Ö®ÄÚ¡£ Input

ÊäÈëµÄµÚÒ»ÐÐΪһ¸öÕûÊýM(M>0)£¬ºóÃæÓÐM×éÊäÈëÊý¾Ý¡£Ã¿×éÊý¾ÝÒÔÁ½¸öÕýÕûÊýmºÍn¿ªÊ¼£¬Âú×ã0