zoukankan      html  css  js  c++  java
  • 第九次作业

    作业1

    #include<stdio.h>
    int main(void)
    {
        int i,j,n,temp;
        int a[6][6];
        printf("Enter n:");
        scanf("%d",&n);
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                a[i][j]=i*n+j+1;
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                if(i<=j){
                    temp=a[i][j];
                    a[i][j]=a[j][i];
                    a[j][i]=temp;
                }
        for(i=0;i<n;i++){
            for(j=0;j<n;j++)
                printf("%4d",a[i][j]);
            printf("
    ");
    }
        return 0;                
                
    }

    作业2

    #include<stdio.h>
    int main(void)
    {
        int i,j;
        int a[10][10];
    
        for(i=1;i<10;i++){  
            for(j=1;j<=i;j++){
                a[i][j]=i*j;
                printf("%d*%d=%d	",i,j,a[i][j]); 
            }
            printf("
    ");
        }
        return 0;
    }

    作业3

    #include<stdio.h>
    int main(void)
    {
        int i,k,temp; 
        char str [80];
        int n;
        printf("enter a str:");
        i=0;
        while((str[i]=getchar())!='
    ')i++;
        str[i]='';
        k=i-1;
        for(i=0;i<k;i++) {
            temp=str[i];
            str[i]=str[k];
            str[k]=temp;
            k--;
        }
        for(i=0;str[i]!='';i++)
        putchar(str[i]);
        return 0;
    }

    作业4

    #include<stdio.h>
    int main(void)
    {
        int i=0,k=0,flag=0;
        char str[80],m;
        printf("input a character:");
        scanf("%c",&m);
        printf("input a string:");
        getchar();
        while((str[i]=getchar())!='
    ')
            i++;
            str[i]='';
        for(i=0;str[i]!='';i++){
            if(str[i]==m)k=i;
                 flag=1;    
       }
        if(flag==1)
            printf("index=%d
    ",k);
            else printf("not found!
    ");
         return 0;
        
        
    }
  • 相关阅读:
    3.28
    03.21
    03.16
    03.15
    03.14小记
    [LC] 96. Unique Binary Search Trees
    [LC] 298. Binary Tree Longest Consecutive Sequence
    [LC] 102. Binary Tree Level Order Traversal
    [LC] 107. Binary Tree Level Order Traversal II
    [LC] 513. Find Bottom Left Tree Value
  • 原文地址:https://www.cnblogs.com/wangxinmu/p/6094082.html
Copyright © 2011-2022 走看看