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

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)

using namespace std;

typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;

const ll INF = 1e15;
const ll MOD = 1e9 + 7;

int main() {
  ll i, j, k;
  ll X;
  cin >> X;
  ll ans = 1;
  ll now = 100;
  while (1) {
    now = now * 101 / 100;
    if (now >= X) {
      cout << ans << endl;
      return 0;
    }
    ans++;
  }

  return 0;
}

Fixed submission:
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)

using namespace std;

typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;

const ll INF = 1e15;
const ll MOD = 1e9 + 7;

int main() {
  ll i, j, k;
  ll X;
  cin >> X;
  ll ans = 1;
  ll now = 100;
  while (1) {
    now += now / 100;
    if (now >= X) {
      cout << ans << endl;
      return 0;
    }
    ans++;
  }

  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 year = 0;
  long long s = 100;

  while (s < X) {
    s = s * 101 / 100;

    year++;
  }
  cout << year << endl;
}


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

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

  int year = 0;
  long long s = 100;

  while (s < X) {
    s = s + s / 100;

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

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

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

  int count = 0, money = 100;
  while (money < x) {
    money *= 1.01;
    count++;
  }
  std::cout << count << std::endl;
}

Fixed submission:
#include <iostream>

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

  int64_t count = 0, money = 100;
  while (money < x) {
    money *= 1.01;
    count++;
  }
  std::cout << count << std::endl;
}
Problem p02694 (C++)

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

int main() {
  int x, a = 100, b = 0;
  cin >> x;

  while (a < x) {
    b++;
    a += a / 100;
  }

  cout << b << endl;
}


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

int main() {
  long x, a = 100, b = 0;
  cin >> x;

  while (a < x) {
    b++;
    a += a / 100;
  }

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

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

int main() {
  int x, price = 100, count = 0;
  cin >> x;
  while (price < x) {
    price *= 1.01;
    count += 1;
  }
  cout << count << endl;
}


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

int main() {
  int64_t x, price = 100, count = 0;
  cin >> x;
  while (price < x) {
    price *= 1.01;
    count += 1;
  }
  cout << count << 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)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;

const int INF = 1001001001;

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

  int x, i = 0, a = 100;
  cin >> x;
  while (1) {
    i++;
    a *= 1.01;
    if (a >= x) {
      cout << i << endl;
      break;
    }
  }

  cout << endl;
  return 0;
}


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

#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
typedef pair<int, int> P;

const int INF = 1001001001;

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

  ll x, i = 0, a = 100;
  cin >> x;
  while (1) {
    i++;
    a *= 1.01;
    if (a >= x) {
      cout << i << endl;
      break;
    }
  }

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

Buggy submission (status: Time Limit Exceeded):
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FIXED_FLOAT(x) std::fixed << std::setprecision(7) << (x)
#define MAX 100
#define fast                                                                   \
  ios::sync_with_stdio(0);                                                     \
  cin.tie(0);                                                                  \
  cout.tie(0)
#define INF 1e9
#define ll long long
#define vi vector<int>
#define all(a) a.begin(), a.end()
#define pb push_back
#define ull unsigned long long

using namespace std;
const int N = 1e3 + 5;

void solve() {
  ll n;
  cin >> n;
  int p = 100, nas = 0;
  while (p < n) {
    p *= 1.01;
    nas++;
  }
  cout << nas << '\n';
}
int main() {
  fast;
  solve();
}


Fixed submission:
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FIXED_FLOAT(x) std::fixed << std::setprecision(7) << (x)
#define MAX 100
#define fast                                                                   \
  ios::sync_with_stdio(0);                                                     \
  cin.tie(0);                                                                  \
  cout.tie(0)
#define INF 1e9
#define ll long long
#define vi vector<int>
#define all(a) a.begin(), a.end()
#define pb push_back
#define ull unsigned long long

using namespace std;
const int N = 1e3 + 5;

