Submission #110598

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define INF 1<<29
#define EPS 1e-9
#define mp make_pair
#define pb push_back
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define CLR(a) memset((a), 0 , sizeof(a))
//#define sum(x)   
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const int dr[] = { 1, 0, -1, 0 };
const int dc[] = { 0, 1,  0, -1 };

int main()
{
	int h1, h2;
	cin >> h1 >> h2;
	cout << h1-h2 << endl;

	return 0;
}

Submission Info

Judge Result