Submission #1180527

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#include <algorithm>
#include <set>
#include <deque>
#include <utility>
#include <chrono>
#include <sstream>
#include <iomanip>
#define INF 1 << 30
#define MOD 1000000007;
#define pi 3.14159265358979
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++)
#define D(x) cout << x << endl
#define d(x) cout << x
#define all(x) (x).begin(), (x).end()
#define pub(x) push_back(x)
#define pob() pop_back()
#define puf(x) push_front(x)
#define pof() pop_front()
#define mp(x, y) make_pair((x), (y))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; }
static const int dx[] = {0, 0, 1, -1};
static const int dy[] = {-1, 1, 0, 0};

int main() { 
  int a, b;
  cin >> a >> b;
  if (b < a) {
    swap(a, b);
  }
  int ans = 0;
  while (b - a >= 10) {
    a += 10;
    ans++;
  }
  if (b - a == 9) {
    ans += 2;
  }
  if (b - a == 8) {
    ans += 3;
  }
  if (b - a == 7) {
    ans += 3;
  }
  if (b - a == 6) {
    ans += 2;
  }
  if (b - a == 5) {
    ans += 1;
  }
  if (b - a == 4) {
    ans += 2;
  }
  if (b - a == 3) {
    ans += 3;
  }
  if (b - a == 2) {
    ans += 2;
  }
  if (b - a == 1) {
    ans += 1;
  }
  D(ans);
  return 0;
}

Submission Info

Judge Result