Gap

input/code.cpp: In function 'll findGap(int, int)':
input/code.cpp:18:22: error: invalid conversion from 'll {aka long long int}' to 'long long int*' [-fpermissive]
   MinMax(a, b, mn, mx);
                      ^
In file included from input/code.cpp:2:0:
input/gap.h:29:6: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
 void MinMax(long long s, long long t, long long *mn, long long *mx) {
      ^~~~~~
input/code.cpp:18:22: error: invalid conversion from 'll {aka long long int}' to 'long long int*' [-fpermissive]
   MinMax(a, b, mn, mx);
                      ^
In file included from input/code.cpp:2:0:
input/gap.h:29:6: note:   initializing argument 4 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
 void MinMax(long long s, long long t, long long *mn, long long *mx) {
      ^~~~~~
input/code.cpp:30:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(v....

#include <iostream>
#include "gap.h"
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;


ll findGap(int t, int n) {
	if(t == 2) return 0;
	ll a = 0;
	ll b = 1e18;
	vector<ll> v;
	ll mn, mx; mn = a; mx = b;
	while(mn != mx) {
		MinMax(a, b, mn, mx);
		if(mn == mx) {
			if(mn == -1) break;
			v.push_back(mn);
		} else {
			v.push_back(mn);
			v.push_back(mx);
			a = mn + 1;
			b = mx - 1;
			if(a > b) break;
		}
	}
	if(v.size() != n) {
		throw exception();
	}

	sort(v.begin(), v.end());
	ll ma = 0;
	for(int i = 0; i < n-1; ++i) {
		ma = max(ma, v[i+1] - v[i]);
	}
	return ma;
}