void solve() {
  ll n;
  cin >> n;
  ll p = 100, nas = 0;
  while (p < n) {
    p *= 1.01;
    nas++;
  }
  cout << nas << '\n';
}
int main() {
  fast;
  solve();
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
int main() {
  unsigned long long num, solve;
  while (cin >> num) {
    int count = 0;
    solve = 100;
    while (num != solve) {
      int percentage = solve / 100;
      solve += percentage;
      count++;
    }
    cout << count << endl;
    break;
  }
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  unsigned long long num, solve;
  while (cin >> num) {
    int count = 0;
    solve = 100;
    while (num > solve) {
      solve = solve + (solve / 100);
      count++;
    }
    cout << count << endl;
    break;
  }
}
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 money = 100;
  for (int i = 1;; i++) {
    money *= 101;
    money /= 100;
    if (money >= X) {
      cout << i << endl;
      break;
    }
  }
}

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

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

  long long money = 100;
  for (int i = 1;; i++) {
    money += money / 100;
    if (money >= X) {
      cout << i << endl;
      break;
    }
  }
}
Problem p02694 (C++)

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

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
int main() {
  unsigned long long int x, count = 0;
  cin >> x;
  unsigned long long int n = 100;
  while (n < x) {
    n = n + n / 100;
    count++;
  }
  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 m = 100;
  long long ans = 1;
  while (1) {
    m *= 101;
    m /= 100;
    if (x <= m)
      break;
    ans++;
  }
  cout << ans << endl;
}

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

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

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

ll n, m, ans;

inline ll read() {
  ll s = 0, w = 1;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    w *= ch == '-' ? -1 : 1;
  for (; ch >= '0' && ch <= '9'; ch = getchar())
    s = s * 10 + ch - '0';
  return s * w;
}

inline void work() {
  n = read();
  m = 101;
  for (ans = 1; m < n; ++ans, m += int(m * 0.01))
    ;
  printf("%lld\n", ans);
}

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

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

ll n, m, ans;

inline ll read() {
  ll s = 0, w = 1;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    w *= ch == '-' ? -1 : 1;
  for (; ch >= '0' && ch <= '9'; ch = getchar())
    s = s * 10 + ch - '0';
  return s * w;
}

inline void work() {
  n = read(), m = 101;
  for (ans = 1; m < n; ++ans, m += m * 0.01 * 1ll)
    ;
  printf("%lld\n", ans);
}

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

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;

//------------↓------------- M -------------- E ---------------- M
//--------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M
//--------------- O ---------------↑--------------//

int main(void) {

  ll g = 100;
  int ans = 0;
  ll X;
  cin >> X;
  while (X > g) {
    g = g * 101 / 100;
    ++ans;
  }
  out(ans);

  return 0;
}


Fixed submission:
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
const int MOD = 1000000007;
const int INF = 2147483647;
const ld PI = 3.14159265358979323846;

//------------↓------------- M -------------- E ---------------- M
//--------------- O ---------------↓--------------//
// コンパイル
// g++ -std=c++1z
//
// -------型変換--------
// int を string に変換
// string s = to_string(n);
// string を int に変換
// int n = stoi(s);
//
// -------二分探索---------
// k以上の値が最初に現れる時のイテレータ
// lower_bound(data.begin(), data.end(), k)
// kより大きい値が最初の現れる時のイテレータ O(logN)
// upper_bound(data.begin(), data.end(), k)
// kがdataに存在するかをtrue or falseで返す O(logN)
// binary_search(data.begin(), data.end(), k)
//
//
//
//
//
//
//
//------------↑------------- M -------------- E ---------------- M
//--------------- O ---------------↑--------------//

int main(void) {

  ll g = 100;
  int ans = 0;
  ll X;
  cin >> X;
  while (X > g) {
    g = g + g / 100;
    ++ans;
  }
  out(ans);

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
  long long X;
  int a = 100;
  cin >> X;
  int cnt = 0;
  while (a < X) {
    a += a / 100;
    cnt++;
  }
  cout << cnt;
  return 0;
}


Fixed submission:
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main() {
  long long X;
  long long a = 100;
  cin >> X;
  int cnt = 0;
  while (a < X) {
    a += a / 100;
    cnt++;
  }
  cout << cnt;
  return 0;
}
Problem p02694 (C++)

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

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int x, yokin, i;
  cin >> x;
  yokin = 100;
  for (i = 0; yokin < x; i++) {
    yokin = yokin * 1.01;
  }

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

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

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long x, yokin;
  int i;
  cin >> x;
  yokin = 100;
  for (i = 0; yokin < x; i++) {
    yokin = yokin * 1.01;
  }

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

Buggy submission (status: Time Limit Exceeded):
// codeforces
//
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
// #define inf 1e9+7
#define int64 long long
#define VI vector<int>
#define all(v) v.begin(), v.end()
#define inpv(v)                                                                \
  for (auto &x : v)                                                            \
  cin >> x
#define pii pair<int, int>
#define CASES                                                                  \
  int tt;                                                                      \
  cin >> tt;                                                                   \
  while (tt--)
#define for0(i, n) for (int i = 0; i < n; i++)
const int64 inf = 1e9 + 7;
const char nwl = '\n';

int main() {
  // ur code
  int64 n;
  cin >> n;
  int64 s;
  int t = 0;
  while (s < n) {
    s = s + s / 100;
    t++;
  }
  cout << t;

  return 0;
}


Fixed submission:
// codeforces
//
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
// #define inf 1e9+7
#define int64 long long
#define VI vector<int>
#define all(v) v.begin(), v.end()
#define inpv(v)                                                                \
  for (auto &x : v)                                                            \
  cin >> x
#define pii pair<int, int>
#define CASES                                                                  \
  int tt;                                                                      \
  cin >> tt;                                                                   \
  while (tt--)
#define for0(i, n) for (int i = 0; i < n; i++)
const int64 inf = 1e9 + 7;
const char nwl = '\n';

int main() {
  // ur code
  int64 n;
  cin >> n;
  int64 s = 100;
  int t = 0;
  while (s < n) {
    s = s + s / 100;
    t++;
  }
  cout << t;

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <iostream>
using namespace std;
int main() {
  long long int x;
  cin >> x;
  int c = 0;
  int a = 100;
  while (1) {
    c++;
    a = a + a / 100;
    if (a >= x)
      break;
  }
  cout << c << endl;
  return 0;
}


Fixed submission:
#include <iostream>
using namespace std;
int main() {
  long long int x;
  cin >> x;
  int c = 0;
  long long int a = 100;
  while (1) {
    c++;
    a = a + a / 100;
    if (a >= x)
      break;
  }
  cout << c << endl;
  return 0;
}
Problem p02694 (C++)

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

int X;
int money = 100;

int main() {
  cin >> X;
  int cnt = 0;
  while (X > money) {
    money = money * 1.01;
    cnt++;
  }
  cout << cnt;
}

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

long long X;
long long money = 100;

int main() {
  cin >> X;
  int cnt = 0;
  while (X > money) {
    money = money * 1.01;
    cnt++;
  }
  cout << cnt;
}
Problem p02694 (C++)

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

int main() {
  int year = 0;
  ll money = 100;
  ll X;
  cin >> X;
  while (money < X) {
    money = (101 * money) / 100;
    year++;
  }

  cout << year << endl;
}


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

int main() {
  int year = 0;
  ll money = 100;
  ll X;
  cin >> X;
  while (money < X) {
    money = money + money / 100;
    year++;
  }

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

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end)                                                     \
  for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end)                                                    \
  for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint X;
  cin >> X;
  lint now = 100;
  int idx = 1;
  while (true) {
    now = now * 101 / 100;
    if (now >= X) {
      cout << idx << endl;
      return 0;
    }
    idx++;
  }
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end)                                                     \
  for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end)                                                    \
  for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint X;
  cin >> X;
  lint now = 100;
  int idx = 1;
  while (true) {
    now = now * 1.01;
    if (now >= X) {
      cout << idx << endl;
      return 0;
    }
    idx++;
  }
}
Problem p02694 (C++)

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

