Language: C++

#include <iostream>
#include <utility>
#include <vector>
#include <list>
#include <unordered_set>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <stdlib.h>
#include <stdio.h>
#include <fstream>
#include <tuple>

//....................................................................................................................//

using std::cin;
using std::cout;
using std::vector;
using std::list;
using std::unordered_set;
using std::set;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::pair;
using std::make_pair;
using std::min;
using std::max;
using std::swap;
using std::stack;
using std::deque;
using std::queue;
using std::ios_base;
using std::ifstream;
using std::ofstream;
using std::string;
using std::tuple;
using std::make_tuple;
using std::get;
using std::upper_bound;
using std::lower_bound;
using std::max_element;
using std::min_element;
using std::multiset;
using std::greater;
using std::priority_queue;
using std::less;

//....................................................................................................................//

typedef long long ll;
typedef unsigned long long ull;

[[maybe_unused]] const string endl = "\n";
[[maybe_unused]] const string sep = " ";
[[maybe_unused]] const string yes = "YES\n";
[[maybe_unused]] const string no = "NO\n";
[[maybe_unused]] const string ng = "NG\n";
[[maybe_unused]] const string ok = "OK\n";
[[maybe_unused]] const double pi = acos(-1);
[[maybe_unused]] const ull modular = 1e9 + 7;

//....................................................................................................................//

template<class T>
T min(const T &a, const T &b, const T &c) {
    return min(a, min(b, c));
}

template<class T>
T max(const T &a, const T &b, const T &c) {
    return max(a, max(b, c));
}

typedef vector<vector<ll>> graph;

vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
vector<char> lca_dfs_used;

void lca_dfs(const graph &g, ll v, ll h = 1) {
    lca_dfs_used[v] = true;
    lca_h[v] = h;
    lca_dfs_list.push_back(v);
    for (auto i = g[v].begin(); i != g[v].end(); ++i)
        if (!lca_dfs_used[*i]) {
            lca_dfs(g, *i, h + 1);
            lca_dfs_list.push_back(v);
        }
}

void lca_build_tree(ll i, ll l, ll r) {
    if (l == r)
        lca_tree[i] = lca_dfs_list[l];
    else {
        ll m = (l + r) >> 1;
        lca_build_tree(i + i, l, m);
        lca_build_tree(i + i + 1, m + 1, r);
        if (lca_h[lca_tree[i + i]] < lca_h[lca_tree[i + i + 1]])
            lca_tree[i] = lca_tree[i + i];
        else
            lca_tree[i] = lca_tree[i + i + 1];
    }
}

void lca_prepare(const graph &g, ll root) {
    ll n = (ll) g.size();
    lca_h.resize(n);
    lca_dfs_list.reserve(n * 2);
    lca_dfs_used.assign(n, 0);

    lca_dfs(g, root);

    ll m = (ll) lca_dfs_list.size();
    lca_tree.assign(lca_dfs_list.size() * 4 + 1, -1);
    lca_build_tree(1, 0, m - 1);

    lca_first.assign(n, -1);
    for (ll i = 0; i < m; ++i) {
        ll v = lca_dfs_list[i];
        if (lca_first[v] == -1)
            lca_first[v] = i;
    }
}

ll lca_tree_min(ll i, ll sl, ll sr, ll l, ll r) {
    if (sl == l && sr == r)
        return lca_tree[i];
    ll sm = (sl + sr) >> 1;
    if (r <= sm)
        return lca_tree_min(i + i, sl, sm, l, r);
    if (l > sm)
        return lca_tree_min(i + i + 1, sm + 1, sr, l, r);
    ll ans1 = lca_tree_min(i + i, sl, sm, l, sm);
    ll ans2 = lca_tree_min(i + i + 1, sm + 1, sr, sm + 1, r);
    return lca_h[ans1] < lca_h[ans2] ? ans1 : ans2;
}

ll lca(ll a, ll b) {
    ll left = lca_first[a],
            right = lca_first[b];
    if (left > right) swap(left, right);
    return lca_tree_min(1, 0, (ll) lca_dfs_list.size() - 1, left, right);
}


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

