Submission #1241280

---

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;

	while(a != b)
	{
		if (a > b)
		{
			int x[3] = {abs(b-(a-1)),abs(b-(a-5)),abs(b-(a-10))};
			if (x[0] < min(x[1],x[2]) )
			{
				sol++;
				a -= 1;
			}else if (x[1] < min(x[0],x[2]) )
			{
				sol++;
				a -= 5;
			}else if (x[2] < min(x[0],x[1]) )
			{
				sol++;
				a -=10;
			}
		}else  //  a < b
		{
			int x[3] = {abs(b-(a+1)),abs(b-(a+5)),abs(b-(a+10))};
			if (x[0] < min(x[1],x[2]) )
			{
				sol++;
				a += 1;
			}else if (x[1] < min(x[0],x[2]) )
			{
				sol++;
				a += 5;
			}else if (x[2] < min(x[0],x[1]) )
			{
				sol++;
				a +=10;
			}
		}
	}

	cout << sol << endl;

	return 0;
}

Submission Info

Judge Result