实验四

任务1-1:

#include <stdio.h>
#define N 4
int main()
{
int a[N] = {2, 0, 2, 2};
char b[N] = {'2', '0', '2', '2'};
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("%p: %d\n", &a[i], a[i]);
printf("\n");
// 输出数组b中每个元素的地址、值
for (i = 0; i < N; ++i)
printf("%p: %c\n", &b[i], b[i]);
printf("\n");
// 输出数组名a和b对应的值
printf("a = %p\n", a);
printf("b = %p\n", b);
return 0;
}

 

 ①:是连续存放的,占4个字节

②:是连续存放的,占1个字节

 ③:是;是

任务1-2:

#include <stdio.h>
#define N 2
#define M 3
int main()
{
int a[N][M] = {{1, 2, 3}, {4, 5, 6}};
char b[N][M] = {{'1', '2', '3'}, {'4', '5', '6'}};
int i, j;
// 输出二维数组a中每个元素的地址和值
for (i = 0; i < N; ++i)
for (j = 0; j < M; ++j)
printf("%p: %d\n", &a[i][j], a[i][j]);
printf("\n");
// 输出二维数组a中每个元素的地址和值
for (i = 0; i < N; ++i)
for (j = 0; j < M; ++j)
printf("%p: %c\n", &b[i][j], b[i][j]);
return 0;
}

 

 ①:是;四个字节单元

②:是;一个字节单元

 

任务二:

#include <stdio.h>
int days_of_year(int year, int month, int day);
int main()
{
int year, month, day;
int days;
while(scanf("%d%d%d", &year, &month, &day) != EOF)
{
days = days_of_year(year, month, day);
printf("%4d-%02d-%02d是这一年的第%d天.\n\n", year, month, day, days);
}
return 0;
}
int days_of_year(int year, int month, int day)
{
int n=0;
int i;
    int m[12]={31,28,31,30,31,30,31,31,30,31,30,31};
    if ((year%4==0&&year%100!=0)||(year%400==0))
        m[1]=29;
    for (i=0;i<month-1;i++)
        n=n+m[i];
    return n+day;
}

 

 

任务三:

#include <stdio.h>
#define N 5
void input(int x[], int n);
void output(int x[], int n);
double average(int x[], int n);
void sort(int x[], int n);
int main()
{
int scores[N];
double ave;
printf("录入%d个分数:\n", N);
input(scores, N);
printf("\n输出课程分数: \n");
output(scores, N);
printf("\n课程分数处理: 计算均分、排序...\n");
ave = average(scores, N);
sort(scores, N);
printf("\n输出课程均分: %.2f\n", ave);
printf("\n输出课程分数(高->低):\n");
output(scores, N);
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");
}
double average(int x[],int n)
{
int i;
double sum=0,ave;
for(i=0;i<n;i++)
sum=sum+x[i];
ave=sum/n;
return ave;
}
void sort(int x[],int n)
{
int i,j,k;
    for(i=0;i<n-1;i++)
    {
    for(j=0;j<n-1-i;j++)
    {
    if(x[j]<x[j+1])
    {
    k=x[j];
    x[j]=x[j+1];
    x[j+1]=k;
    }
    }
    }
}

 

 

任务四:

#include <stdio.h>
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)
{
if(n==2)
{
    int i;
    int a[80];
    for(i=0;x!=0;i++)
    {
        a[i]=x%2;
        x=x/2;
    }for(i--;i>=0;i--)
    printf("%d",a[i]);
    printf("\n");
}
    if(n==8)
    printf("%o\n",x);
    if(n==16)
    printf("%x",x);
}

 

 

实验五:

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

 

 

任务六:

#include <stdio.h>
#define N 80
int main()
{
char views1[N] = "hey, c, i hate u.";
char views2[N] = "hey, c, i love u.";
int a;
char b;
printf("original views:\n%s\n%s\n\n",views1,views2);
for(a=0;views1[a]!='\0';a++)
{
    b=views1[a];
    views1[a] = views2[a];
    views2[a] = b;
}
printf("swapping...\n\n%s\n%s",views1,views2);
return 0;
}

 

 任务七:

#include <stdio.h>
#include <string.h>
#define N 5
#define M 20
void bubble_sort(char str[][M], int n);
int main()
{
char name[][M] = {"Bob", "Bill", "Joseph", "Taylor", "George"};
int i;
printf("输出初始名单:\n");
for (i = 0; i < N; i++)
printf("%s\n", name[i]);
printf("\n排序中...\n");
bubble_sort(name, N);
printf("\n按字典序输出名单:\n");
for (i = 0; i < N; i++)
printf("%s\n", name[i]);
return 0;
}
void bubble_sort(char str[][M],int n)
{
    int i,j;
    char c[80];
    for(i=0;i<n-1;i++)
    {
        for(j=0;j<n-i-1;j++)
        {
            if(strcmp(str[j],str[j+1])>0)
            {
            strcpy(c,str[j]);
            strcpy(str[j],str[j+1]);
            strcpy(str[j+1],c);
            }
        }
    }
}

 

posted @ 2022-05-07 22:45  歌姬虎哥  阅读(21)  评论(0)    收藏  举报