first commit

Test.cpp

@@ -0,0 +1,140 @@
+//#include<stdio.h>
+//
+//void paixu(int n, int a[]) { //n为数组的元素个数
+//	for (int i = 0; i < n - 1; i++) {
+//		//TODO
+//		for (int j = i + 1; j < n; j++) {
+//			//TODO
+//			if (a[i] > a[j]) {
+//				int t = a[i];
+//				a[i] = a[j];
+//				a[j] = t;
+//			}
+//		}
+//
+//	}
+//	for (int i = 0; i < n; i++) {
+//		//TODO
+//		printf("%d", a[i]);
+//	}
+//}
+
+//int main() {
+//	int a[5] = {8, 6, 5, 4, 1};
+//	paixu(5, a);
+//}
+
+//#include<stdio.h>
+//int main() {
+//	int min, div, m, n, i = 2;
+//	printf("请输入两个数:\n");
+//	scanf("%d %d", &m, &n);
+//	if (m > n)
+//		min = n;
+//	else
+//		min = m;
+//	for (i; i <= min; i++) {
+//		if (m % i == 0 && n % i == 0) {
+//			div = i;
+//		}
+//	}
+//	printf("最大公约数为%d\n", div);
+//	return 0;
+//}
+//
+//#include <stdio.h>
+//
+//int main() {
+//	int n1, n2, i, gcd;
+//
+//	printf("输入两个正整数");
+//	scanf("%d %d", &n1, &n2);
+//
+//	for (i = 1; i <= n1 && i <= n2; ++i) {
+//		// 判断 i 是否为最大公约数
+//		if (n1 % i == 0 && n2 % i == 0)
+//			gcd = i;
+//	}
+//
+//	printf("%d 和 %d 的最大公约数是 %d", n1, n2, gcd);
+//
+//	return 0;
+//}
+
+
+//#include <stdio.h>
+//int main()
+//{
+//	int a[11]={1,2,3,4,5,7,8,9,10,11};
+//	int i,t,m;
+//	printf("输入一个数:\n");
+//	scanf("%d",&m);
+//	for(i=0;i<11;i++)
+//	{
+//		if(m<a[i])
+//		{
+//			t=m;m=a[i];a[i]=t;
+//		}
+//		else if(m>a[9])
+//			a[10]=m;
+//	}
+//	printf("排序后:\n");
+//	for(i=0;i<11;i++)
+//		printf("%d ",a[i]);
+//	return 0;
+//}
+
+
+//#include<stdio.h>
+//#include<math.h>
+//
+//int main() {
+//	double r, s ;
+//	printf("半径:");
+//	scanf("%lf", &r);
+//	s = (3 * 3.1415926 * r * r) / 4;
+//	printf("s=%lf", s);
+//}
+
+//#include <stdio.h>
+//#include <math.h>
+//main() {
+//	int n, i, k;
+//	for (n = 100; n > 0; n--) {
+//		k = sqrt(n);
+//		for (i = 2; i <= k; i++)
+//			if (n % i == 0)
+//				break;
+//		if (i > k) {
+//			printf("%d\n", n);
+//			break;
+//		}
+//	}
+//}
+
+#include <stdio.h>
+
+int gcd(int m, int n) {
+	int div, i, min;
+	if (m < n) {
+		min = m;
+	} else {
+		min = n;
+	}
+	for (i = 2; i <= min; i++) {
+		if (m % i == 0 && n % i == 0) {
+			div = i;
+		}
+	}
+	return div;
+}
+
+int main() {
+	int m, n;
+	printf("请输入两个整数：\n");
+	scanf("%d %d", &m, &n);
+	int result = gcd(m, n);
+	printf("%d和%d的最大公约数是%d\n", m, n, result);
+	return 0;
+}
+