第四次上机

1.#include <stdio.h>

int main(){

         int a[10],i,j,t;

         printf("the original numbers:\n");

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

                   scanf("%d",&a[i]);

         }

         printf("\n");

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

                   for(i=0;i<9-j;i++){

                            if(a[i]>a[i+1]){

                                     t=a[i];

                                     a[i]=a[i+1];

                                     a[i+1]=t;

                            }

                   }

         }

         printf("the new numbers:\n");

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

                   printf("%d ",a[i]);

         }

         printf("\n");

         return 0;

}

2. #include <stdio.h>

int main(){

         int a[3][3],i,j,b=0;

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

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

                            scanf("%d",&a[i][j]);

 

                   }

         }

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

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

                            if((i==j)||(i+j==2)){

                                     b=b+a[i][j];

 

                            }

         }

}

        

         printf("两对角线之和:%d\n",b);

         return 0;

}

3. #include <stdio.h>

int main(){

         char string[81];

         int i,num=0,word=0;

         char c;

         gets(string);

         for(i=0;(c=string[i])!='\0';i++)

                   if(c==' ') word=0;

                   else if(word==0){

                            word=1;

                            num++;

                   }

                   printf("There are %d words in this line.\n",num);

         return 0;

}

4. #include <stdio.h>

int main(){

         int a[100],i,j,k;

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

                   a[i]=i;

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

                            if(j<i)

                                     if(a[i]%j==0)

                                               break;

                            if(a[i]-j==0)

                                     printf("%d\n",a[i]);

                   }

         }

         return 0;

}

posted @ 2019-05-23 15:23  P201821430035  阅读(96)  评论(0编辑  收藏  举报