ll fast_power(ll a, ll pow) {
    if (pow == 0) {
        return 1;
    }
    if (pow % 2 == 0) {
        auto x = fast_power(a, pow / 2);
        return (x * x);
    } else {
        auto x = fast_power(a, pow - 1);
        return (a * x);
    }
}

ll fast_power(ll a, ll pow, ll mod) {
    if (pow == 0) {
        return 1;
    }
    if (pow % 2 == 0) {
        auto x = fast_power(a, pow / 2, mod);
        return (x * x) % mod;
    } else {
        auto x = fast_power(a, pow - 1, mod);
        return (a * x) % mod;
    }

}

void getFactorialsModular(const ll n, const ll mod, vector<ll> &F) {
    F.resize(n + 1);
    F[0] = 1;
    for (ll i = 1; i <= n; ++i) {
        F[i] = (F[i - 1] * i) % mod;
    }
}

void getFactorialsAndInverseModular(const ll n, const ll mod, vector<ll> &F, vector<ll> &I) {
    getFactorialsModular(n, mod, F);
    I.resize(n + 1);
    I[0] = 1;
    for (ll i = 1; i <= n; ++i) {
        I[i] = fast_power(F[i], mod - 2, mod);
    }
}

ll CnkMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
    return (((F[n] * I[k]) % mod) * I[n - k]) % mod;
}

ll CnkWithRepetitionMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
    return CnkMod(n + k - 1, k - 1, mod, F, I);
}

