forked from krishna14kant/Data-Structures-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
1593D1.cpp
45 lines (42 loc) · 980 Bytes
/
1593D1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
//🎃🎃🎃😎😎😁🤓☣☣☣☣☣dark_coder☣☣☣☣☣😎😎😁🤓🎃🎃🎃
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define li long long int
#define pi pair<int,int>
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int main()
{
IOS
int n,mn=INT_MAX;
cin>>n;
vector<unsigned int>v;
for (int i = 0; i < n; i++)
{
li temp;
cin>>temp;
if(li<0)
if(mn>temp)mn=temp;
v.push_back(temp);
}for (int i = 0; i < n; i++)
{
if(v[i]>mn)v[i]-=mn;
}
// result = arr[0]
// For i = 1 to n-1
// result = GCD(result, arr[i])
int result=v[0];
for (int i = 1; i < n; i++)
{
/* code */
result=gcd(result,v[i]);
}
cout<<result<<endl;
return 0;
}