C语言小练习

1.有1、2、3、4个数字,能组成多少个互不相同且无重复数字的三位数?都是多少?(使用数组)

#include<stdio.h>
int main(void) {
	int a[] = {12, 52, 64, 33, 10, 32, 53, 88, 2, 90};
	int num = 0, i, j = 0;
	scanf("%d", &num);
	for (i = 0; i < 10; i++) {
		if (i == 9) {
			a[i] = 0;
			break;
		}
		if (i >= num) {
			j = i + 1;
			a[i] = a[j];
		}
	}
	
	for (i = 0; i < 10; i++) {
		printf("%d\t", a[i]);
	}
}

2.有一个长度为10的数组{12,52,64,33,10,32,53,88,2,90},根据下标将其中某个元素值改为0,将该元素放在数组的最后,并打印数组的每个元素。

#include<stdio.h>
int main(void) {
	int a[] = {12, 52, 64, 33, 10, 32, 53, 88, 2, 90};
	int num = 0, i, j = 0;
	scanf("%d", &num);
	for (i = 0; i < 10; i++) {
		if (i == 9) {
			a[i] = 0;
			break;
		}
		if (i >= num) {
			j = i + 1;
			a[i] = a[j];
		}
	}
	//遍历 
	for (i = 0; i < 10; i++) {
		printf("%d\t", a[i]);
	}
}

3.递归函数

#include<stdio.h>
void judge();
int main(void) {
	judge();
	printf("111");
}

void judge() {
	int d = 0;
	printf("请重新输入:\n");
	scanf("%d", &d);
	if (d != 0) {
		judge();
	}
	printf("成功了,因为打的是:%d\n", d);
}

4.函数返回类型             

#include<stdio.h>
int func1();
int func2();
int func3();

int main(void) {
	int i = 0;
	printf("%d\n", func1());
	printf("%d\n", func2());
	printf("%d", i = i + 1);
}

int func1() {
	int i = 1;
	return i += 1;
}

int func2() {
	int i = 1;
	return i + 1;
}

int func3() {
	int i = 1;
	return i = i + 1;
}
5.作用域

#include<stdio.h>
int func(int a);
int y = 0;

int main(void) {
	int x = 0;
	y = func(x);
	//printf("%d", b);
	//return -1;
	printf("1111~~~\n");
	printf("%d", y);
}

int func(int b) {
	printf("%d", b);
	//printf("%d", x);
	
	return 1;
	printf("hahha\n");
}
6.输入年月日,判断这天是该年份的第几天。

#include<stdio.h>
int main(void) {
	int time = 0;
	int day = 0;
	int month = 0;
	int year = 0;
	printf("请输入你所要查询的年月日:\n");
	scanf("%d %d %d", &year, &month, &day);
	switch(month) {
  		case 1: time = day;
				break;
        case 2: time = 31 + day;
				break;
        case 3: time = 31 + 28 + day;
				break;
        case 4: time = 31 + 28 + 31 + day;
				break;
        case 5: time = 31 + 28 + 31 + 30 + day;
				break;
        case 6: time = 31 + 28 + 31 + 30 + 31 + day;
				break;
        case 7: time = 31 + 28 + 31 + 30 + 31 + 30 + day;
				break;
        case 8: time = 31 + 28 + 31 + 30 + 31 + 30 + 31 + day;
				break;
        case 9: time = 31 + 28 + 31 + 30 + 31 + 30 + 31 + 31 + day;
				break;
        case 10: time = 31 + 28 + 31 + 30 + 31 + 30 + 31 + 31 + 30 + day;
				 break;
        case 11: time = 31 + 28 + 31 + 30 + 31 + 30 + 31 + 31 + 30 + 31 + day;
				 break;
        case 12: time = 31 + 28 + 31 + 30 + 31 + 30 + 31 + 31 + 30 + 31 + 30 + day;
				 break;
  		default: break;
	}
	if(((year % 4 == 0 && year % 100 != 0) || (year % 400) == 0 ) ) {
			time=time+1;
	} 
 	printf("此时是该年的第 %d 天\n", time);
}
7、输入一个正整数将其转化为二进制并输出。(使用数组存储二进制的每一位)
#include<stdio.h>
int main(void) {
	int num = 0, i, j, a[100];
	scanf("%d", &num);
	for (i = 0; 1; i++) {
		if (num == 1) {
			a[i] = 1;
			break;
		}
		a[i] = num % 2;
		num /= 2;
	}
	
	for (j = i; j > -1; j--) {
		printf("%d", a[j]);
	}
}
8、水仙花数问题

#include<stdio.h>
int main(void) {
	int i, a, b, c;
	for (i = 100; i < 1000; i++) {
		a = i / 100;
		b = i / 10 % 10;            //i / 10 - a * 10
		c = i % 10;
		if (i == a * a * a + b * b * b + c * c * c) {
			printf("%d\n", i);
		}
	}
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值