/*
MIT License
Copyright (c) 2019 ouuan
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/

// for further information and bug tracking,
// please visit https://github.com/ouuan/segmentTree


template<typename valueType, typename tagType>
class segmentTreeNode {
public:
    int id, left, right;
    valueType val;
    tagType tag;
};

template<typename valueType,
        typename tagType,
        valueType (*merge)(valueType, valueType),
        void (*update)(segmentTreeNode<valueType, tagType> &, tagType)>
class segmentTree {
private:
    std::vector<segmentTreeNode<valueType, tagType> > nodes;
    int leftRange, rightRange;
    valueType valueZero;
    tagType tagZero;

    void push_up(int cur) {
        nodes[cur].val = merge(nodes[cur << 1].val, nodes[cur << 1 | 1].val);
    }

    void push_down(int cur) {
        update(nodes[cur << 1], nodes[cur].tag);
        update(nodes[cur << 1 | 1], nodes[cur].tag);
        nodes[cur].tag = tagZero;
    }

    void build(int cur, int l, int r, const std::vector<valueType> &initValue) {
        nodes[cur].id = cur;
        nodes[cur].left = l;
        nodes[cur].right = r;
        nodes[cur].tag = tagZero;
        if (l == r - 1) nodes[cur].val = initValue[l - leftRange];
        else {
            build(cur << 1, l, (l + r) >> 1, initValue);
            build(cur << 1 | 1, (l + r) >> 1, r, initValue);
            push_up(cur);
        }
    }

    void init(const std::vector<valueType> &_initValue,
              const valueType &_valueZero,
              const tagType &_tagZero) {
        valueZero = _valueZero;
        tagZero = _tagZero;
        nodes.resize((rightRange - leftRange) << 2);
        build(1, leftRange, rightRange, _initValue);
    }

    void modify(int cur, int l, int r, int L, int R, const tagType &tag) {
        if (l >= R || r <= L) return;
        if (L <= l && r <= R) update(nodes[cur], tag);
        else {
            push_down(cur);
            modify(cur << 1, l, (l + r) >> 1, L, R, tag);
            modify(cur << 1 | 1, (l + r) >> 1, r, L, R, tag);
            push_up(cur);
        }
    }

    valueType query(int cur, int l, int r, int L, int R) {
        if (l >= R || r <= L) return valueZero;
        if (L <= l && r <= R) return nodes[cur].val;
        push_down(cur);
        return merge(query(cur << 1, l, (l + r) >> 1, L, R),
                     query(cur << 1 | 1, (l + r) >> 1, r, L, R));
    }

public:
    segmentTree() {}

    segmentTree(int _leftRange,
                int _rightRange,
                const std::vector<valueType> &_initValue,
                const valueType &_valueZero,
                const tagType &_tagZero) {
        leftRange = _leftRange;
        rightRange = _rightRange;
        init(_initValue, _valueZero, _tagZero);
    }

    segmentTree(int size,
                const std::vector<valueType> &_initValue,
                const valueType &_valueZero,
                const tagType &_tagZero) {
        leftRange = 1;
        rightRange = size + 1;
        init(_initValue, _valueZero, _tagZero);
    }

    void modify(int l, int r, const tagType &tag) {
        modify(1, leftRange, rightRange, l, r, tag);
    }

    void modify(int p, const tagType &tag) {
        modify(p, p + 1, tag);
    }

    valueType query(int l, int r) {
        return query(1, leftRange, rightRange, l, r);
    }

    valueType query(int p) {
        return query(p, p + 1);
    }
};

int main() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    cout.precision(15);
    ll a; 
    double  b;
    cin >> a >> b;
    cout << ll(a * b);
}
#include <iostream>
#include <utility>
#include <vector>
#include <list>
#include <unordered_set>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <stdlib.h>
#include <stdio.h>
#include <fstream>
#include <tuple>

//....................................................................................................................//

using std::cin;
using std::cout;
using std::vector;
using std::list;
using std::unordered_set;
using std::set;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::pair;
using std::make_pair;
using std::min;
using std::max;
using std::swap;
using std::stack;
using std::deque;
using std::queue;
using std::ios_base;
using std::ifstream;
using std::ofstream;
using std::string;
using std::tuple;
using std::make_tuple;
using std::get;
using std::upper_bound;
using std::lower_bound;
using std::max_element;
using std::min_element;
using std::multiset;
using std::greater;
using std::priority_queue;
using std::less;

//....................................................................................................................//

typedef long long ll;
typedef unsigned long long ull;

[[maybe_unused]] const string endl = "\n";
[[maybe_unused]] const string sep = " ";
[[maybe_unused]] const string yes = "YES\n";
[[maybe_unused]] const string no = "NO\n";
[[maybe_unused]] const string ng = "NG\n";
[[maybe_unused]] const string ok = "OK\n";
[[maybe_unused]] const double pi = acos(-1);
[[maybe_unused]] const ull modular = 1e9 + 7;

//....................................................................................................................//

template<class T>
T min(const T &a, const T &b, const T &c) {
    return min(a, min(b, c));
}

template<class T>
T max(const T &a, const T &b, const T &c) {
    return max(a, max(b, c));
}

typedef vector<vector<ll>> graph;

vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
vector<char> lca_dfs_used;

void lca_dfs(const graph &g, ll v, ll h = 1) {
    lca_dfs_used[v] = true;
    lca_h[v] = h;
    lca_dfs_list.push_back(v);
    for (auto i = g[v].begin(); i != g[v].end(); ++i)
        if (!lca_dfs_used[*i]) {
            lca_dfs(g, *i, h + 1);
            lca_dfs_list.push_back(v);
        }
}

void lca_build_tree(ll i, ll l, ll r) {
    if (l == r)
        lca_tree[i] = lca_dfs_list[l];
    else {
        ll m = (l + r) >> 1;
        lca_build_tree(i + i, l, m);
        lca_build_tree(i + i + 1, m + 1, r);
        if (lca_h[lca_tree[i + i]] < lca_h[lca_tree[i + i + 1]])
            lca_tree[i] = lca_tree[i + i];
        else
            lca_tree[i] = lca_tree[i + i + 1];
    }
}

void lca_prepare(const graph &g, ll root) {
    ll n = (ll) g.size();
    lca_h.resize(n);
    lca_dfs_list.reserve(n * 2);
    lca_dfs_used.assign(n, 0);

    lca_dfs(g, root);

    ll m = (ll) lca_dfs_list.size();
    lca_tree.assign(lca_dfs_list.size() * 4 + 1, -1);
    lca_build_tree(1, 0, m - 1);

    lca_first.assign(n, -1);
    for (ll i = 0; i < m; ++i) {
        ll v = lca_dfs_list[i];
        if (lca_first[v] == -1)
            lca_first[v] = i;
    }
}

ll lca_tree_min(ll i, ll sl, ll sr, ll l, ll r) {
    if (sl == l && sr == r)
        return lca_tree[i];
    ll sm = (sl + sr) >> 1;
    if (r <= sm)
        return lca_tree_min(i + i, sl, sm, l, r);
    if (l > sm)
        return lca_tree_min(i + i + 1, sm + 1, sr, l, r);
    ll ans1 = lca_tree_min(i + i, sl, sm, l, sm);
    ll ans2 = lca_tree_min(i + i + 1, sm + 1, sr, sm + 1, r);
    return lca_h[ans1] < lca_h[ans2] ? ans1 : ans2;
}

ll lca(ll a, ll b) {
    ll left = lca_first[a],
            right = lca_first[b];
    if (left > right) swap(left, right);
    return lca_tree_min(1, 0, (ll) lca_dfs_list.size() - 1, left, right);
}


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

ll fast_power(ll a, ll pow) {
    if (pow == 0) {
        return 1;
    }
    if (pow % 2 == 0) {
        auto x = fast_power(a, pow / 2);
        return (x * x);
    } else {
        auto x = fast_power(a, pow - 1);
        return (a * x);
    }
}

ll fast_power(ll a, ll pow, ll mod) {
    if (pow == 0) {
        return 1;
    }
    if (pow % 2 == 0) {
        auto x = fast_power(a, pow / 2, mod);
        return (x * x) % mod;
    } else {
        auto x = fast_power(a, pow - 1, mod);
        return (a * x) % mod;
    }

}

void getFactorialsModular(const ll n, const ll mod, vector<ll> &F) {
    F.resize(n + 1);
    F[0] = 1;
    for (ll i = 1; i <= n; ++i) {
        F[i] = (F[i - 1] * i) % mod;
    }
}

void getFactorialsAndInverseModular(const ll n, const ll mod, vector<ll> &F, vector<ll> &I) {
    getFactorialsModular(n, mod, F);
    I.resize(n + 1);
    I[0] = 1;
    for (ll i = 1; i <= n; ++i) {
        I[i] = fast_power(F[i], mod - 2, mod);
    }
}

ll CnkMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
    return (((F[n] * I[k]) % mod) * I[n - k]) % mod;
}

ll CnkWithRepetitionMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
    return CnkMod(n + k - 1, k - 1, mod, F, I);
}

/*
MIT License
Copyright (c) 2019 ouuan
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/

// for further information and bug tracking,
// please visit https://github.com/ouuan/segmentTree


template<typename valueType, typename tagType>
class segmentTreeNode {
public:
    int id, left, right;
    valueType val;
    tagType tag;
};

template<typename valueType,
        typename tagType,
        valueType (*merge)(valueType, valueType),
        void (*update)(segmentTreeNode<valueType, tagType> &, tagType)>
class segmentTree {
private:
    std::vector<segmentTreeNode<valueType, tagType> > nodes;
    int leftRange, rightRange;
    valueType valueZero;
    tagType tagZero;

    void push_up(int cur) {
        nodes[cur].val = merge(nodes[cur << 1].val, nodes[cur << 1 | 1].val);
    }

    void push_down(int cur) {
        update(nodes[cur << 1], nodes[cur].tag);
        update(nodes[cur << 1 | 1], nodes[cur].tag);
        nodes[cur].tag = tagZero;
    }

    void build(int cur, int l, int r, const std::vector<valueType> &initValue) {
        nodes[cur].id = cur;
        nodes[cur].left = l;
        nodes[cur].right = r;
        nodes[cur].tag = tagZero;
        if (l == r - 1) nodes[cur].val = initValue[l - leftRange];
        else {
            build(cur << 1, l, (l + r) >> 1, initValue);
            build(cur << 1 | 1, (l + r) >> 1, r, initValue);
            push_up(cur);
        }
    }

    void init(const std::vector<valueType> &_initValue,
              const valueType &_valueZero,
              const tagType &_tagZero) {
        valueZero = _valueZero;
        tagZero = _tagZero;
        nodes.resize((rightRange - leftRange) << 2);
        build(1, leftRange, rightRange, _initValue);
    }

    void modify(int cur, int l, int r, int L, int R, const tagType &tag) {
        if (l >= R || r <= L) return;
        if (L <= l && r <= R) update(nodes[cur], tag);
        else {
            push_down(cur);
            modify(cur << 1, l, (l + r) >> 1, L, R, tag);
            modify(cur << 1 | 1, (l + r) >> 1, r, L, R, tag);
            push_up(cur);
        }
    }

    valueType query(int cur, int l, int r, int L, int R) {
        if (l >= R || r <= L) return valueZero;
        if (L <= l && r <= R) return nodes[cur].val;
        push_down(cur);
        return merge(query(cur << 1, l, (l + r) >> 1, L, R),
                     query(cur << 1 | 1, (l + r) >> 1, r, L, R));
    }

public:
    segmentTree() {}

    segmentTree(int _leftRange,
                int _rightRange,
                const std::vector<valueType> &_initValue,
                const valueType &_valueZero,
                const tagType &_tagZero) {
        leftRange = _leftRange;
        rightRange = _rightRange;
        init(_initValue, _valueZero, _tagZero);
    }

    segmentTree(int size,
                const std::vector<valueType> &_initValue,
                const valueType &_valueZero,
                const tagType &_tagZero) {
        leftRange = 1;
        rightRange = size + 1;
        init(_initValue, _valueZero, _tagZero);
    }

    void modify(int l, int r, const tagType &tag) {
        modify(1, leftRange, rightRange, l, r, tag);
    }

    void modify(int p, const tagType &tag) {
        modify(p, p + 1, tag);
    }

    valueType query(int l, int r) {
        return query(1, leftRange, rightRange, l, r);
    }

    valueType query(int p) {
        return query(p, p + 1);
    }
};

int main() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    cout.precision(15);
    ll a; 
    double  b;
    cin >> a >> b;
    cout << ll(a * b);
}


Compiler output:
a.cc:413:31: error: redefinition of 'const std::string endl'
  413 | [[maybe_unused]] const string endl = "\n";
      |                               ^~~~
a.cc:60:31: note: 'const std::string endl' previously declared here
   60 | [[maybe_unused]] const string endl = "\n";
      |                               ^~~~
a.cc:414:31: error: redefinition of 'const std::string sep'
  414 | [[maybe_unused]] const string sep = " ";
      |                               ^~~
a.cc:61:31: note: 'const std::string sep' previously declared here
   61 | [[maybe_unused]] const string sep = " ";
      |                               ^~~
a.cc:415:31: error: redefinition of 'const std::string yes'
  415 | [[maybe_unused]] const string yes = "YES\n";
      |                               ^~~
a.cc:62:31: note: 'const std::string yes' previously declared here
   62 | [[maybe_unused]] const string yes = "YES\n";
      |                               ^~~
a.cc:416:31: error: redefinition of 'const std::string no'
  416 | [[maybe_unused]] const string no = "NO\n";
      |                               ^~
a.cc:63:31: note: 'const std::string no' previously declared here
   63 | [[maybe_unused]] const string no = "NO\n";
      |                               ^~
a.cc:417:31: error: redefinition of 'const std::string ng'
  417 | [[maybe_unused]] const string ng = "NG\n";
      |                               ^~
a.cc:64:31: note: 'const std::string ng' previously declared here
   64 | [[maybe_unused]] const string ng = "NG\n";
      |                               ^~
a.cc:418:31: error: redefinition of 'const std::string ok'
  418 | [[maybe_unused]] const string ok = "OK\n";
      |                               ^~
a.cc:65:31: note: 'const std::string ok' previously declared here
   65 | [[maybe_unused]] const string ok = "OK\n";
      |                               ^~
a.cc:419:31: error: redefinition of 'const double pi'
  419 | [[maybe_unused]] const double pi = acos(-1);
      |                               ^~
a.cc:66:31: note: 'const double pi' previously defined here
   66 | [[maybe_unused]] const double pi = acos(-1);
      |                               ^~
a.cc:420:28: error: redefinition of 'const ull modular'
  420 | [[maybe_unused]] const ull modular = 1e9 + 7;
      |                            ^~~~~~~
a.cc:67:28: note: 'const ull modular' previously defined here
   67 | [[maybe_unused]] const ull modular = 1e9 + 7;
      |                            ^~~~~~~
a.cc:425:3: error: redefinition of 'template<class T> T min(const T&, const T&, const T&)'
  425 | T min(const T &a, const T &b, const T &c) {
      |   ^~~
a.cc:72:3: note: 'template<class T> T min(const T&, const T&, const T&)' previously declared here
   72 | T min(const T &a, const T &b, const T &c) {
      |   ^~~
a.cc:430:3: error: redefinition of 'template<class T> T max(const T&, const T&, const T&)'
  430 | T max(const T &a, const T &b, const T &c) {
      |   ^~~
a.cc:77:3: note: 'template<class T> T max(const T&, const T&, const T&)' previously declared here
   77 | T max(const T &a, const T &b, const T &c) {
      |   ^~~
a.cc:436:12: error: redefinition of 'std::vector<long long int> lca_h'
  436 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |            ^~~~~
a.cc:83:12: note: 'std::vector<long long int> lca_h' previously declared here
   83 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |            ^~~~~
a.cc:436:19: error: redefinition of 'std::vector<long long int> lca_dfs_list'
  436 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |                   ^~~~~~~~~~~~
a.cc:83:19: note: 'std::vector<long long int> lca_dfs_list' previously declared here
   83 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |                   ^~~~~~~~~~~~
a.cc:436:33: error: redefinition of 'std::vector<long long int> lca_first'
  436 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |                                 ^~~~~~~~~
a.cc:83:33: note: 'std::vector<long long int> lca_first' previously declared here
   83 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |                                 ^~~~~~~~~
a.cc:436:44: error: redefinition of 'std::vector<long long int> lca_tree'
  436 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |                                            ^~~~~~~~
a.cc:83:44: note: 'std::vector<long long int> lca_tree' previously declared here
   83 | vector<ll> lca_h, lca_dfs_list, lca_first, lca_tree;
      |                                            ^~~~~~~~
a.cc:437:14: error: redefinition of 'std::vector<char> lca_dfs_used'
  437 | vector<char> lca_dfs_used;
      |              ^~~~~~~~~~~~
a.cc:84:14: note: 'std::vector<char> lca_dfs_used' previously declared here
   84 | vector<char> lca_dfs_used;
      |              ^~~~~~~~~~~~
a.cc:439:6: error: redefinition of 'void lca_dfs(const graph&, ll, ll)'
  439 | void lca_dfs(const graph &g, ll v, ll h = 1) {
      |      ^~~~~~~
a.cc:86:6: note: 'void lca_dfs(const graph&, ll, ll)' previously defined here
   86 | void lca_dfs(const graph &g, ll v, ll h = 1) {
      |      ^~~~~~~
a.cc:450:6: error: redefinition of 'void lca_build_tree(ll, ll, ll)'
  450 | void lca_build_tree(ll i, ll l, ll r) {
      |      ^~~~~~~~~~~~~~
a.cc:97:6: note: 'void lca_build_tree(ll, ll, ll)' previously defined here
   97 | void lca_build_tree(ll i, ll l, ll r) {
      |      ^~~~~~~~~~~~~~
a.cc:464:6: error: redefinition of 'void lca_prepare(const graph&, ll)'
  464 | void lca_prepare(const graph &g, ll root) {
      |      ^~~~~~~~~~~
a.cc:111:6: note: 'void lca_prepare(const graph&, ll)' previously defined here
  111 | void lca_prepare(const graph &g, ll root) {
      |      ^~~~~~~~~~~
a.cc:484:4: error: redefinition of 'll lca_tree_min(ll, ll, ll, ll, ll)'
  484 | ll lca_tree_min(ll i, ll sl, ll sr, ll l, ll r) {
      |    ^~~~~~~~~~~~
a.cc:131:4: note: 'll lca_tree_min(ll, ll, ll, ll, ll)' previously defined here
  131 | ll lca_tree_min(ll i, ll sl, ll sr, ll l, ll r) {
      |    ^~~~~~~~~~~~
a.cc:497:4: error: redefinition of 'll lca(ll, ll)'
  497 | ll lca(ll a, ll b) {
      |    ^~~
a.cc:144:4: note: 'll lca(ll, ll)' previously defined here
  144 | ll lca(ll a, ll b) {
      |    ^~~
a.cc:505:4: error: redefinition of 'll gcd(ll, ll)'
  505 | ll gcd(ll a, ll b) {
      |    ^~~
a.cc:152:4: note: 'll gcd(ll, ll)' previously defined here
  152 | ll gcd(ll a, ll b) {
      |    ^~~
a.cc:512:4: error: redefinition of 'll fast_power(ll, ll)'
  512 | ll fast_power(ll a, ll pow) {
      |    ^~~~~~~~~~
a.cc:159:4: note: 'll fast_power(ll, ll)' previously defined here
  159 | ll fast_power(ll a, ll pow) {
      |    ^~~~~~~~~~
a.cc:525:4: error: redefinition of 'll fast_power(ll, ll, ll)'
  525 | ll fast_power(ll a, ll pow, ll mod) {
      |    ^~~~~~~~~~
a.cc:172:4: note: 'll fast_power(ll, ll, ll)' previously defined here
  172 | ll fast_power(ll a, ll pow, ll mod) {
      |    ^~~~~~~~~~
a.cc:539:6: error: redefinition of 'void getFactorialsModular(ll, ll, std::vector<long long int>&)'
  539 | void getFactorialsModular(const ll n, const ll mod, vector<ll> &F) {
      |      ^~~~~~~~~~~~~~~~~~~~
a.cc:186:6: note: 'void getFactorialsModular(ll, ll, std::vector<long long int>&)' previously defined here
  186 | void getFactorialsModular(const ll n, const ll mod, vector<ll> &F) {
      |      ^~~~~~~~~~~~~~~~~~~~
a.cc:547:6: error: redefinition of 'void getFactorialsAndInverseModular(ll, ll, std::vector<long long int>&, std::vector<long long int>&)'
  547 | void getFactorialsAndInverseModular(const ll n, const ll mod, vector<ll> &F, vector<ll> &I) {
      |      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:194:6: note: 'void getFactorialsAndInverseModular(ll, ll, std::vector<long long int>&, std::vector<long long int>&)' previously defined here
  194 | void getFactorialsAndInverseModular(const ll n, const ll mod, vector<ll> &F, vector<ll> &I) {
      |      ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:556:4: error: redefinition of 'll CnkMod(ll, ll, ll, std::vector<long long int>&, std::vector<long long int>&)'
  556 | ll CnkMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
      |    ^~~~~~
a.cc:203:4: note: 'll CnkMod(ll, ll, ll, std::vector<long long int>&, std::vector<long long int>&)' previously defined here
  203 | ll CnkMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
      |    ^~~~~~
a.cc:560:4: error: redefinition of 'll CnkWithRepetitionMod(ll, ll, ll, std::vector<long long int>&, std::vector<long long int>&)'
  560 | ll CnkWithRepetitionMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
      |    ^~~~~~~~~~~~~~~~~~~~
a.cc:207:4: note: 'll CnkWithRepetitionMod(ll, ll, ll, std::vector<long long int>&, std::vector<long long int>&)' previously defined here
  207 | ll CnkWithRepetitionMod(ll n, ll k, ll mod, vector<ll> &F, vector<ll> &I) {
      |    ^~~~~~~~~~~~~~~~~~~~
a.cc:589:7: error: redefinition of 'class segmentTreeNode<valueType, tagType>'
  589 | class segmentTreeNode {
      |       ^~~~~~~~~~~~~~~
a.cc:236:7: note: previous definition of 'class segmentTreeNode<valueType, tagType>'
  236 | class segmentTreeNode {
      |       ^~~~~~~~~~~~~~~
a.cc:600:7: error: redefinition of 'class segmentTree<valueType, tagType, merge, update>'
  600 | class segmentTree {
      |       ^~~~~~~~~~~
a.cc:247:7: note: previous definition of 'class segmentTree<valueType, tagType, merge, update>'
  247 | class segmentTree {
      |       ^~~~~~~~~~~
a.cc:697:5: error: redefinition of 'int main()'
  697 | int main() {
      |     ^~~~
a.cc:344:5: note: 'int main()' previously defined here
  344 | int main() {
      |     ^~~~