![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C语言实例
潇潇挽歌醉
我需要用谦逊去平衡我的勇敢
展开
-
C语言递归求阶乘
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<Windows.h>#include<math.h>long factorial(int n);int main(){ printf("%ld\n", factorial(10)); return 0;}long factorial(int n) { if (n == 0 || n == 1) { return 1; } el原创 2022-04-27 14:04:08 · 606 阅读 · 0 评论 -
C语言插入排序
第一版#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>#define N 10void quick_sort(int arr[], int start, int end);int partition(int arr[], int low, int high);void select_sort(int arr[],int n);void in原创 2022-04-22 15:28:30 · 1730 阅读 · 0 评论 -
C语言选择排序
第一版#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>#define N 10void quick_sort(int arr[], int start, int end);int partition(int arr[], int low, int high);void select_sort(int arr[],int n);int mai原创 2022-04-22 10:22:42 · 1062 阅读 · 0 评论 -
C语言快速排序问题
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>#define N 10void quick_sort(int arr[], int start, int end);int partition(int arr[], int low, int high);int main() { int i = 0; int arr[N] = {1,33,5原创 2022-04-21 16:17:13 · 831 阅读 · 0 评论 -
C语言爱因斯坦问题
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-20 11:16:32 · 175 阅读 · 0 评论 -
C语言求质因数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-20 10:36:25 · 949 阅读 · 0 评论 -
C语言求平方根
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-19 17:52:41 · 7731 阅读 · 0 评论 -
C语言求最大公约数最小公倍数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-19 17:02:25 · 102 阅读 · 0 评论 -
C语言求勾股数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-19 15:39:06 · 668 阅读 · 0 评论 -
C语言求回文数(非数组)
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-19 14:06:51 · 172 阅读 · 0 评论 -
C语言求水仙花数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-19 10:18:40 · 64 阅读 · 0 评论 -
C语言判断是否为自守数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<math.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void pri原创 2022-04-18 17:50:41 · 1896 阅读 · 0 评论 -
c语言求亲密数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void primeJudge();void perfect原创 2022-04-18 16:54:14 · 1170 阅读 · 0 评论 -
c语言求完数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void primeJudge();void perfect原创 2022-04-18 13:53:03 · 450 阅读 · 0 评论 -
判断一个数是否为素数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();void primeJudge();int main() {原创 2022-04-18 11:21:28 · 213 阅读 · 0 评论 -
C语言求π的值
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);void purchaseChicken();float calculatePi();int main() { float pi = cal原创 2022-04-18 10:52:16 · 1183 阅读 · 0 评论 -
百钱买百鸡问题(C语言版)
我国古代数学家张丘建在《算经》一书中曾提出过著名的“百钱买百鸡”问题,该问题叙述如下:鸡翁一,值钱五;鸡母一,值钱三;鸡雏三,值钱一;百钱买百鸡,则翁、母、雏各几何?#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x,原创 2022-04-15 17:08:02 · 4952 阅读 · 1 评论 -
给定x*y的表格,画出最大的菱形
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);void printDiamond(int x, int y);int main() { printf("请输入表格尺寸:\n"); int x, y; scanf("%d,%d", &x,&y原创 2022-04-15 16:01:26 · 62 阅读 · 0 评论 -
计算由a,b,c组成一个数有多少种组合
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>void check_count();void combineNum(int x, int y, int z,int num);int main() { combineNum(5,2,1,100); return 0;}void combineNum(int x,int y,int z,int num) { int i =原创 2022-04-15 10:43:03 · 316 阅读 · 0 评论 -
输入一个字符串,统计英文字母、空格、数字和其它字符的个数
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int main() { int count_digit=0, count_letter=0, count_space=0, count_other=0; char c; printf("请输入一串字符!\n"); while ((c = getchar())!='\n') { if (c>='a' && c&原创 2022-04-13 17:20:54 · 1108 阅读 · 0 评论 -
求某一年的某一月有多少天
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>int main() {int x=0, y=0,day=0;printf(“请输入年份:\n”);scanf(“%d”,&y);printf(“您输入的年份是:%d年\n”, y);printf(“请输入月份:\n”);scanf(“%d”, &x);printf(“您输入的月份是:%d月\n”, x);switc原创 2022-04-13 16:22:00 · 196 阅读 · 0 评论