Problem p02717 (C++) — buggy submission, verdict: Runtime Error

// doaremon,squirtle is love
#include <bits/stdc++.h>
#define fast                                                                   \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define testcase                                                               \\
  ll t;                                                                        \\
  cin >> t;                                                                    \\
  while (t--)
#define input(x)                                                               \\
  ll x;                                                                        \\
  cin >> x;
#define output(x) cout << x << endl; // to print (-1)
#define inputarray()                                                           \\
  ll n;                                                                        \\
  cin >> n;                                                                    \\
  ll arr[n];                                                                   \\
  rep(0, n) cin >> arr[i];
#define deb(a) cout << " :: " << #a << " = " << a << endl
#define deb2(a, b)                                                             \\
  cout << " :: " << #a << " = " << a << " :: " << #b << " = " << b << endl
#define setbit(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define ub upper_bound // '>'
#define lb lower_bound // '>='
// erase,count,find,make_unique
#define len(arr) (sizeof(arr) / sizeof(arr[0]))
#define sz(x) ((long long)x.size())
#define make_unique(arr)                                                       \\
  arr.erase(unique(arr.begin(), arr.end()),                                    \\
            arr.end()) // Makes a sorted array unique
#define rep(a, b) for (int i = a; i < b; i++)
#define updiv(a, b) (ceil)((a) * (1.0) / (b))
#define printarray(arr)                                                        \\
  cout << "PRINT ARRAY" << endl;                                               \\
  rep(0, len(arr)) cout << arr[i] << " ";                                      \\
  cout << endl;
#define printvector(vect)                                                      \\
  cout << "PRINT VECTOR" << endl;                                              \\
  for (auto x : vect)                                                          \\
    cout << x << " ";                                                          \\
  cout << endl;
#define rev(x) reverse(all(x))
// LLONG_MAX, ULLONG_MAX INT_MAX
typedef long long int ll;
typedef unsigned long long int ull;
#define M 1000000007
using namespace std;
int main() {
  fast int a, b, c;
  cin >> a >> b >> c;
  cout << c << " " << a << " " << b << endl;
  return 0;
}


Error: WA

Fixed submission:

// doaremon,squirtle is love
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fast                                                                   \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define ff first
#define ss second
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define testcase                                                               \\
  ll t;                                                                        \\
  cin >> t;                                                                    \\
  while (t--)
#define in(x)                                                                  \\
  ll x;                                                                        \\
  cin >> x;
#define output(x) cout << x << endl; // to print (-1)
#define inputarray(arr, n)                                                     \\
  cin >> n;                                                                    \\
  ll arr[n];                                                                   \\
  rep(0, n) cin >> arr[i];
#define deb(a) cout << " :: " << #a << " = " << a << endl
#define deb2(a, b)                                                             \\
  cout << " :: " << #a << " = " << a << " :: " << #b << " = " << b << endl
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define pb push_back
#define mkp make_pair
#define all(x) (x.begin(), x.end())
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define ub upper_bound // '>'
#define lb lower_bound // '>='
// erase,count,find,make_unique
#define len(arr) (sizeof(arr) / sizeof(arr[0]))
#define sz(x) ((long long)x.size())
#define make_unique(arr)                                                       \\
  arr.erase(unique(arr.begin(), arr.end()),                                    \\
            arr.end()) // Makes a sorted array unique
#define int long long
#define frf for (ll i = 0; i < n; i++)
#define frr for (ll i = n - 1; i >= 0; i--)
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define updiv(a, b) (ceil)((a) * (1.0) / (b))
#define printarray(arr)                                                        \\
  cout << "PRINT ARRAY" << endl;                                               \\
  rep(0, len(arr)) cout << arr[i] << " ";                                      \\
  cout << endl;
#define printvector(vect)                                                      \\
  cout << "PRINT VECTOR" << endl;                                              \\
  for (auto x : vect)                                                          \\
    cout << x << " ";                                                          \\
  cout << endl;
#define rev(x) reverse(all(x))
#define gcd(m, n) __gcd(m, n)
#define insideloop(x)                                                          \\
  cout << x << " ";                                                            \\
  cout << endl;
#define set_mat(arr, rows, columns, val)                                       \\
  for (ll i = 0; i < rows; i++)                                                \\
    for (ll j = 0; j < columns; j++)                                           \\
      arr[i][j] = val;
#define take_mat(arr, rows, columns)                                           \\
  for (ll i = 0; i < rows; i++)                                                \\
    for (ll j = 0; j < columns; j++)                                           \\
      cin >> arr[i][j];
#define print_mat(arr, rows, columns)                                          \\
  for (ll i = 0; i < rows; i++) {                                              \\
    for (ll j = 0; j < columns; j++)                                           \\
      cout << arr[i][j] << " ";                                                \\
    cout << endl;                                                              \\
  }
#define inf 1e18
#define ps(n, points) cout << fixed << setprecision(points) << n << endl
// LLONG_MAX, ULLONG_MAX INT_MAX
typedef long long ll;
typedef unsigned long long ull;
#define M 1000000007
// #define endl '\\n'
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    pbds;
void cc() {
  fast
#ifndef ONLINE_JUDGE
      freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
  cc();
  int a, b, c;
  cin >> a >> b >> c;
  cout << c << " " << a << " " << b << endl;
  return 0;
}