백준 2981 c++ 풀이

알고리즘 분류: 정수론, 유클리드 호제법

코드:

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int GCD(int a, int b);
int main(){

    int a, b, res_count = 1;
    scanf("%d",&a);
    vector<int> v(a);
    vector<int> res;
    for(int i = 0; i<a; i++){
        scanf("%d",&v.at(i));
    }
    sort(v.begin(), v.end());
    b = v.at(0);
    for(int i =0; i<a; i++){
        v.at(i) = v.at(i) - b;
    }
    int gcd = v.at(1);
    for(int i = 1; i< a; i++){
        gcd = GCD(gcd, v.at(i));
    }
    for(int i =2; i<=gcd/2; i++){
        if(gcd%i==0){
            res.push_back(i);
            res_count++;
        }
    }
    res.push_back(gcd);
    for(int i = 0; i<res_count; i++){
        cout<<res.at(i)<<endl;
    }
    return 0;
}
int GCD(int a, int b){
    int r = a%b;
    if(r==0) return b;
    else return GCD(b, r);
}