Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int arr[100];
- int recursion(int n1,int n2)
- {
- if(n2 == 0)
- return n1;
- return recursion(n2,n1%n2);
- }
- int main()
- {
- int i,n,m,maximum,k,j;
- string str;
- cin>>n;
- getchar();
- while(n--)
- {
- getline(cin, str);
- stringstream ss(str);
- m=0;
- while(ss>>arr[m])
- {
- m++;
- }
- maximum= -1;
- for(i=0; i<m; i++)
- {
- for(j = i+1; j<m ; j++)
- {
- k= recursion(arr[i],arr[j]);
- if(k>maximum)
- maximum = k;
- }
- }
- cout<<maximum<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement