Submission #68901311

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
#define endl '\n'
using db = double;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

LL calc(LL x)
{
    auto s = to_string(x);
    reverse(s.begin(), s.end());
    return stoll(s.substr());
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<LL> a(14);
    cin >> a[1] >> a[2];
    for (int i = 3; i <= 10; ++i)
    {
        a[i] = calc(a[i - 1] + a[i - 2]);
    }
    cout << a[10] << endl;
    return 0;
}

Submission Info

Judge Result