int main() {
  ll x;
  cin >> x;
  ll ans = 0;
  ll yokin = 100;
  for (ll i = 1;; i++) {
    yokin = yokin * 101 / 100;
    if (yokin >= x) {
      ans = i;
      break;
    }
  }

  cout << ans << endl;
}

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

int main() {
  ll x;
  cin >> x;
  ll ans = 0;
  ll yokin = 100;
  for (ll i = 1;; i++) {
    yokin = yokin * 1.01;
    if (yokin >= x) {
      ans = i;
      break;
    }
  }

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

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

int main() {
  int num = 100;
  int X;
  int year = 0;
  cin >> X;
  while (num < X) {
    num = num * 1.01;
    year++;
  }
  cout << year << endl;
}


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

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

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

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


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

int main() {
  long long x = 0;
  cin >> x;
  int count = 0;
  long long num = 100;
  while (num < x) {
    num += num / 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;
  int a = 0;
  int b = 100;
  cin >> X;
  while (true) {
    b *= 1.01;
    a++;
    if (b >= X) {
      break;
    }
  }
  cout << a << endl;
}

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

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

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>    // assert
#include <cmath>      // abs など
#include <functional> // greater など
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric> // accumulate, gcd など
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
// typedef int128_t ll;
// typedef cpp_int ll;

// GCC, 配列のアクセスなど
#define _GLIBCXX_DEBUG
// Clang, 配列のアクセスなど
#define _LIBCPP_DEBUG 0

// #define NDEBUG 1
// debug用出力 https://trap.jp/post/998/
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << H << " ";
  debug_out(T...);
}
#ifdef NDEBUG
#define debug(...)
#else
#define debug(...) debug_out(__VA_ARGS__)
#endif

//////////////// //////////////// //////////////// ////////////////
///////////////////
//////////////// //////////////// //////////////// ////////////////
///////////////////

// constexpr inline ll mod = 1'000'000'007;
// constexpr int max_n = 200'000 + 5;

int main() {
  // 高速な入出力
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(15); // 浮動小数の表示の精度

  ll x;
  cin >> x;
  int y = 0;
  ll a = 100;
  while (a < x) {
    y++;
    a = a * 101 / 100;
  }
  cout << y << endl;

  return 0;
}


Fixed submission:
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>    // assert
#include <cmath>      // abs など
#include <functional> // greater など
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric> // accumulate, gcd など
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
// typedef int128_t ll;
// typedef cpp_int ll;

// GCC, 配列のアクセスなど
#define _GLIBCXX_DEBUG
// Clang, 配列のアクセスなど
#define _LIBCPP_DEBUG 0

// #define NDEBUG 1
// debug用出力 https://trap.jp/post/998/
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << H << " ";
  debug_out(T...);
}
#ifdef NDEBUG
#define debug(...)
#else
#define debug(...) debug_out(__VA_ARGS__)
#endif

//////////////// //////////////// //////////////// ////////////////
///////////////////
//////////////// //////////////// //////////////// ////////////////
///////////////////

// constexpr inline ll mod = 1'000'000'007;
// constexpr int max_n = 200'000 + 5;

