Problem p03789 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define re(i, a, b) for (int i = (a); i < (b); i++)
#define repd(i, a, b) for (int i = (a); i >= (b); i--)
#define run(v) for (int k = head[v]; k; k = e[k].ne)
#define v e[k].t
#define clr(a) memset(a, 0, sizeof(a));
#define il inline
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define mp make_pair
#define pb push_back
#define w1 first
#define w2 second
#define adm(a, b, c)                                                           \
  {                                                                            \
    a = a + b;                                                                 \
    if (a >= c)                                                                \
      a -= c;                                                                  \
    else if (a < 0)                                                            \
      a += c;                                                                  \
  }
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> pa;
const int N = 1e6 + 5, M = 1e7 + 5, INF = 1e9, mod = 1e9 + 7;
const ll linf = 1e18;
const double eps = 1e-8, pi = acos(-1);
il int gmin(int &a, int b) {
  if (a > b)
    a = b;
}
il ll gmin(ll &a, ll b) {
  if (a > b)
    a = b;
}
il int gmax(int &a, int b) {
  if (a < b)
    a = b;
}
il ll gmax(ll &a, ll b) {
  if (a < b)
    a = b;
}
il void read(ll &x) {
  ll f = 1, t = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-')
      f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    t = t * 10 + ch - '0';
    ch = getchar();
  }
  x = t * f;
}
il ll read(ll &x, ll &y) {
  read(x);
  read(y);
}
il void read(int &x) {
  int f = 1, t = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-')
      f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    t = t * 10 + ch - '0';
    ch = getchar();
  }
  x = t * f;
}
il int read(int &x, int &y) {
  read(x);
  read(y);
}
il void read(int &a, int &b, int &c) {
  read(a);
  read(b);
  read(c);
}
il void read(ll &a, ll &b, ll &c) {
  read(a);
  read(b);
  read(c);
}
il int read() {
  int x;
  read(x);
  return x;
}
il ll qpow(ll a, ll b, ll p) {
  ll ret = 1;
  for (; b; b >>= 1, a = a * a % p)
    if (b & 1)
      ret = ret * a % p;
  return ret;
}
il ll qpow(ll a, ll b) {
  ll ret = 1;
  for (; b; b >>= 1, a = a * a % mod)
    if (b & 1)
      ret = ret * a % mod;
  return ret;
}
il ll qmul(ll a, ll b, ll p) {
  ll ret = 0;
  for (; b; b >>= 1, a = (a << 1) % p)
    if (b & 1)
      adm(ret, a, p);
  return ret;
}
il ll qmul(ll a, ll b) {
  ll ret = 0;
  for (; b; b >>= 1, a = (a << 1) % mod)
    if (b & 1)
      adm(ret, a, mod);
  return ret;
}
il void judge() {
  freopen("data.in", "r", stdin);
  freopen("data.out", "w", stdout);
}
il void gen() { freopen("data.in", "w", stdout); }
char s[N];
int a[N], c, n, qaq;
void add() {
  qaq -= a[1];
  a[1]++;
  qaq += a[1];
  rep(i, 1, n) if (a[i] >= 10) {
    qaq -= a[i + 1] + a[i];
    a[i + 1]++, a[i] -= 10;
    qaq += a[i + 1] + a[i];
  }
  else break;
  if (a[n + 1])
    n++;
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  rep(i, 1, n) a[i] = s[n - i + 1] - '0';
  int d = 0;
  rep(i, 1, n) a[i] *= 9;
  rep(i, 1, n) a[i + 1] += a[i] / 10, a[i] %= 10;
  if (a[n + 1])
    n++;
  qaq = 0;
  rep(i, 1, n) qaq += a[i];
  rep(k, 1, 1e9) {
    add();
    if (qaq == k)
      return printf("%d", (k + 8) / 9), 0;
  }
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define re(i, a, b) for (int i = (a); i < (b); i++)
#define repd(i, a, b) for (int i = (a); i >= (b); i--)
#define run(v) for (int k = head[v]; k; k = e[k].ne)
#define v e[k].t
#define clr(a) memset(a, 0, sizeof(a));
#define il inline
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define mp make_pair
#define pb push_back
#define w1 first
#define w2 second
#define adm(a, b, c)                                                           \
  {                                                                            \
    a = a + b;                                                                 \
    if (a >= c)                                                                \
      a -= c;                                                                  \
    else if (a < 0)                                                            \
      a += c;                                                                  \
  }
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> pa;
const int N = 1e6 + 5, M = 1e7 + 5, INF = 1e9, mod = 1e9 + 7;
const ll linf = 1e18;
const double eps = 1e-8, pi = acos(-1);
il int gmin(int &a, int b) {
  if (a > b)
    a = b;
}
il ll gmin(ll &a, ll b) {
  if (a > b)
    a = b;
}
il int gmax(int &a, int b) {
  if (a < b)
    a = b;
}
il ll gmax(ll &a, ll b) {
  if (a < b)
    a = b;
}
il void read(ll &x) {
  ll f = 1, t = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-')
      f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    t = t * 10 + ch - '0';
    ch = getchar();
  }
  x = t * f;
}
il ll read(ll &x, ll &y) {
  read(x);
  read(y);
}
il void read(int &x) {
  int f = 1, t = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-')
      f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    t = t * 10 + ch - '0';
    ch = getchar();
  }
  x = t * f;
}
il int read(int &x, int &y) {
  read(x);
  read(y);
}
il void read(int &a, int &b, int &c) {
  read(a);
  read(b);
  read(c);
}
il void read(ll &a, ll &b, ll &c) {
  read(a);
  read(b);
  read(c);
}
il int read() {
  int x;
  read(x);
  return x;
}
il ll qpow(ll a, ll b, ll p) {
  ll ret = 1;
  for (; b; b >>= 1, a = a * a % p)
    if (b & 1)
      ret = ret * a % p;
  return ret;
}
il ll qpow(ll a, ll b) {
  ll ret = 1;
  for (; b; b >>= 1, a = a * a % mod)
    if (b & 1)
      ret = ret * a % mod;
  return ret;
}
il ll qmul(ll a, ll b, ll p) {
  ll ret = 0;
  for (; b; b >>= 1, a = (a << 1) % p)
    if (b & 1)
      adm(ret, a, p);
  return ret;
}
il ll qmul(ll a, ll b) {
  ll ret = 0;
  for (; b; b >>= 1, a = (a << 1) % mod)
    if (b & 1)
      adm(ret, a, mod);
  return ret;
}
il void judge() {
  freopen("data.in", "r", stdin);
  freopen("data.out", "w", stdout);
}
il void gen() { freopen("data.in", "w", stdout); }
char s[N];
int a[N], c, n, qaq;
void add() {
  qaq -= a[1];
  a[1]++;
  qaq += a[1];
  rep(i, 1, n) if (a[i] >= 10) {
    qaq -= a[i + 1] + a[i];
    a[i + 1]++, a[i] -= 10;
    qaq += a[i + 1] + a[i];
  }
  else break;
  if (a[n + 1])
    n++;
}
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  rep(i, 1, n) a[i] = s[n - i + 1] - '0';
  int d = 0;
  rep(i, 1, n) a[i] *= 9;
  rep(i, 1, n) a[i + 1] += a[i] / 10, a[i] %= 10;
  if (a[n + 1])
    n++;
  qaq = 0;
  rep(i, 1, n) qaq += a[i];
  rep(k, 1, 1e9) {
    add();
    if (qaq <= k)
      return printf("%d", (k + 8) / 9), 0;
  }
}