40-50

#include "stdio.h"

void main()
 { 
     int arr[30],sum=0;
     int i,j;
     for(i=0;i<30;i++)
         arr[i]=2*i+2;
    //计算与输出 
     for(i=0;i<30;i++)
     {
         sum+=arr[i];
         if((i+1)%5==0)
            {
                printf("the average is :=%d\n",sum/5);
                sum=0;
           }
     }
 }

#include <stdio.h>
#include <stdlib.h>
void main()
{
    int m,n,i,cnt=0,CNT=0,flag;
    printf("please input the m and n:\n");
    scanf("%d%d",&m,&n);
    int *a=(int*)malloc(n*sizeof(int));
    for(i=0;i<n;i++)
        a[i]=i+1;
    while(1)
    {
        flag=CNT;
        for(i=0;i<n;i++)
        {
           if(a[i]!=0)
            {
                cnt++;
                CNT++;
            }
          if(cnt==m)
            {
               a[i]=0;
               cnt=0;
               printf("%d ",i+1);
           }
    }
    if(CNT==flag+1)
         break;
    }
    free(a);
}

#include "stdio.h"
 void main()
 {
     int arr[3][3];
     int i,j,max,min;
     int max_i,max_j;
     int min_i,min_j;
     printf("please input the arr:\n");
     for(i=0;i<3;i++)
         for(j=0;j<3;j++)
             scanf("%d",&arr[i][j]);
     for(i=0;i<3;i++)
       {
        for(j=0;j<3;j++)
             printf("%5d",arr[i][j]);
         printf("\n");   
      } 
     max=arr[0][0];
     min=arr[0][0];
     for(i=0;i<3;i++)
        for(j=0;j<3;j++)
           {
               if(arr[i][j]>max)
               {
               max=arr[i][j];
               max_i=i;
               max_j=j;
            }
            if(arr[i][j]<min)
               {
               min=arr[i][j];
               min_i=i;
               min_j=j;
            }
           } 
    printf("the result is :\n");
    printf("the max element is %d, index is [%d][%d]\n\n",max,max_i,max_j);
    printf("the min element is %d, index is [%d][%d]\n\n",min,min_i,min_j);
    }

#include "stdio.h"
 void main()
 {
     int arr[3][3];
     int i,j;
     int sum_1=0,sum_2=0;
     printf("please input the arr:\n");
     for(i=0;i<3;i++)
         for(j=0;j<3;j++)
             scanf("%d",&arr[i][j]); 
     for(i=0;i<3;i++)
       {
        for(j=0;j<3;j++)
             printf("%5d",arr[i][j]);
         printf("\n");   
      }  
     for(i=0;i<3;i++)
        for(j=0;j<3;j++)
            {
           if(i==j)
                 sum_1+=arr[i][j];
            if(i+j==2)
                 sum_2+=arr[i][j];
             } 
    printf("\n the sum_1 is %d,  the sum_2 is %d  :\n",sum_1,sum_2);
} 

#include<stdio.h>
void  main()
{
    int i,j,n=0,a[100][100]={1};
    printf("请输入杨辉三角的行数:");
     scanf("%d",&n);
     if(n>=1||n<=99)
     {
          for(i=1;i<=n;i++)
         {
             a[i][0]=1;

             for(j=1;j<i;j++)
             a[i][j]=a[i-1][j-1]+a[i-1][j];
         }

         for(i=0;i<=n;i++)
         {
             for(j=0;j<i;j++)
             printf("%5d",a[i][j]);
             printf("\n");
         }
     }
}

#include "stdio.h"
 void main()
 {
     int arr[3][3];
     int i,j,max,min;
     int max_i,max_j;
     int min_i,min_j;
     printf("please input the arr:\n");
     for(i=0;i<3;i++)
         for(j=0;j<3;j++)
             scanf("%d",&arr[i][j]);
     for(i=0;i<3;i++)
       {
        for(j=0;j<3;j++)
             printf("%5d",arr[i][j]);
         printf("\n");   
      } 
     max=arr[0][0];
     min=arr[0][0];
     for(i=0;i<3;i++)
        for(j=0;j<3;j++)
           {
               if(arr[i][j]>max)
               {
               max=arr[i][j];
               max_i=i;
               max_j=j;
            }
            if(arr[i][j]<min)
               {
               min=arr[i][j];
               min_i=i;
               min_j=j;
            }
           }
    printf("the result is :\n");
    printf("the max element is %d, index is [%d][%d]\n\n",max,max_i,max_j);
    printf("the min element is %d, index is [%d][%d]\n\n",min,min_i,min_j);
    }

#include<stdio.h>
main()
{
    int year,mouth,day,days=0;
    int w,m,d,y;
    printf("请输入年,月,日\n");
    scanf("%d%d%d",&y,&m,&d);
    mouth=m;
    year=y;
    day=d;
    switch(mouth)
        {
        case 1:days=0;break;
        case 2:days=31;break;
        case 3:days=59;break;
        case 4:days=90;break;
        case 5:days=120;break;
        case 6:days=151;break;
        case 7:days=181;break;
        case 8:days=212;break;
        case 9:days=243;break;
        case 10:days=273;break;
        case 11:days=304;break;
        case 12:days=334;break;
    }
    days+=day;
    if(mouth>2&&year%4==0&&year%100!=0||year%400==0)
       days++;
    printf("%d年%d月%d日第%d天",year,mouth,day,days);
    }

#include<stdio.h>
main()
{
    int i,j,k,count=0;
    for(i=1;i<5;i++)
    {
       for(j=0;j<5;j++)
        {
           for(k=0;k<5;k++)
           {
              if(i!=j&&j!=k&&i!=k)
                {
                    count++;
                    printf("%d%d%d    ",i,j,k);
                    if(count%5==0)
                        printf("\n");
                }
            }
        }
   }
   printf("\n一共有%d种方法",count);
}

#include"stdio.h"
void main()
{
    int a,b,t,r,n;
    printf("please input the a and b：\n");
    scanf("%d%d",&a,&b);
    if(a<b)
    {
        t=b;
        b=a;
        a=t;
    }
    r=a%b;
    n=a*b;
    while(r!=0)
    {
        a=b;
        b=r;
        r=a%b;
    }
    printf("这两个数的最大公约数为%d,最小公倍数为%d\n",b,n/b);
} 

#include <stdio.h>
void main()
{
    double i,s=0,x=100,y;
    for(i=1;i<=10;i++)
    {
        y=x/2;
        s=s+x+y; 
        x=y; 
    }
    s=s-y; 
    printf("共经过：%lf米\n",s);
    printf("第十次反弹:%lf米\n",y);
}