【码蹄集新手村 600 题】求多个数（大于2个）的最大公约数

最新推荐文章于 2024-06-01 18:28:10 发布

Sandm *

最新推荐文章于 2024-06-01 18:28:10 发布

阅读量127

点赞数

分类专栏：码蹄集新手村 600 题目文章标签： c++ 算法蓝桥杯码蹄集新手村600题

本文链接：https://blog.csdn.net/m0_64075307/article/details/126440151

版权

码蹄集新手村 600 题目专栏收录该内容

76 篇文章 16 订阅

订阅专栏

题目链接：

码蹄集 (matiji.net)

解题思路：

https://blog.csdn.net/m0_64075307/article/details/122816148?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522166097886616782425115801%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=166097886616782425115801&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_ecpm_v1~rank_v31_ecpm-1-122816148-null-null.nonecase&utm_term=%E8%BE%97%E8%BD%AC%E7%9B%B8%E9%99%A4%E6%B3%95&spm=1018.2226.3001.4450https://blog.csdn.net/m0_64075307/article/details/122816148?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522166097886616782425115801%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=166097886616782425115801&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~first_rank_ecpm_v1~rank_v31_ecpm-1-122816148-null-null.nonecase&utm_term=%E8%BE%97%E8%BD%AC%E7%9B%B8%E9%99%A4%E6%B3%95&spm=1018.2226.3001.4450

参考代码：

#include<bits/stdc++.h> 

using namespace std;

int  max_yue (int data1,int data2)
{
   // int data1 = 0, data2 = 0;
	int m = 0;     //该变量是中间变量，不能放在while函数的内部
	//scanf_s("%d %d", &data1, &data2);
 
	while ((m = data1 % data2) != 0)
	{
		data1 = data2;
		data2 = m;
	}
	//printf("最大公约数为%d\n", data2);
	return data2;
}

int main( )
{
    int length = 0;
    cin >> length;
    int arr[100] = {0};
    for(int i = 1;i <= length;i++)
    {
        cin >> arr[i];
    }

    int ans = max_yue(arr[1],arr[2]);

    for(int j = 3;j <= length;j++)
    {
        ans = max_yue(ans,arr[j]);
    }

    cout << ans;

    return 0;
}