prithivMLmods/Coder-Stat huggingface dataset:
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

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

// #define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
using pii = pair<int, int>;
template <typename T> using prior = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO()                                                               \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0)
#define RANDOM()                                                               \
  random_device __rd;                                                          \
  mt19937 __gen = mt19937(__rd());                                             \
  uniform_int_distribution<int> __dis(0, 1);                                   \
  auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

int32_t main() {
  fastIO();

  int x, m = 100, ans = 0;
  cin >> x;

  while (m < x and ++ans)
    m += m / 100;

  cout << ans << "\n";

  return 0;
}

Fixed submission:
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

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

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
using pii = pair<int, int>;
template <typename T> using prior = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO()                                                               \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0)
#define RANDOM()                                                               \
  random_device __rd;                                                          \
  mt19937 __gen = mt19937(__rd());                                             \
  uniform_int_distribution<int> __dis(0, 1);                                   \
  auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

int32_t main() {
  fastIO();

  int x, m = 100, ans = 0;
  cin >> x;

  while (m < x and ++ans)
    m += m / 100;

  cout << ans << "\n";

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n;
  cin >> n;
  int count = 0;
  long long int sum = 100;
  while (sum < n) {
    sum *= sum * 0.01;
    count++;
  }
  cout << count << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n;
  cin >> n;
  int count = 0;
  long long int sum = 100;
  while (sum < n) {
    sum += sum / 100;
    count++;
  }
  cout << count << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  int X, N, temp = 100;
  cin >> X;
  for (N = 0; temp < X; N++) {
    temp += temp * 0.01;
  }

  cout << N << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long int X, N, temp = 100;
  cin >> X;
  for (N = 0; temp < X; N++) {
    temp += temp * 0.01;
  }

  cout << N << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
  ll X, yen;
  cin >> X;
  ll year = 0;
  yen = 100;
  while (yen < X) {
    yen = ll(101 * yen);
    yen /= 100;
    year++;
  }
  cout << year << endl;
  return 0;
}

Fixed submission:
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
  ll X, yen;
  cin >> X;
  ll year = 0;
  yen = 100;
  while (yen / X < 1) {
    yen += yen / 100;
    year++;
  }
  cout << year << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);

int main() {

  ll x;
  cin >> x;

  ll a = 100;

  ll i = 0;
  while (a < x) {
    i++;
    a = a * 101 / 100;
  }

  cout << i << endl;

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);

