NOJ——西北工业大学C语言练习（5）

#include <stdio.h>
const int N = 100;
int main()
{
    int m[N][N];
    int n;
    int num;
    scanf("%d", &n);
    for (int i = 0; i < n;i++)
    {
        for (int j = 0; j < n;j++){
            scanf("%d", &num);
            m[i][j] = num;
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n - i; j++)
        {
            printf("%d ", m[i][j]);
        }
        printf("\n");
    }
}

#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
    int n, m;
    int a[10000], b[10000];
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n;i++)
    {
        scanf("%d", &a[i]);
    }
    for (int j = 0; j < m; j++)
    {
        scanf("%d", &b[j]);
    }
    sort(a, a + n);
    sort(b, b + m);
    int sum = 0;
    int vis = 0;
    for (int i = 0; i < m; i++)
    {
        if(b[i] >= a[vis])
        {
            vis++;
            sum += b[i];
        }
        if(vis == n){
            printf("%d", sum);
            return 0;
        }
    }
    printf("NULL");
}

#include <stdio.h>
int main()
{
    int N;
    int a[100];
    int m;
    scanf("%d", &N);
    for (int i = 0; i < N;i++)
    {
        scanf("%d", &a[i]);
    }
    scanf("%d", &m);
    int begin = 0;
    int end = N;
    int mid = (end - begin) / 2;
    while(a[mid] != m){
        if(a[mid] < m){
            begin = mid+1;
            mid = (end + begin) / 2;
        }
        else if(a[mid] > m){
            end = mid-1;
            mid = (end + begin) / 2;
        }
    }
    if(a[mid] == m){
        printf("%d", mid);
    }
    else
        printf("null");
}

#include <stdio.h>
int main()
{
    int n, m;
    int a[100][100];
    int edge = 0;
    int internal = 0;
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n;i++){
        for (int j = 0; j < m;j++){
            scanf("%d", &a[i][j]);
            if(i == 0 || j == 0 || i == n-1 || j == m-1){
                edge += a[i][j];
            }
            else{
                internal += a[i][j];
            }
        }
    }
    printf("%d", edge - internal);
}

#include <stdio.h>
int main()
{
    int n;
    int a[100];
    scanf("%d", &n);
    for (int i = 0; i < n;i++){
        scanf("%d", &a[i]);
    }
    for (int i = 1; i < n;i += 2){
        printf("%d ", a[i]);
    }
}

#include <stdio.h>
int main()
{
    int n, a[100], s, e, sum = 0;
    scanf("%d", &n);
    for (int i = 0; i < n;i++)
    {
        scanf("%d", &a[i]);

    }
    scanf("%d%d", &s, &e);
    for (int i = 0; i < n; i++)
    {
        if (i >= s && i <= e)
        {
            sum += a[i];
        }
    }
    printf("%lf", (double)sum / (e - s + 1));
}

#include <stdio.h>
int main()
{
    int n, a[100], b[100], c[100];
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &b[i]);
        c[i] = a[i] + b[i];
    }
    for (int i = 0; i < n; i++)
    {
        printf("%d ", c[i]);
    }
}

#include <stdio.h>
const int N = 100;
int main()
{
    int m[N][N];
    int n;
    int num;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            scanf("%d", &num);
            m[i][j] = num;
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if(i <= j)
                printf("%d ", m[i][j]);
            else
                printf("  ");
        }
        printf("\n");
    }
}

#include <stdio.h>
const int N = 100;
int main()
{
    int m[N][N];
    int n;
    int num;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            scanf("%d", &num);
            m[i][j] = num;
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (i >= j)
                printf("%d ", m[i][j]);
            else
                printf("  ");
        }
        printf("\n");
    }
}

#include <stdio.h>
void SelectionSort(int a[],int s,int m)
{
    for (int i = s; i < s + m;i++)
    {
        for (int j = i + 1; j < s + m;j++)
        {
            if(a[j] > a[i]){
                int temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
}
int main()
{
    int n, a[100], s, m;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    scanf("%d%d", &s, &m);
    SelectionSort(a,s,m);
    for (int i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
}