int main() {
  // 高速な入出力
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(15); // 浮動小数の表示の精度

  ll x;
  cin >> x;
  int y = 0;
  ll a = 100;
  while (a < x) {
    y++;
    a += a / 100;
  }
  cout << y << endl;

  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, sta, end) for (ll i = sta; i < end; i++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define vvl vector<vector<ll>>
#define vl vector<ll>
#define acc_io                                                                 \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(false)
// name[i]   -> vl  name(i)
// name[i][j]-> vvl name(i,vl(j))
// or-> ||
#include <math.h>

signed main() {
  acc_io;
  ll x;
  cin >> x;
  ll y = 1, tmp = 100;
  while (1) {
    tmp /= 100;
    tmp *= 101;
    if (x <= tmp)
      break;
    y++;
  }
  cout << y << endl;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, sta, end) for (ll i = sta; i < end; i++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007
#define vvl vector<vector<ll>>
#define vl vector<ll>
#define acc_io                                                                 \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(false)
// name[i]   -> vl  name(i)
// name[i][j]-> vvl name(i,vl(j))
// or-> ||
#include <math.h>

signed main() {
  acc_io;
  ll x;
  cin >> x;
  ll y = 1, tmp = 100;
  while (1) {
    //		tmp/=100;
    tmp *= 1.01;
    if (x <= tmp)
      break;
    y++;
  }
  cout << y << endl;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  /// https://ideone.com/Fd5s8n

  ll x;
  cin >> x;
  int a[4000];
  a[0] = 100;
  for (int i = 1; i <= 4000; i++) {
    a[i] = a[i - 1] + a[i - 1] / 100;
    if (a[i] >= x) {
      cout << i << endl;
      return 0;
    }
  }
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  /// https://ideone.com/Fd5s8n

  ll x;
  cin >> x;
  ll a[4000];
  a[0] = 100;
  for (int i = 1; i <= 4000; i++) {
    a[i] = a[i - 1] + a[i - 1] / 100;
    if (a[i] >= x) {
      cout << i << endl;
      return 0;
    }
  }
  return 0;
}
Problem p02694 (C++)

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

int main() {
  int64_t kane = 100;
  int64_t x;
  cin >> x;
  int year = 0;
  while (kane < x) {
    year++;
    kane *= 1.01;
    kane = (int)kane;
  }
  cout << year << endl;
}


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

int main() {
  int64_t kane = 100;
  int64_t x;
  cin >> x;
  int year = 0;
  while (kane < x) {
    year++;
    kane += kane / 100;
  }
  cout << year << endl;
}
Problem p02694 (C++)

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

int main() {
  int X, M, Y;
  cin >> X;
  M = 100;
  Y = 0;
  while (M < X) {
    M *= 1.01;
    Y++;
  }

  cout << Y << endl;

  // ここにプログラムを追記
  // (ここで"試合結果の表"の2次元配列を宣言)
}


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

int main() {
  int64_t X, M, Y;
  cin >> X;
  M = 100;
  Y = 0;
  while (M < X) {
    M *= 1.01;
    Y++;
  }

  cout << Y << endl;

  // ここにプログラムを追記
  // (ここで"試合結果の表"の2次元配列を宣言)
}
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++)
#define all(v) v.begin(), v.end()
int main() {
  int64_t x;
  cin >> x;
  int64_t t = 100;
  int ans = 0;
  while (t < x) {
    t = (t * 101) / 100;
    ans++;
  }
  cout << ans << endl;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
  int64_t x;
  cin >> x;
  int64_t t = 100;
  int ans = 0;
  while (t < x) {
    t = t + t / 100;
    ans++;
  }
  cout << ans << endl;
}
Problem p02694 (C++)

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

int main(void) {
  int x;
  int n = 100;
  cin >> x;
  int i = 0;
  while (true) {
    if (n >= x) {
      cout << i;
      return 0;
    }
    n *= 1.01;
    i++;
  }
}

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

int main(void) {
  long long x;
  long long n = 100;
  cin >> x;
  int i = 0;
  while (true) {
    if (n >= x) {
      cout << i;
      return 0;
    }
    n *= 1.01;
    i++;
  }
}
Problem p02694 (C++)

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

int n, ans, now;

int main() {
  cin >> n;
  now = 100;
  while (now < n) {
    now += now * 0.01;
    ans++;
  }
  cout << ans << "\n";
  return 0;
}

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

long long n, ans, now;

int main() {
  cin >> n;
  now = 100;
  while (now < n) {
    now += now * 0.01;
    ans++;
  }
  cout << ans << "\n";
  return 0;
}
Problem p02694 (C++)

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

long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}

