#include<stdio.h>
#define N 4
void test1() {
int a[N] = {1, 9, 8, 4};
int i;
printf("sizeof(a) = %d\n", sizeof(a));
for (i = 0; i < N; ++i)
printf("%p: %d\n", &a[i], a[i]);
printf("a = %p\n", a);
}
void test2() {
char b[N] = {'1', '9', '8', '4'};
int i;
// 输出数组b占用的内存字节数
printf("sizeof(b) = %d\n", sizeof(b));
// 输出char类型数组b中每个元素的地址、值
for (i = 0; i < N; ++i)
printf("%p: %c\n", &b[i], b[i]);
// 输出数组名b对应的值
printf("b = %p\n", b);
}
int main() {
printf("测试1: int类型一维数组\n");
test1();
printf("\n测试2: char类型一维数组\n");
test2();
return 0;
}
#include <stdio.h>
#define N 2
#define M 4
void test1() {
int a[N][M] = {{1, 9, 8, 4}, {2, 0, 4, 9}};
int i, j;
// 输出int类型二维数组a占用的内存字节数
printf("sizeof(a) = %d\n", sizeof(a));
// 输出int类型二维数组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");
// 输出int类型二维数组名a, 以及，a[0], a[1]的值
printf("a = %p\n", a);
printf("a[0] = %p\n", a[0]);
printf("a[1] = %p\n", a[1]);
printf("\n");
}
void test2() {
char b[N][M] = {{'1', '9', '8', '4'}, {'2', '0', '4', '9'}};
int i, j;
// 输出char类型二维数组b占用的内存字节数
printf("sizeof(b) = %d\n", sizeof(b));
// 输出char类型二维数组b中每个元素的地址、值
for (i = 0; i < N; ++i)
for (j = 0; j < M; ++j)
printf("%p: %c\n", &b[i][j], b[i][j]);
printf("\n");
// 输出char类型二维数组名b, 以及，b[0], b[1]的值
printf("b = %p\n", b);
printf("b[0] = %p\n", b[0]);
printf("b[1] = %p\n", b[1]);
}
int main() {
printf("测试1: int型两维数组");
test1();
printf("\n测试2: char型两维数组");
test2();
return 0;
}
#include <stdio.h>
#include <string.h>
#define N 80
void swap_str(char s1[N], char s2[N]);
void test1();
void test2();
int main() {
printf("测试1: 用两个一维char数组，实现两个字符串交换\n");
test1();
printf("\n测试2: 用二维char数组，实现两个字符串交换\n");
test2();
return 0;
}
void test1() {
char views1[N] = "hey, C, I hate u.";
char views2[N] = "hey, C, I love u.";
printf("交换前: \n");
puts(views1);
puts(views2);
swap_str(views1, views2);
printf("交换后: \n");
puts(views1);
puts(views2);
}
void test2() {
char views[2][N] = {"hey, C, I hate u.",
"hey, C, I love u."};
printf("交换前: \n");
puts(views[0]);
puts(views[1]);
swap_str(views[0], views[1]);
printf("交换后: \n");
puts(views[0]);
puts(views[1]);
}
void swap_str(char s1[N], char s2[N]) {
char tmp[N];
strcpy(tmp, s1);
strcpy(s1, s2);
strcpy(s2, tmp);
}
#include <stdio.h>
#define N 80
int count(char x[]);
int main(){
char words[N+1];
int n;
while(gets(words)!=NULL){
n=count(words);
printf("单词数:%d\n",n);
}
return 0;
}
int count(char x[]){
int i;
int word_flag=0;
int number=0;
for(i = 0; x[i] != '\0'; i++){
if(x[i]==' ')
word_flag=0;
else if(word_flag==0){
word_flag=1;
number++;
}
}
return number;
}
#include<stdio.h>
#define N 1000
int main(){
char line[N];
int word_len;
int max_len;
int end;//纪录最长单词结束位置
int i;
while(gets(line)!=NULL){
word_len=0;
max_len=0;
end=0;
i=0;
while(1){
while(line[i]==' '){
word_len=0;
i++;
}
while (line[i] != '\0' && line[i] != ' ') {
word_len++;
i++;
}
if(max_len<word_len){
max_len=word_len;
end=i;//end保存的是单词结束的下一个坐标位置
}
if(line[i]=='\0')
break;
}
printf("最长单词:");
for(i=end-max_len;i<end;++i)
printf("%c",line[i]);
printf("\n");
}
return 0;
}
#include<stdio.h>
#define N 100
void dec_to_n(int x,int n);
int main(){
int x;
printf("输入一个十进制整数:");
while(scanf("%d",&x)!=EOF){
dec_to_n(x,2);
dec_to_n(x,8);
dec_to_n(x,16);
printf("\n输入一个十进制整数:");
}
return 0;
}
void dec_to_n(int x,int n){
char map[17]={"0123456789ABCDEF"};
char ans[n];
int r;
int cnt=0,i;
do{
r=x%n;
ans[cnt++]=map[r];
x=x/n;
}
while(x!=0);
for(i=cnt-1;i>=0;--i)
printf("%c",ans[i]);
printf("\n");
}
#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 bubble_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);
bubble_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]);
}
// 输出整型数组x中n个元素
void output(int x[], int n) {
int i;
for (i = 0; i < n; ++i)
printf("%d ", x[i]);
printf("\n");
}
// 计算整型数组x中n个元素均值，并返回
double average(int x[], int n) {
double ave;
double sum = 0;
for (int cnt = 0; cnt < n; cnt++) {
sum += x[cnt];
}
ave = 1.0 * sum / n;
return ave;
}
#include <stdio.h>
#include <string.h>
int main()
{
char a[110];
while (scanf("%s", a) != EOF) {
int flag = 0;
for (int n = 0; n < strlen(a); n++) {
for (int s = n + 1; s < strlen(a); s++) {
if (a[n] == a[s]) {
flag = 1;
break;
}
}
if (flag == 1) {
break;
}
}
if (flag == 1) {
printf("YES\n\n");
}
else if (flag == 0) {
printf("NO\n\n");
}
}
return 0;
}
// 对整型数组x中的n个元素降序排序
void bubble_sort(int x[], int n) {
int i,j,t;
for(i=0;i<n-1;i++){
for(j=0;j<n-1-i;j++){
if(x[j]<x[j+1]){
t=x[j];
x[j]=x[j+1];
x[j+1]=t;
}
}
}
}
#include <stdio.h>
#include <string.h>
int main()
{
char a[110];
while (scanf("%s", a) != EOF) {
int flag = 0;
for (int n = 0; n < strlen(a); n++) {
for (int s = n + 1; s < strlen(a); s++) {
if (a[n] == a[s]) {
flag = 1;
break;
}
}
if (flag == 1) {
break;
}
}
if (flag == 1) {
printf("YES\n\n");
}
else if (flag == 0) {
printf("NO\n\n");
}
}
return 0;
}
#include <stdio.h>
#include <string.h>
#define N 100
#define M 4
void output(int x[][N], int n); // 函数声明
void rotate_to_right(int x[][N], int n); // 函数声明
int main() {
int t[][N] = { {21, 12, 13, 24},
{25, 16, 47, 38},
{29, 11, 32, 54},
{42, 21, 33, 10} };
printf("原始矩阵:\n");
output(t, M); // 函数调用
rotate_to_right(t, M); // 函数调用
printf("变换后矩阵:\n");
output(t, M); // 函数调用
return 0;
}
// 函数定义
// 功能: 输出一个n*n的矩阵x
void output(int x[][N], int n) {
int i, j;
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j)
printf("%4d", x[i][j]);
printf("\n");
}
}
void rotate_to_right(int x[][N], int n) {
int mid[M];
for (int j = 0; j < n; j++) {
mid[j] = x[j][M - 1];
}
for (int j = 0; j < n; j++) {
for (int i = n-1; i >= 1; i--) {
x[j][i] = x[j][i - 1];
}
}
for (int i = 0; i < n; i++) {
x[i][0] = mid[i];
}
}
标签：int,void,char,++,实验,printf,include From： https://www.cnblogs.com/yukinoshita-/p/17839694.html