4

#include <stdio.h>
const int N = 4;
int main()
{
    int a[N] = { 2, 0, 2, 1 }; 
    char b[N] = { '2', '0', '1', '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]);
}

 

 

#include <stdio.h>
const int N = 1000;
int fun(int n, int m, int bb[N])
{
    int i, j, k = 0, flag;
    for (j = n; j <= m; j++)
    {
        bb[m - n] = j;
        for (i = 2; i < j; i++)
            if (j % 2 == 0)
            {
                flag = 0;
                break;
            }
        if (j % 2 != 0)
            bb[k++] = j;
    }
    return k;
}
int main()
{
    int n = 0, m = 0, i, k, bb[N];
    scanf_s("%d", &n);
    scanf_s("%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;
}

 

 

#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_s("%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 max = 0, i;
    for (i = 0; i < n; i++)
    {
        if (x[i] > max)
            max = x[i];
    }
    return max;
}

 

 

#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)
{
    int j, b[100];
    int i = 0;
    do
    {
        b[i] = x % n;
        x = x / n;
        i++;
    } while (x != 0);
    for (j = i - 1; j >= 0; j--)
    {
        if (b[j] < 10)
        {
            printf("%d", b[j]);
        }
        else
        {
            printf("%c", b[j] + 55);
        }
    }
    printf("\n");
}