int main() {
  ll a = 100, x, n = 2;
  cin >> x;
  while (true) {
    a = a * 101 / 100;
    if (a >= x) {
      cout << n - 1 << endl;
      break;
    }
    n++;
  }
}

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

long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}

int main() {
  ll a = 100, x, n = 2;
  cin >> x;
  while (true) {
    a += a / 100;
    if (a >= x) {
      cout << n - 1 << endl;
      break;
    }
    n++;
  }
}
Problem p02694 (C++)

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

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

  unsigned long sum = 100;
  unsigned long i = 0;

  while (true) {
    sum += int(sum * 0.01);

    i++;
    if (sum >= x) {
      cout << i << endl;
      break;
    }
  }
}

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

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

  unsigned long sum = 100;
  unsigned long i = 0;

  while (true) {
    sum += long(sum * 0.01);

    i++;
    if (sum >= x) {
      cout << i << endl;
      break;
    }
  }
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;

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

  int money = 100;
  int ans = 0;
  while (true) {
    money *= 1.01;
    ans++;
    if (money >= x)
      break;
  }

  cout << ans << endl;
}


Fixed submission:
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;

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

  ll money = 100;
  ll ans = 0;
  while (true) {
    money *= 1.01;
    ans++;
    if (money >= x)
      break;
  }

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

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


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

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

int main() {
  long x;
  cin >> x;
  int sum = 100;
  for (int i = 1; i < 1000000000; i++) {
    sum *= 1.01;
    if (sum >= x) {
      cout << i << endl;
      break;
    }
  }
}


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

int main() {
  long x;
  cin >> x;
  long sum = 100;
  for (int i = 1;; i++) {
    sum *= 1.01;
    if (sum >= x) {
      cout << i << endl;
      break;
    }
  }
}
Problem p02694 (C++)

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

ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int main() {
  ll x;
  cin >> x;
  ll ans = 0;
  ll now = 100;
  while (now < x) {
    now = now * 101 / 100;
    ans++;
  }
  cout << ans << endl;
  return 0;
}


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

ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int main() {
  ll x;
  cin >> x;
  ll ans = 0;
  ll now = 100;
  while (now < x) {
    now = now * 1.01;
    ans++;
  }
  cout << ans << 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 FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
  cout << fixed << setprecision(10);
  ll x;
  cin >> x;
  ll now = 100;
  int cnt = 0;
  while (now < x) {
    cnt++;
    now *= 101;
    now /= 100;
  }
  cout << cnt << endl;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
  cout << fixed << setprecision(10);
  ll x;
  cin >> x;
  ll now = 100;
  int cnt = 0;
  while (now < x) {
    cnt++;
    ll sa = now / 100;
    now += sa;
  }
  cout << cnt << 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 money = 100;
  int ans = 0;
  while (money < x) {
    money *= 1.01;
    ans++;
  }

  cout << ans << endl;
}

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

