viliml

#include <bits/stdc++.h>

using namespace std;

#define double long long

double gcd(double a, double b)
{
	double tmp;
	while (b)

viliml

#include <bits/stdc++.h>

using namespace std;

using llint = long long;

int divisors[37];

map<int, pair<llint, llint>> rems;

viliml

#include <bits/stdc++.h>

using namespace std;

map<string, int> num1[4], num2[6], num3[4];

string get1(string str, int type)
{
	str.erase(type, 1);
	return str;

viliml

#include <bits/stdc++.h>

using namespace std;

const int MOD = 10007;

int fact[MOD], inv[MOD];

int r[10], c[10];

viliml

#include <bits/stdc++.h>

using namespace std;

vector<int> sols(1, 1), curr;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

viliml

#include <bits/stdc++.h>

using namespace std;

typedef long long llint;

int A, B, L;

llint f(int dy)
{

viliml

#include <bits/stdc++.h>

using Ldouble = long double;

using namespace std;

stack<pair<int, Ldouble>> balloons;

int main()
{

viliml

#include <bits/stdc++.h>

using namespace std;

multiset<pair<int, int>> rooms;
multiset<pair<int, int>, greater<pair<int, int>>> offers;
vector<int> profits;

int main()
{

viliml

#include <bits/stdc++.h>

using namespace std;

#define llint long long

const int MAXN = 2000100;
const llint A = 29;
const llint B = 31;
const llint MOD1 = 1000000007;

viliml

#include "gondola.h"

#include <bits/stdc++.h>

using namespace std;

void fix(int n, int inputSeq[])
{
	auto mn = min_element(inputSeq, inputSeq + n);