Submission #1241290

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>

using namespace std;

typedef long long int lld;

const lld mod = 1e9+7;
const lld INF = 1e9;
//const lld MAXN = 1e9;

int main()
{
	int a,b;
	cin >> a >> b;

	int sol = 0;

	if (a < b)
	{
		while(abs(a-b) >= 10)
		{
			sol++;
			a += 10;
			//cout << " a = " << a << endl;
		}
	}else
	{
		while(abs(a-b) >= 10)
		{
			sol++;
			a -= 10;
			//cout << " a = " << a << endl;
		}
	}

	int x = abs(a-b);

	if (x == 1 || x == 5)
	{
		sol++;
	}
	if (x == 2 || x == 4 || x == 6 || x == 9)
	{
		sol += 2;
	}
	if (x == 3 || x == 7 || x == 8)
	{
		sol += 3;
	}

	cout << sol << endl;

	return 0;
}

Submission Info

Judge Result