实验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; }

 

 是，4

是，1

#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]); }

 

 

 是，4

是，1

#include <stdio.h>
#define N 1000 
#pragma warning (disable:4996)
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!=0) bb[k++] = j;
    }
    return k; 
}
int main() {
    int n = 0, m = 0, i, 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; 
}

 

 

#include <stdio.h> 
#pragma warning (disable:4996)
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,t;
    t = x[0];
    for (i = 0;i < n;i++) {
        if (t < x[i])
            t = x[i];
    }
    return t;
}

 

 

#include <stdio.h>
#pragma warning(disable:4996)
void dec2n(int x, int n);
int main() { 
    int x; printf("输入一个十进制整数: ");
    scanf("%d", &x);
    dec2n(x, 2); 
    dec2n(x, 8); 
    dec2n(x, 16); 
return 0;
}

 void dec2n(int x, int n) { 
     int a[1000],i=0,c;
     if (n == 2) {
         while (x / 2 != 0) {
             a[i] = x % 2;
             x = x / 2;
             i++;
         }
         a[i] = x;
         for (;i >= 0;i--)
             printf("%d", a[i]);
         printf("\n");
     }
     else if (n==8){
         while (x / 8 != 0) {
             a[i] = x % 8;
             x = x / 8;
             i++;
         }
         a[i] = x;
         for (;i >= 0;i--)
             printf("%d", a[i]);
         printf("\n");
     }
     else{
         while (x / 16 != 0) {
             a[i] = x % 16;
             x = x / 16;
             i++;
         }
         a[i] = x;
         c = i;
         
             
      for (;i >= 0;i--){
          switch (a[i])
          {
          case 10:printf("A"); break;
          case 11:printf("B"); break;
          case 12:printf("C"); break;
          case 13:printf("D"); break;
          case 14:printf("E"); break;
          case 15:printf("F"); break;
          default:printf("%d", a[i]);
          }
      }
    printf("\n");
     }
}

 

 

#include<stdio.h>
#pragma warning(disable:4996)
int main() {
    int a, b, j, i,n;
    scanf("%d",&n);
    for ( i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
        {
            if (i < j)
                printf("%d", i);
            else
                printf("%d", j);
        }
        printf("\n");
    }
    return 0;
}