Problem p02694 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long int
#define read(a)                                                                \\
  long long int a;                                                             \\
  cin >> a;
#define readstr(s)                                                             \\
  string s;                                                                    \\
  cin >> s;
#define readc(c)                                                               \\
  char c;                                                                      \\
  cin >> c;
#define readarr(a, l)                                                          \\
  long long int a[l] = {0};                                                    \\
  for (ll i = 0; i < l; i++)                                                   \\
    cin >> a[i];
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define rloop(i, a, b) for (ll i = a; i > b; i--)
#define loopchar() for (char c = 'a'; c <= 'z'; c++)
#define printarr(a, n)                                                         \\
  fori(i, 1, n) cout << a[i] << " ";                                           \\
  cout << endl;
#define printv(v)                                                              \\
  for (int i : v)                                                              \\
    cout << i << " ";                                                          \\
  cout << endl;
#define loopitr(vec) for (auto itr = vec.begin(); itr != vec.end(); itr++)
#define ff first
#define ss second
#define readmtrx(i, j, a, b)                                                   \\
  ll arr[a][b] = {0};                                                          \\
  for (ll i = 0; i < a; i++)                                                   \\
    for (ll j = 0; j < b; j++)                                                 \\
      cin >> arr[i][j];
#define all(a) a.begin(), a.end()
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define sc(x) cout << (#x) << " is " << (x) << endl;
#define fast                                                                   \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);
#define pb(p) push_back(p)
#define mp make_pair
#define fsort(vec) sort(vec.begin(), vec.end())
#define rsort(vec) sort(vec.begin(), vec.end(), compare)
#define Endl endl
#define ordered_set                                                            \\
  tree<int, null_type, less<int>, rb_tree_tag,                                 \\
       tree_order_statistics_node_update>
#define roundoff std::cout << std::setprecision(15)
#define inf 9223372036854775807
#define infn -9223372036854775807
#define pi 3.14159265358979323846
const int mod = 1e9 + 7;
#define intsize ll size = trunc(log10(num)) + 1
#define REVERSE(vec) reverse(vec.begin(), vec.end())
using namespace __gnu_pbds;
using namespace std;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

// code start from here

int main() {
  fast;
  read(x) ll sum = 100;
  ll a = 100;
  ll t = 0;
  while (a < x) {
    a = a * 1.01;
    t++;
  }
  cout << t;
  return 0;
}

// ends here

Error: TLE

Fixed submission:

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long int
#define read(a)                                                                \\
  long long int a;                                                             \\
  cin >> a;
#define readstr(s)                                                             \\
  string s;                                                                    \\
  cin >> s;
#define readc(c)                                                               \\
  char c;                                                                      \\
  cin >> c;
#define readarr(a, l)                                                          \\
  long long int a[l] = {0};                                                    \\
  for (ll i = 0; i < l; i++)                                                   \\
    cin >> a[i];
#define loop(i, a, b) for (ll i = a; i < b; i++)
#define rloop(i, a, b) for (ll i = a; i > b; i--)
#define loopchar() for (char c = 'a'; c <= 'z'; c++)
#define printarr(a, n)                                                         \\
  fori(i, 1, n) cout << a[i] << " ";                                           \\
  cout << endl;
#define printv(v)                                                              \\
  for (int i : v)                                                              \\
    cout << i << " ";                                                          \\
  cout << endl;
#define loopitr(vec) for (auto itr = vec.begin(); itr != vec.end(); itr++)
#define ff first
#define ss second
#define readmtrx(i, j, a, b)                                                   \\
  ll arr[a][b] = {0};                                                          \\
  for (ll i = 0; i < a; i++)                                                   \\
    for (ll j = 0; j < b; j++)                                                 \\
      cin >> arr[i][j];
#define all(a) a.begin(), a.end()
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define sc(x) cout << (#x) << " is " << (x) << endl;
#define fast                                                                   \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(0);
#define pb(p) push_back(p)
#define mp make_pair
#define fsort(vec) sort(vec.begin(), vec.end())
#define rsort(vec) sort(vec.begin(), vec.end(), compare)
#define Endl endl
#define ordered_set                                                            \\
  tree<int, null_type, less<int>, rb_tree_tag,                                 \\
       tree_order_statistics_node_update>
#define roundoff std::cout << std::setprecision(15)
#define inf 9223372036854775807
#define infn -9223372036854775807
#define pi 3.14159265358979323846
const int mod = 1e9 + 7;
#define intsize ll size = trunc(log10(num)) + 1
#define REVERSE(vec) reverse(vec.begin(), vec.end())
using namespace __gnu_pbds;
using namespace std;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

// code start from here

int main() {
  fast;
  read(x) ll sum = 100;
  ll a = 100;
  ll t = 0;
  while (a < x) {
    a = a * 101;
    a = a / 100;
    t++;
  }
  cout << t;
  return 0;
}

// ends here