4
#include <stdio.h> const int N = 4; int main() { int a[N] = {2, 0, 2, 1}; // 定义一个int型数组a,包含N个元素 char b[N] = {'2', '0', '1', '1'}; // 定义一个char型数组a,包含N个元素 int i; printf("sizeof(int) = %d\n", sizeof(int)); printf("sizeof(char) = %d\n", sizeof(char)); printf("\n");// 输出数组a中每个元素的地址(以十六进制显示)、元素值 for (i = 0; i < N; ++i) printf("%x: %d\n", &a[i], a[i]); printf("\n");// 输出数组b中每个元素的地址(以十六进制显示)、元素值 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;// 输出二维数组a中每个元素的地址(以十六进制显示)、元素值 for (i = 0; i < 2; ++i) for (j = 0; j < 3; ++j) printf("%x: %d\n", &a[i][j], a[i][j]); printf("\n");// 输出二维数组b中每个元素的地址(以十六进制显示)、元素值 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> #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, 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> 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 max = x[0]; int i; for(i = 1;i < n;i++) { if(x[i]>x[i-1]) max = x[i]; } return max; }
#include<stdio.h> #include<stdlib.h> #define N 100 void fun(int x[N][N], int n); int main() { int n, i, j, a[N][N]; printf("Enter n:"); while(scanf("%d", &n)!=EOF) { fun(a, n); for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { printf("%d ", a[i][j]); } printf("\n"); } printf("Enter n:"); } return 0; } void fun(int x[N][N], int n) { int i, j; for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (i <= j) x[i][j] = i; else x[i][j] = j;