Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <bitset>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <iterator>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 110
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- vector<int> v,v1;
- bool cumple(int aux){
- if (aux < 1 || aux > 1000000000) return false;
- for(int i=1;i<v.size();i++){
- if (v[i] + v1[i] == aux || v[i] - v1[i] == aux) continue;
- else return false;
- }
- return true; //cumplio todo
- }
- int main() {
- int t,aux,n;
- scanf("%d",&t);
- while(t--){
- scanf("%d",&n);
- for(int i=0;i<n;i++){
- scanf("%d",&aux);
- v.push_back(aux);
- }
- //for(int i=0;i<n;i++) cout<<v[i]<<endl;
- scanf("%d",&n);
- for(int i=0;i<n;i++){
- scanf("%d",&aux);
- v1.push_back(aux);
- }
- //for(int i=0;i<n;i++) cout<<v1[i]<<endl;
- int opt1=v[0]-v1[0];int opt2=v[0]+v1[0];
- //cout<<opt1<<opt2<<endl;
- if(cumple(opt1) && cumple(opt2)){
- printf("-1\n");/*puede ser cualquiera*/
- }else if(cumple(opt1)){
- printf("%d\n",opt1);
- }else if(cumple(opt2)){
- printf("%d\n",opt2);
- }else{
- printf("-2\n");
- }
- v.clear();v1.clear();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement