实验四

#include<stdio.h>
const int N = 4;
int main()
{
    int a[N] = { 2,0,2,1 };
    char b[N] = { '2','0','2','1' };
    int i;
    printf("sizeof(int)=%d\n", sizeof(int));
    printf("sizeof(char)=%d\n", sizeof(char));
    printf("\n");
    for (i = 0; i < N; i++)
        printf("%x:%d\n", &a[i], a[i]);
    printf("\n");
    for (i = 0; i < N; ++i)
        printf("%x:%c\n", &b[i], b[i]);
    return 0;
}

 

 

#include<stdio.h>
int main()
{
    int a[2][3] = { {1,2,3},{4,5,6} };
    char b[2][3] = { {'1','2','3'},{'4','5','6'} };
    int i, j;
    for (i = 0; i < 2; i++)
        for (j = 0; j < 3; j++)
            printf("%x:%d\n", &a[i][j], a[i][j]);
    printf("\n");
    for (i = 0; i < 2; i++)
        for (j = 0; j < 3; j++)
            printf("%x:%c\n", &b[i][j], b[i][j]);
    return 0;
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define N 1000
int fun(int n, int m, int bb[N])
{
    int i, j, k = 0,flag;
    for (j = n; j <=m; j++)
    {
        flag = 1;
        for(i=2;i<j;i++)
            if (j % i == 0)
            {
                flag = 0;
                break;
            }
        if (flag==1)
            bb[k++] = j;
    }
    return k;
}
int main()
{
    int n = 0, m = 0, i, j, k, bb[N];
    scanf("%d", &n);
    scanf("%d", &m);
    for (i = 0; i < m - n; i++)
        bb[i] = 0;
    k = fun(n, m, bb);
    for (i = 0; i < k; i++)
        printf("%4d", bb[i]);
    return 0;
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
const int N = 5;
int find_max(int x[], int n);
void input(int x[], int n);
void output(int x[], int n);
int main()
{
    int a[N];
    int max;
    input(a, N);
    output(a, N);
    max = find_max(a, N);
    printf("max=%d\n", max);
    return 0;
}
void input(int x[], int n)
{
    int i;
    for (i = 0; i < n; i++)
        scanf("%d", &x[i]);
}
void output(int x[], int n)
{
    int i;
    for (i = 0; i < n; i++)
        printf("%d ", x[i]);
    printf("\n");
}
int find_max(int x[], int n)
{
    int i, j,t;
    for(i=0;i<n-1;i++)
        for (j = i + 1; j < n; j++)
        {
            if (x[i] < x[j])
            {
                t = x[i];
                x[i] = x[j];
                x[j] = t;
            }
        }
    return x[0];
}

 

 

#include<stdio.h>
void dec2n(int x, int n);
int main()
{
    int x;
    printf("输入一个十进制数：");
    scanf_s("%d", &x);
    dec2n(x, 2);
    dec2n(x, 8);
    dec2n(x, 16);
    return 0;
}
void dec2n(int x, int n)
{
    if (n == 8)
        printf("%o\n", x);
    if (n == 16)
        printf("%x\n", x);
    if (n == 2)
    {
        int i, a[100], t, h;
        i = 0;
        t = 0;
        while(1)
        {
            a[i] = x % 2;
            h = x / 2;
            if (x / 2 == 0)
                break;
            x = x / 2;
            i++;
            t++;
        } 
        for (i = t; i >= 0; i--)
            printf("%d", a[i]);
        printf("\n");
    }
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main()
{
    int i, j, a[10][10], n,b;
    printf("Enter n:");
    while (scanf("%d", &n) != EOF)
    {
        b = 1;
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= n; j++)
            {
                a[i][j] = (i <= j ? i : j);
            }
        }
        for (i = 1; i <= n; i++)
        {
            for (j=1;j<=n;j++)
                printf("%2d", a[i][j]);
            printf("\n");
        }
        printf("Enter n:");
    }
    return 0;
}