int main() {

  ll x;
  cin >> x;

  ll a = 100;

  ll i = 0;
  while (a < x) {
    i++;
    a += a / 100;
  }

  cout << i << endl;

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {

  long long X;
  cin >> X;
  unsigned long long now = 100, ctr = 0;
  while (now < X) {
    now = now * 101 / 100;
    ctr++;
  }
  cout << ctr << endl;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {

  long long X;
  cin >> X;
  unsigned long long now = 100, ctr = 0;
  while (now < X) {
    now += now / 100;
    ctr++;
  }
  cout << ctr << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  int X, year = 0;
  int money = 100;

  cin >> X;
  for (int i = 0; money < X; i++) {
    money += money / 100;
    year++;
  }
  cout << year << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int year = 0;
  long long money = 100;
  long long X;
  cin >> X;
  for (int i = 0; money < X; i++) {
    money += money / 100;
    year++;
  }
  cout << year << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long X;
  cin >> X;

  int money = 100;
  int year = 0;

  while (money < X) {
    money = money + (money / 100);
    year++;
  }

  cout << year << endl;

  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long X;
  cin >> X;

  long long money = 100;
  long long year = 0;

  while (money < X) {
    money = money + (money / 100);
    year++;
  }

  cout << year << endl;

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long X;
  cin >> X;
  int Y = 100;
  int cou = 0;
  while (Y < X) {
    Y += Y / 100;
    cou++;
  }
  cout << cou << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long X;
  cin >> X;
  long long Y = 100;
  int cou = 0;
  while (Y < X) {
    Y += Y / 100;
    cou++;
  }
  cout << cou << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

int main() {
  int i = 0;
  int X;
  int N = 100;
  cin >> X;

  while (N < X) {
    N = N * 1.01;
    i++;
  }

  cout << i << endl;
}


Fixed submission:
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

int main() {
  long long i = 0;
  long long X;
  long long N = 100;
  cin >> X;

  while (N < X) {
    N = N * 1.01;
    i++;
  }

  cout << i << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>

using namespace std;
#define ll long long int

int main() {
  ll x;
  cin >> x;
  int cnt = 0;
  int amt = 100;
  while (1) {
    amt = amt + amt / 100;
    cnt++;
    if (amt >= x)
      break;
  }
  cout << cnt << endl;
}

Fixed submission:
#include <bits/stdc++.h>

using namespace std;
#define ll long long int

int main() {
  ll x;
  cin >> x;
  int cnt = 0;
  ll amt = 100;
  while (1) {
    amt = amt + amt / 100;
    cnt++;
    if (amt >= x)
      break;
  }
  cout << cnt << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long c = 100;
  long long x;
  cin >> x;

  long long count = 0;

  for (long long i = 0; i < 1000000000000000000; i++) {
    count++;
    c /= c / 100;
    if (c >= x)
      break;
  }
  cout << count << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long c = 100;
  long long x;
  cin >> x;

  long long count = 0;

  for (long long i = 0; i < 1000000000000000000; i++) {
    count++;
    c += c / 100;
    if (c >= x)
      break;
  }
  cout << count << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#include <vector>3
using namespace std;
void init() {
  cin.tie(0);
  cin.sync_with_stdio(0);
}

int main() {
  init();
  unsigned long long k, a = 100, b = 0;
  cin >> k;
  while (true) {
    a = a * .01 + a;
    b++;
    if (a == k) {
      break;
    }
  }
  cout << b;
}


Fixed submission:
#include <bits/stdc++.h>
#include <vector>3
using namespace std;
void init() {
  cin.tie(0);
  cin.sync_with_stdio(0);
}

int main() {
  init();
  unsigned long long k, a = 100, b = 0;
  cin >> k;
  while (a < k) {
    a = a * .01 + a;
    b++;
    if (a == k) {
      break;
    }
  }
  cout << b;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long x;
  cin >> x;

  auto y = 100LL;
  auto year = 0;
  while (y < x) {
    y = (y * 101) / 100;
    ++year;
  }

  cout << year << endl;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long x;
  cin >> x;

  auto y = 100LL;
  auto year = 0;
  while (y < x) {
    y += (y / 100);
    ++year;
  }

  cout << year << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS                                                                    \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define mk make_pair
#define pi pair<int, int>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = a; i >= (b); --i)
using namespace std;
int dt[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {0, 0}};
// typedef pair<int, int> P;
// priority_queue<int, vector<int>, greater<int> > q;
int main() {
  IOS;
  ll x;
  cin >> x;
  ll now = 100;
  ll ans = 0;
  while (now < x) {
    now += (int)(now * 0.01);
    ++ans;
  }
  cout << ans;
}


Fixed submission:
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define IOS                                                                    \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define mk make_pair
#define pi pair<int, int>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = a; i >= (b); --i)
using namespace std;
int dt[][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {0, 0}};
// typedef pair<int, int> P;
// priority_queue<int, vector<int>, greater<int> > q;
int main() {
  IOS;
  ll x;
  cin >> x;
  ll now = 100;
  ll ans = 0;
  while (now < x) {
    now += now * 0.01;
    ++ans;
  }
  cout << ans;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long k;
  cin >> k;
  int ans = 0;
  int d = 100;
  while (d < k) {
    d = floor(1.01 * d);
    ans++;
  }
  cout << ans << endl;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long k;
  cin >> k;
  int ans = 0;
  long long d = 100.0;
  while (d < k) {
    d = floor(1.01 * d);
    ans++;
  }
  cout << ans << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define MOD_NUMBER 1000000007

template <class T> void vector_print(vector<T> vec) {
  for (unsigned int i = 0; i < vec.size(); i++) {
    cout << vec.at(i);
    if (i < vec.size() - 1) {
      cout << " ";
    } else if (i == vec.size() - 1) {
      cout << endl;
    }
  }
}

int main() {
  ll x, ans = 0, table = 100;
  cin >> x;
  while (table < x) {
    table = table * 101 / 100;
    ans++;
  }

  cout << ans << endl;

  return 0;
}


Fixed submission:
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define MOD_NUMBER 1000000007

template <class T> void vector_print(vector<T> vec) {
  for (unsigned int i = 0; i < vec.size(); i++) {
    cout << vec.at(i);
    if (i < vec.size() - 1) {
      cout << " ";
    } else if (i == vec.size() - 1) {
      cout << endl;
    }
  }
}

int main() {
  ll x, ans = 0, table = 100;
  cin >> x;
  while (table < x) {
    table = (ll)(table * 1.01);
    ans++;
  }

  cout << ans << endl;

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;

int main() {
  ll x;
  cin >> x;

  ll now = 100;
  int res = 0;

  while (1) {
    res++;
    res += res / 100;
    if (now >= x)
      break;
  }
  cout << res << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;

int main() {
  ll x;
  cin >> x;

  ll now = 100;
  int res = 0;

  while (1) {
    res++;
    now += now / 100;
    if (now >= x)
      break;
  }
  cout << res << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
  long long X, A = 100;
  int Y = 0;
  cin >> X;
  while (A < X) {
    A = A * 101 / 100;
    Y++;
  }
  cout << Y << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
  long long X, A = 100;
  int Y = 0;
  cin >> X;
  while (A < X) {
    A = A + A / 100;
    Y++;
  }
  cout << Y << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()

int main() {
  ll x;
  cin >> x;
  ll start = 100;
  for (ll i = 1;; i++) {
    start *= 101;
    start /= 100;
    if (start >= x) {
      cout << i << endl;
      return 0;
    }
  }
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()

int main() {
  ll x;
  cin >> x;
  ll start = 100;
  for (ll i = 1;; i++) {
    start = start + start / 100;
    if (start >= x) {
      cout << i << endl;
      return 0;
    }
  }
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {

  int x, yokin = 100, year = 0;
  cin >> x;

  while (x > yokin) {
    yokin = yokin * 1.01;
    year++;
  }

  cout << year << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {

  long long x, yokin = 100, year = 0;
  cin >> x;

  while (x > yokin) {
    yokin = yokin * 1.01;
    year++;
  }

  cout << year << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <iostream>
#include <math.h>
#include <string.h>

using namespace std;

int main() {
  int tc, i, j;
  ;

  long long n;
  cin >> n;

  long long ans = 0;
  int awal = 100, bunga = 0;
  while (awal < n) {
    awal = awal * 1.01;
    ans++;
  }

  cout << ans << "\n";
  return 0;
}

Fixed submission:
#include <iostream>
#include <math.h>
#include <string.h>

using namespace std;

int main() {
  int tc, i, j;
  ;

  long long n;
  cin >> n;

  long long ans = 0;
  long long awal = 100;
  while (awal < n) {
    awal = awal * 1.01;
    ans++;
  }

  cout << ans << "\n";
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {

  long long X;
  cin >> X;
  int my = 100;
  int ans = 0;

  while (my < X) {
    my += my / 100;
    ans++;
  }

  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {

  long long X;
  cin >> X;
  long long my = 100;
  int ans = 0;

  while (my < X) {
    my += my / 100;
    ans++;
  }

  cout << ans << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster                                                                 \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0);
#define debug cout << "Debugging.." << endl
using namespace std;
int main() {
  faster;

  ll int x;
  cin >> x;
  ll int p = 0, c = 0;
  while (p < x) {
    p += p / 100;
    c++;
  }
  cout << c;
}


Fixed submission:
#include <bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster                                                                 \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0);
#define debug cout << "Debugging.." << endl
using namespace std;
int main() {
  faster;

  ll int x;
  cin >> x;
  ll int p = 100, c = 0;
  while (p < x) {
    p += p / 100;
    c++;
  }
  cout << c;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>

#define FAST_IO                                                                \
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
// #define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
const int N = 1e5 + 2;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;

int32_t main() {
  FAST_IO;
  int x;
  cin >> x;
  int si = 0, p = 100;
  int amount = p;
  int ans = 0;
  while (amount < x) {
    si = amount / 100;
    amount += si;
    ans++;
  }
  cout << ans;
  return 0;
}

Fixed submission:
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>

#define FAST_IO                                                                \
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define int long long
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
const int N = 1e5 + 2;
const int INF = 1e9 + 5;
const int MOD = 1e9 + 7;

int32_t main() {
  FAST_IO;
  int x;
  cin >> x;
  int si = 0, p = 100;
  int amount = p;
  int ans = 0;
  while (amount < x) {
    si = amount / 100;
    amount += si;
    ans++;
  }
  cout << ans;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define MOD 1000000007
#define PI 3.1415

int main() {
  ll x;
  cin >> x;

  ll v = 100;
  ll co = 0;
  while (x > v) {
    v *= 101;
    v /= 100;
    co++;
  }
  cout << co << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define MOD 1000000007
#define PI 3.1415

int main() {
  ll x;
  cin >> x;

  ll v = 100;
  ll co = 0;
  while (x > v) {
    v = v + (v / 100);
    co++;
  }
  cout << co << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long int bal = 100, val, count = 0;
  cin >> val;
  while (bal < val) {
    bal += int(bal * 0.01);
    count++;
  }
  cout << count;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long int bal = 100, val, count = 0;
  cin >> val;
  while (bal < val) {
    bal += (long long int)(bal * 0.01);
    count++;
  }
  cout << count;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;

int main() {
  int ans = 0;
  int a = 100;
  long long X;
  cin >> X;

  while (X > a) {
    a += a / 100;
    a /= 1;
    ans++;
  }
  cout << ans << endl;
  return 0;
}


Fixed submission:
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long ans = 0;
  long long a = 100;
  long long X;
  cin >> X;

  while (X > a) {
    a += a / 100;
    a /= 1;
    ans++;
  }
  cout << ans << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  int64_t a = 100;
  int64_t x;
  cin >> x;
  int count = 0;
  while (a < x) {
    a = a * 101 / 100;
    count++;
  }
  cout << count << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int64_t a = 100;
  int64_t x;
  cin >> x;
  int count = 0;
  while (a < x) {
    a += a / 100;
    count++;
  }
  cout << count << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  int t = 100;
  int count = 0;
  cin >> n;
  while (n > t) {
    count++;
    t *= 1.01;
  }
  cout << count << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  uint64_t n;
  uint64_t t = 100;
  uint64_t count = 0;
  cin >> n;
  while (n > t) {
    count++;
    t *= 1.01;
  }
  cout << count << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long X;
  cin >> X;
  long long a = 100;
  for (long long i = 0; i < X; i++) {
    a = a * 101 / 100;
    if (a >= X) {
      cout << i + 1 << endl;
      return 0;
    }
  }
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long X;
  cin >> X;
  long long a = 100;
  for (int i = 0; i < 100000; i++) {
    a = a + a / 100;
    if (a >= X) {
      cout << i + 1 << endl;
      return 0;
    }
  }
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 10000000000000;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio                                                                 \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);
using namespace std;
int main() {
  fastio;
  ll n = 0;
  cin >> n;
  ll sum = 100;
  ll c = 0;
  while (sum < n) {
    sum = sum * 101;
    sum = sum / 100;
    ++c;
  }
  cout << c;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 10000000000000;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio                                                                 \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);
using namespace std;
int main() {
  fastio;
  ll n = 0;
  cin >> n;
  ll sum = 100;
  ll c = 0;
  while (sum < n) {
    ll i = sum / 100;
    sum += i;
    ++c;
  }
  cout << c;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <cstdio>

int main() {
  long int x;
  scanf("%ld", &x);
  long int moto = 100;
  long int ans = 0;
  while (moto < x) {
    ans++;
    moto = moto * 101 / 100;
  }
  printf("%ld", ans);
  return 0;
}

Fixed submission:
#include <cstdio>

int main() {
  long int x;
  scanf("%ld", &x);
  long int moto = 100;
  long int ans = 0;
  while (moto < x) {
    ans++;
    double motof = (double)moto;
    moto = (long int)motof * 1.01;
  }
  printf("%ld", ans);
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll x;
  cin >> x;
  ll w = 100;
  ll cnt = 0;
  while (w < x) {
    cnt++;
    w = w * 101;
    w = w / 100;
    // cout << w << endl;
  }
  cout << cnt << "\n";
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll x;
  cin >> x;
  ll w = 100;
  ll cnt = 0;
  while (w < x) {
    cnt++;
    w += w / 100;
    // cout << w << endl;
  }
  cout << cnt << "\n";
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long x;
  cin >> x;
  long long p = 100LL;
  long long num = 0LL;
  while (p < x) {
    num++;
    p *= 101;
    p /= 100;
  }
  cout << num;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long x;
  cin >> x;
  long long p = 100LL;
  long long num = 0LL;
  while (p < x) {
    num++;
    p += p / 100;
  }
  cout << num;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  long long s = 100, x = 0;
  do {
    s = s * 1.01 / 1;
    x++;
  } while (s != n);
  cout << x;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long X;
  cin >> X;
  long long F = 100;
  long long year = 0;
  while (F < X) {
    year++;
    F = F * 1.01 / 1;
  }
  cout << year;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  long s;
  int t = 100;
  int c = 0;
  cin >> s;
  while (t < s) {
    t += t / 100;
    c++;
  }
  cout << c << endl;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long s;
  long t = 100;
  long c = 0;
  cin >> s;
  while (t < s) {
    t += t / 100;
    c++;
  }
  cout << c << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
const int inf = 1e18;
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int x, p = 100, c = 0;
  cin >> x;
  while (p < x) {
    p = (p * 101) / 100;
    c++;
  }
  cout << c;
}

Fixed submission:
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
const int inf = 1e18;
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int x, p = 100, c = 0;
  cin >> x;
  while (p < x) {
    p += p / 100;
    c++;
  }
  cout << c;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  int x, num = 100, h = 0;
  cin >> x;
  while (x > num) {
    num += num / 100;
    h++;
  }
  cout << h << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  long long x, num = 100, h = 0;
  cin >> x;
  while (x > num) {
    num += num / 100;
    h++;
  }
  cout << h << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
// #pragma GCC optimize("Ofast")

#pragma GCC optimize("O3")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i += 1)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i -= 1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define C 1000000001
#define M 998244353
#define all(x) x.begin(), x.end()
using namespace std;
// From Geeksforgeeks
inline ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
// Power function took from geeksforgeeks
ll power(ll x, ll y) {
  ll res = 1;

  x = x;
  if (x == 0)
    return 0;
  while (y > 0) {
    if (y & 1)
      res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
double dist(ll x1, ll y1, ll x2, ll y2) {
  double ans = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ll x, a = 0;
  cin >> x;
  ll ans = 100, count = 0;
  while (ans != x) {
    ans += (ans / 100);
    count += 1;
  }
  cout << count;
  return 0;
}

Fixed submission:
// #pragma GCC optimize("Ofast")

#pragma GCC optimize("O3")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i += 1)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i -= 1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define C 1000000001
#define M 998244353
#define all(x) x.begin(), x.end()
using namespace std;
// From Geeksforgeeks
inline ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
// Power function took from geeksforgeeks
ll power(ll x, ll y) {
  ll res = 1;

  x = x;
  if (x == 0)
    return 0;
  while (y > 0) {
    if (y & 1)
      res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
double dist(ll x1, ll y1, ll x2, ll y2) {
  double ans = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ll x, a = 0;
  cin >> x;
  ll ans = 100, count = 0;
  while (1) {
    if (ans >= x)
      break;
    ans += (ans / 100);
    count += 1;
  }
  cout << count;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  int64_t x;
  cin >> x;

  int h = 100;
  int ans = 0;
  while (h < x) {
    h *= 1.01;
    ans++;
  }
  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int64_t x;
  cin >> x;

  int64_t h = 100;
  int64_t ans = 0;
  while (h < x) {
    h *= 1.01;
    ans++;
  }
  cout << ans << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <cmath>
#include <iostream>
using namespace std;

int main() {
  long long X, n = 0;
  int yen = 100;
  cin >> X;

  while (++n) {
    yen = yen + yen * 0.01;
    if (yen >= X)
      break;
  }
  cout << n << endl;
  // cout << round(log((double) X/100) / log(1.01)) << endl;
}

Fixed submission:
#include <cmath>
#include <iostream>
using namespace std;

int main() {
  long long X, n = 0;
  long long yen = 100;
  cin >> X;

  while (++n) {
    yen = yen + yen * 0.01;
    if (yen >= X)
      break;
  }
  cout << n << endl;
  // cout << round(log((double) X/100) / log(1.01)) << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main() {
  ll x;
  cin >> x;
  int a = 100;
  int ans = 0;
  while (a < x) {
    a *= 1.01;
    ans++;
  }
  cout << ans << endl;
}


Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main() {
  ll x;
  cin >> x;
  ll a = 100;
  int ans = 0;
  while (a < x) {
    a *= 1.01;
    ans++;
  }
  cout << ans << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>

using namespace std;
#define ll long long
int main() {
  ll r = 0;
  ll x;
  cin >> x;
  ll i = 100;
  while (i < x) {
    i = i * 101 / 100;
    r++;
  }
  cout << r;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>

using namespace std;
#define ll long long
int main() {
  ll r = 0;
  ll x;
  cin >> x;
  ll i = 100;
  while (i < x) {
    i = i + i / 100;
    r++;
  }
  cout << r;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
  ll X;
  cin >> X;
  ll sum = 100;
  ll n = 0;
  while (sum < X) {
    sum = sum * 101 / 100;
    n++;
  }
  cout << n << endl;
}

Fixed submission:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
  ll X;
  cin >> X;
  ll sum = 100;
  ll n = 0;
  while (sum < X) {
    sum = sum + sum / 100;
    n++;
  }
  cout << n << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  int64_t n, as = 100;
  cin >> n;
  for (int64_t i = 1;; i++) {
    as += (int)as * 0.01;
    if (as >= n) {
      cout << i << endl;
      break;
    }
  }
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int64_t n, as = 100;
  cin >> n;
  for (int64_t i = 1;; i++) {
    as += (int64_t)as * 1 / 100;
    if (as >= n) {
      cout << i << endl;
      break;
    }
  }
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
  ll x;
  cin >> x;
  ll ans = 0;
  ll yen = 100;
  while (1) {
    if (yen >= x)
      break;
    yen *= 101;
    yen /= 100;
    ans++;
  }
  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
  ll x;
  cin >> x;
  ll ans = 0;
  ll yen = 100;
  while (1) {
    if (yen >= x)
      break;
    yen += yen / 100;
    ans++;
  }
  cout << ans << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <iostream>

using namespace std;

int main() {
  long long X;
  cin >> X;
  long long a = 0;
  long long i = 100;
  while (i < X) {
    i = i + int(i * 0.01);
    a += 1;
  }
  cout << a << endl;
}


Fixed submission:
#include <iostream>

using namespace std;

int main() {
  long long X;
  cin >> X;
  long long a = 0;
  long long i = 100;
  while (i < X) {
    i *= 1.01;
    a += 1;
  }
  cout << a << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

using namespace std;

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna> using akari = vector<kizuna>;
template <class yuzuki> using yukari = akari<akari<yuzuki>>;
template <class tsurumaki> using maki = akari<yukari<tsurumaki>>;
//{akane : ascending order, aoi : decending order} priority queue
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha> using aoi = priority_queue<kotonoha>;

//------------------------------- Libraries ---------------------------------//

//------------------------------- Dubug Functions ---------------------------//

inline void print() { cout << endl; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
  cout << first << ' ';
  print(rest...);
}

//------------------------------- Solver ------------------------------------//

void solve() {
  i64 x;
  cin >> x;
  i64 c = 100;
  for (int i = 1;; i++) {
    c = c * 101 / 100;
    if (c >= x) {
      cout << i << endl;
      return;
    }
  }
}

int main() {
  solve();
  return 0;
}


Fixed submission:
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

using namespace std;

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna> using akari = vector<kizuna>;
template <class yuzuki> using yukari = akari<akari<yuzuki>>;
template <class tsurumaki> using maki = akari<yukari<tsurumaki>>;
//{akane : ascending order, aoi : decending order} priority queue
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha> using aoi = priority_queue<kotonoha>;

//------------------------------- Libraries ---------------------------------//

//------------------------------- Dubug Functions ---------------------------//

inline void print() { cout << endl; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
  cout << first << ' ';
  print(rest...);
}

//------------------------------- Solver ------------------------------------//

void solve() {
  i64 x;
  cin >> x;
  i64 c = 100;
  for (int i = 1;; i++) {
    c = c * 1.01;
    if (c >= x) {
      cout << i << endl;
      return;
    }
  }
}

int main() {
  solve();
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <iostream>
using namespace std;
int main() {
  long long x;
  cin >> x;
  long long m = 100;
  int i;
  for (i = 0; m < x; i++) {
    m = m * 101 / 100;
  }
  cout << i << endl;
}

Fixed submission:
#include <iostream>
using namespace std;
int main() {
  long long x;
  cin >> x;
  long long m = 100;
  int i;
  for (i = 0; m < x; i++) {
    m = m + m / 100;
  }
  cout << i << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)

int main() {
  long X;
  cin >> X;
  long a = 100;
  long ans = 0;
  while (a < X) {
    a = (a * 101) / 100;
    ans++;
  }
  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)

int main() {
  long X;
  cin >> X;
  long a = 100;
  long ans = 0;
  while (a < X) {
    a += a / 100;
    ans++;
  }
  cout << ans << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#include <cstdio>
#include <fstream>
using namespace std;
// vector<pair<int,int> > v;
// cin.ignore();//twice getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout<<(A + B == C ? "YES" : "NO")<<endl;
// __gcd(a,b)
// string s=to_string(i);
// sort(arr, arr+n, greater<int>());
// const long double pi = acos(-1.0);
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define vll vector<ll>
#define mll map<ll, ll>
#define mlli map<ll, ll>::iterator
#define size size()
#define endl "\n"
#define ll long long int
#define ld long double
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}

int main(void) {
  fast();
  ll x;
  cin >> x;
  ll c = 0;
  ll an = 100;
  while (1) {
    if (an < x) {
      an = an + (an * double(1 / 100));
      c++;
    } else {
      break;
    }
  }
  cout << c << endl;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#include <cstdio>
#include <fstream>
using namespace std;
// vector<pair<int,int> > v;
// cin.ignore();//twice getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout<<(A + B == C ? "YES" : "NO")<<endl;
// __gcd(a,b)
// string s=to_string(i);
// sort(arr, arr+n, greater<int>());
// const long double pi = acos(-1.0);
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define vll vector<ll>
#define mll map<ll, ll>
#define mlli map<ll, ll>::iterator
#define size size()
#define endl "\n"
#define ll long long int
#define ld long double
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}

int main(void) {
  fast();
  ll x;
  cin >> x;
  ll c = 0;
  ll an = 100;
  while (1) {
    if (an < x) {
      // an=an+(an*0.01);
      an = an + (an * double(double(1) / double(100)));
      c++;
    } else {
      break;
    }
  }
  cout << c << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  int x, year = 0, i = 100;
  cin >> x;
  while (i < x) {
    i = i * 1.01;
    year++;
  }
  cout << year << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long X;
  cin >> X;
  long long i = 100, year = 0;
  while (i < X) {
    i = i * 1.01;
    year++;
  }
  cout << year << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long x, i, tt = 0;
  cin >> x;
  while (i < x) {
    i += i / 100;
    tt++;
  }
  cout << tt;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long x, i = 100, tt = 0;
  cin >> x;
  while (i < x) {
    i += i / 100;
    tt++;
  }
  cout << tt;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

int main() {
  int64_t X;
  cin >> X;

  int i = 0;
  int money = 100;

  while (true) {
    i++;
    money *= 1.01;
    if (money >= X)
      break;
  }

  cout << i << endl;

  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int64_t X;
  cin >> X;

  int i = 0;
  int64_t money = 100;

  while (true) {
    i++;
    money *= 1.01;
    if (money >= X)
      break;
  }

  cout << i << endl;

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
  ll x;
  cin >> x;
  ll val = 100;
  int i;
  for (i = 0; val < x; i++)
    val = (int)(val * 1.01);
  cout << i << endl;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
  ll x;
  cin >> x;
  ll val = 100;
  int i;
  for (i = 0; val < x; i++)
    val = (ll)(val * 1.01);
  cout << i << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

ll solve() {
  ll t = 0, a = 0, x;
  cin >> x;
  while (a < x) {
    a += a / 100;
    t++;
  }
  cout << t << endl;
  return 0;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  solve();
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

ll solve() {
  ll t = 0, a = 100, x;
  cin >> x;
  while (a < x) {
    a += a / 100;
    t++;
  }
  cout << t << endl;
  return 0;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  solve();
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int x;
  cin >> x;
  int d = 100;
  int cnt = 0;

  while (d < x) {
    d = d + d * 0.01;
    cnt++;
  }
  cout << cnt << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int x;
  cin >> x;
  long long int d = 100;
  long long int cnt = 0;

  while (d < x) {
    d = d + d * 0.01;
    cnt++;
  }
  cout << cnt << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;

int main() {

  ll X;
  cin >> X;
  ll money = 100;
  ll time = 0;
  while (money < X) {
    money = int(money * 1.01);
    time++;
  }
  cout << time << endl;
}

Fixed submission:
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;

int main() {

  ll X;
  cin >> X;
  ll money = 100;
  ll time = 0;
  while (money < X) {
    money = money * 1.01;
    time++;
  }
  cout << time << endl;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <iostream>
using namespace std;

int main() {
  int x, cnt = 0;
  int total = 100;
  cin >> x;
  while (total < x) {
    total += total / 100;
    cnt++;
  }
  cout << cnt << endl;
  return 0;
}


Fixed submission:
#include <iostream>
using namespace std;

int main() {
  int cnt = 0;
  long long total = 100;
  long long x;
  cin >> x;
  while (total < x) {
    total += total / 100;
    cnt++;
  }
  cout << cnt << endl;
  return 0;
}