Submission #1757608

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)

int dy[] = { 0, 0, 1, -1 };
int dx[] = { 1, -1, 0, 0 };

ll A, B, C, D, E, F, G, H, I, J, K, L, M,
   N, O, P, Q, R, S, T, U, V, W, X, Y, Z;

void arc001b()
{
	cin >> A >> B;
	ll current = A;
	int cnt = 0;
	while (current != B) {
		ll diff = B - current;
		ll dir = 1;
		if (diff < 0) dir = -1;
		ll d1 = abs(B - (current + dir * 1));
		ll d5 = abs(B - (current + dir * 5));
		ll d10 = abs(B - (current + dir * 10));
		if (d10 <= min(d1, d5)) {
			current += dir * 10;
		}
		else if (d5 <= d1) {
			current += dir * 5;
		}
		else {
			current += dir * 1;
		}
		cnt++;
	}
	cout << cnt << endl;

	return;
}

int main()
{
	arc001b();

	return 0;
}

Submission Info

Judge Result