素数求法/

3.数组置换(改错上次)

#include<stdio.h>

int main(){

       int a[3][2]={{2,4},{6,9},{12,8}};

       int b[2][3],i,j;

       printf("数组 a:\n");

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

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

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

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

              }

              printf("\n");

       }

       printf("数组 b:\n");

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

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

                     printf("%4d",b[i][j]);

              }

              printf("\n");

             

       }

      

              return 0;

}

1.    求1-100之间的所有素数:

#include<stdio.h>

       intmain(){

              inti,j;

              for(i=1;i<=100;i+=2){

                     inttemp=1;

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

                            if(i%j==0){

                                   temp=0;

                                   break;

                            }

                     }

                     if(temp==1)

                            printf("%d  ",i);

              }

                     return0;

}

2.    有两个整形变量m,n.求这两个整形变量的最小公倍数:

#include<stdio.h>

       intmain(){

              inti,m,n;

              intresult=0;

              printf("请输入两个整形数m,n:");

              scanf("%d,%d",&m,&n);

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

                     if(i%m==0&& i%n==0){

                            result=i;

                            printf("m和n的最小公倍数是:%d", result);

                            break;

                     }

              }

              return0;

}

3.    输出杨辉三角的前世行:

老师,这个题对我有点困难..........