- 博客(6)
- 收藏
- 关注
RSS订阅原创 n个数的最小公倍数
#include<iostream>usingnamespacestd;intmain(){inta, b;intr; //两数的最大值inti; //最小公倍数的值intc; //中间变量intn; //整数个数intk; //次数intm[100];cout <<"请输入整数个数n：";cin >>n;cout <<"请依次输入整数：";for(k = 0; k ...
2020-09-06 14:05:16
168
原创 对称矩阵
#include<iostream>usingnamespacestd;voidmain(){inti = 0, j = 0, m, n, a[50][50];cout <<"请输入矩阵阶数n:";cin >>n;if(n % 2 == 0){cout <<"请重新输入n:";return;}m = i - j; //m是对称轴的值for(i = 1; i <= n; i++)f...
2020-09-06 14:02:52
216
原创 2020-09-02
#include<iostream>using namespace std;int oujilide(int a, int b){ int r; int i; int c; if (a < b) { c = a; a = b; b = c; } r = a * b; if (a%b == 0) { i = a; } else { for (i...
2020-09-02 16:02:23
69
1
原创 2020-09-02
#include<iostream>using namespace std;int oujilide(int a, int b) //欧几里得算法/辗转相除法{ if (a < b) { int c = a; a = b; b = c; } int r = a % b; while (r != 0) { a = b; b = r; r = a % b; } return ...
2020-09-02 14:35:25
58
原创 二叉树的遍历
#include<iostream>#include<stack>#include<queue>using namespace std;typedef struct BinTree{ char data; struct BinTree *Lchild, *Rchild;};void CreateTree(BinTree *&T)//创建二叉树{ char ch; cin >> ch; if (c...
2020-06-20 20:12:40
109
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人