Submission #812340

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdlib>//atof/atoi/atol/atoll/strtod/strtof/..., srand/rand, calloc/malloc, exit, qsort, abs
#include <iomanip>
#include <iostream>
#include <iterator>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define PRIME 1000000007

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pllll;
typedef pair<double, double> pdd;

int ipow(int base, int exp);
int left(int current, bool swap);
int right(int current, bool swap);

int main(void){
	int a, b, c, d, e, f, g, h;
	cin >> a >> b;
	cout << a-b << endl;
	return 0;
}

int ipow(int base, int exp)
{
    int result = 1;
    while (exp)
    {
        if (exp & 1)
            result *= base;
        exp >>= 1;
        base *= base;
    }

    return result;
}

int left(int current, bool swap = false){
	if(swap){
		return right(current, false);
	} else {
		return 2*current + 1;
	}
}

int right(int current, bool swap = false){
	if(swap){
		return left(current, false);
	} else {
		return 2*(current+1);
	}
}

Submission Info

Judge Result