int main() {

  long long x;
  cin >> x;
  long long money = 100;
  int ans = 0;
  while (money < x) {
    money *= 1.01;
    ans++;
  }

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

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

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

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

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

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

int main() {
  long long int x, tmp = 100, cnt = 0;
  cin >> x;
  while (tmp < x) {
    tmp = tmp * 101 / 100;
    cnt++;
    if (tmp >= x)
      break;
  }
  cout << cnt << endl;
  return 0;
}

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

int main() {
  long long int x, tmp = 100, cnt = 0;
  cin >> x;
  while (tmp < x) {
    tmp = tmp * 1.01;
    cnt++;
    if (tmp >= x)
      break;
  }
  cout << cnt << endl;
  return 0;
}
Problem p02694 (C++)

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

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  TEST(freopen("input.txt", "r", stdin));
  TEST(freopen("output.txt", "w", stdout));
  TEST(freopen("debug.txt", "w", stderr));
  long long X, c = 100;
  cin >> X;
  for (int i = 1;; i++) {
    c = c * 101 / 100;
    if (c >= X) {
      cout << i << '\n';
      break;
    }
  }
  return 0;
}

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

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  TEST(freopen("input.txt", "r", stdin));
  TEST(freopen("output.txt", "w", stdout));
  TEST(freopen("debug.txt", "w", stderr));
  long long X;
  __int128 c = 100;
  cin >> X;
  for (int i = 1;; i++) {
    c = c * 101 / 100;
    if (c >= X) {
      cout << i << '\n';
      break;
    }
  }
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;

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


Fixed submission:
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;

int main() {
  long long a;
  long long x = 100;
  int count = 0;
  cin >> a;
  while (x < a) {
    x *= 1.01;
    count++;
  }
  cout << count << endl;
  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;

  int64_t A = 100;
  int ans = 0;
  while (true) {
    A = (A * 101) / 100;
    ans++;

    if (A >= X) {
      break;
    }
  }

  cout << ans << endl;
}


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

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

  int64_t A = 100;
  int ans = 0;
  while (true) {
    A += A / 100;
    ans++;

    if (A >= X) {
      break;
    }
  }

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

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
// #define M 998244353
const int inf = 4e18;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int x;
  cin >> x;
  int c = 100, o = 0;
  while (c < x) {
    c = (101 * c) / 100;
    o++;
  }
  cout << o << endl;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
// #define M 998244353
const int inf = 4e18;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int x;
  cin >> x;
  int c = 100, o = 0;
  while (c < x) {
    c = ((double)101 / 100) * c;
    o++;
  }
  cout << o << endl;
}
Problem p02694 (C++)

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


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

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

int main() {
  // #ifndef ONLINE_JUDGE
  // 	freopen("input.txt","r",stdin);
  // 	freopen("output1.txt","w",stdout);
  // #endif

  long long int x;
  cin >> x;
  long long int ans = 100;
  long long int count = 0;
  while (ans != x) {
    ans += (ans / 100);
    count++;
  }
  cout << count << endl;
}


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

