Preliminary practice of niuke.com (10)

Catalog

1. Matrix equality determination

Method 1：

Method 2：

2. Matrix exchange

3. Little Lele and hexadecimal conversion

---

1. Matrix equality determination

Method 1：

#include<stdio.h>
int main()
{
    int n = 0;
    int m = 0;
    scanf("%d %d",&n,&m);
    int arr1[10][10] = {0};
    int arr2[10][10] = {0};
    int i = 0;
    int j= 0;
    for( i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            scanf("%d",&arr1[i][j]);
        }
    }
    for( i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            scanf("%d",&arr2[i][j]);
        }
    }
    int flag = 1;
    for( i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            if(arr1[i][j]!=arr2[i][j])
            {
                flag = 0;
                break;
            }
        }
    }
    if(flag)
    {
        printf("Yes\n");
    }
    else
    {
        printf("No\n");
    }
    return 0;
}

Method 2：

( This method is simpler ）

#include<stdio.h>
int main()
{
    int n = 0;
    int m = 0;
    scanf("%d %d",&n,&m);
    int arr1[10][10] = {0};
    int arr2[10][10] = {0};
    int i = 0;
    int j= 0;
    for( i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            scanf("%d",&arr1[i][j]);
        }
    }
    for( i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            scanf("%d",&arr2[i][j]);
        }
    }

    for( i = 0;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            if(arr1[i][j]!=arr2[i][j])
            {
                printf("No\n");
                return 0;
            }
        }
    }   
    printf("Yes\n");
    
    return 0;
}

2. Matrix exchange

#include<stdio.h>
int main()
{
    int n = 0;
    int m = 0;
    int k = 0;
    int arr[10][10] = { 0 };
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            scanf("%d", &arr[i][j]);
        }
    }
    scanf("%d", &k);// There is a... In the input buffer here \n
    char t = 0;
    int x = 0;
    int y = 0;
    //%c The preceding space is used to absorb the input buffer \n
    // Only when reading characters will there be strict requirements on whether the data in the input buffer is empty 
    // And in the %d I didn't ask for it when I arrived 
    
    for (int i = 0; i < k; i++)
    {
        scanf(" %c %d %d", &t, &x, &y);
        if (t == 'r')
        {
            for (int j = 0; j < m; j++)
            {
                int tmp = arr[x-1][j];
                arr[x-1][j] = arr[y-1][j];
                arr[y-1][j] = tmp;
            }
        }
        else if (t == 'c')
        {
            for (int j = 0; j < n; j++)
            {
                int tmp = arr[j][x-1];
                arr[j][x-1] = arr[j][y-1];
                arr[j][y-1] = tmp;
            }
        }
    }
    
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            printf("%d ", arr[i][j]);
        }
        printf("\n");
    }
    return 0;
}

3. Little Lele and hexadecimal conversion

#include<stdio.h>
int main()
{
    int n = 0;
    int arr[50]={0};
    int i = 0;
    scanf("%d",&n);
    while(n)
    {
        arr[i] = n%6;
        i++;
        n/=6;
    }
    for(i--;i>=0;i--)
    {
        printf("%d",arr[i]);
    }
    return 0;
}