int main() {
  // #ifndef ONLINE_JUDGE
  // 	freopen("input.txt","r",stdin);
  // 	freopen("output1.txt","w",stdout);
  // #endif

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

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

using namespace std;

int main() {
  long long a;
  cin >> a;
  long long p = 100;
  int c = 0;
  while (p != a) {
    p = p + int(p / 100);
    c += 1;
  }
  cout << c;
  return 0;
}


Fixed submission:
#include <iostream>

using namespace std;

int main() {
  long long a;
  cin >> a;
  long long p = 100;
  int c = 0;
  while (p < a) {
    p = p + p / 100;
    c += 1;
  }
  cout << c;
  return 0;
}
Problem p02694 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;

int main() {

  int X;
  int M = 100;
  cin >> X;

  for (int year = 1; M <= X; year++) {
    M *= 1.01;
    // cout << year << " " << M << " " << X << endl;
    if (M >= X) {
      cout << year << endl;
      break;
    }
  }

  return 0;
}


Fixed submission:
#include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
using namespace std;

int main() {

  long X;
  long M = 100;
  cin >> X;

  for (int year = 1; M <= X; year++) {
    M *= 1.01;
    // cout << year << " " << M << " " << X << endl;
    if (M >= X) {
      cout << year << endl;
      break;
    }
  }

  return 0;
}
Problem p02694 (C++)

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

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

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

int main() {
  long long n = 100, x, m = 0;
  cin >> x;
  while (n < x) {
    n += n / 100;
    m++;
  }
  cout << m;
  return 0;
}
Problem p02694 (C++)

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


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

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

long long n, m;

int main() {
  int a = 100;
  cin >> n;
  if (n >= 1335850880) {
    a = 1335850880;
    int i = 0;
    while (a < n) {
      a = a + a * 0.01;
      i++;
    }
    cout << i + 1706;
    return 0;
  }
  int i = 0;
  while (a < n) {
    a = a + a * 0.01;
    i++;
  }
  cout << i;
  return 0;
}


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

long long n, m;

int main() {
  long long a = 100;
  cin >> n;
  if (n >= 1335850880) {
    a = 1335850880;
    int i = 0;
    while (a < n) {
      a = a + a * 0.01;
      i++;
    }
    cout << i + 1706;
    return 0;
  }
  int i = 0;
  while (a < n) {
    a = a + a * 0.01;
    i++;
  }
  cout << i;
  return 0;
}
Problem p02694 (C++)

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

int main() {
  int nowmoney = 100, x, year = 0;
  cin >> x;

  while (x > nowmoney) {
    nowmoney = nowmoney * 1.01;
    year++;
  }
  cout << year << endl;

  return 0;
}

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

int main() {
  unsigned long long int nowmoney = 100, x;
  int year = 0;
  cin >> x;

  while (x > nowmoney) {
    nowmoney = nowmoney * 1.01;
    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)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main(void) {
  int target;
  int b = 100;
  int cnt = 0;
  cin >> target;
  while (target > b) {
    b += b / 100;
    cnt++;
  }
  cout << cnt;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#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(void) {
  ll target;
  ll b = 100;
  int cnt = 0;
  cin >> target;
  while (target > b) {
    b += b / 100;
    cnt++;
  }
  cout << cnt;
  return 0;
}
Problem p02694 (C++)

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

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


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

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

Buggy submission (status: Time Limit Exceeded):
#include <iostream>
using namespace std;
int main() {
  unsigned long long x;
  cin >> x;
  unsigned long long c = 100;
  int i = 0;
  while (1) {
    i++;
    c *= 0.01;
    if (c >= x) {
      cout << i << endl;
      return 0;
    }
  }
  return 0;
}


Fixed submission:
#include <iostream>
using namespace std;
int main() {
  unsigned long long x;
  cin >> x;
  unsigned long long c = 100;
  int i = 0;
  while (1) {
    i++;
    c *= 1.01;
    if (c >= x) {
      cout << i << endl;
      return 0;
    }
  }
  return 0;
}
Problem p02694 (C++)

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

int main() {
  int x, yokin = 100, cnt = 0;
  cin >> x;
  while (x > yokin) {
    cnt++;
    yokin = (double)yokin * 1.01;
  }
  cout << cnt;
  return 0;
}

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

int main() {
  long x, yokin = 100, cnt = 0;
  cin >> x;
  while (x > yokin) {
    cnt++;
    yokin = (double)yokin * 1.01;
  }
  cout << cnt;
  return 0;
}
Problem p02694 (C++)

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

  long x;
  int a = 100, cnt = 0;
  cin >> x;

  while (1) {

    if (a >= x)
      break;

    a = a + (a * 0.01);
    cnt++;
  }

  cout << cnt << endl;
  return 0;
}

Fixed submission:
#include <iostream>
using namespace std;
int main(void) {

  long x, a = 100;
  int cnt = 0;
  cin >> x;

  while (1) {

    if (a >= x)
      break;

    a = a + (a * 0.01);
    cnt++;
  }

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

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;

// 解説ac

int main() {
  ll x;
  cin >> x;
  int y = 100;
  int i = 0;
  while (y < x) {
    y += y / 100;
    i++;
  }
  cout << i;
}

Fixed submission:
#include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;

// 解説ac

int main() {
  ll x;
  cin >> x;
  ll y = 100;
  ll i = 0;
  while (y < x) {
    y += y / 100;
    i++;
  }
  cout << i;
}