Submission #1000837

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>

using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); }
int bsr(int x) { return 31 - __builtin_clz(x); }

string S = "FESTIVAL";
const int BS = 9;
const int BN = 1<<BS;

ll calc(string s) {
    ll d[9] = {};
    d[0] = 1;
    for (char c: s) {
        int p = -1;
        for (int i = 0; i < 8; i++) {
            if (c == S[i]) {
                p = i;
                break;
            }
        }
        if (p == -1) continue;
        d[p+1] += d[p];
//        for (int i = 0; i <= 8; i++) {
//            cout << d[i] << ", ";
//        } cout << endl;
    }
    return d[8];
}
int main() {
    ios::sync_with_stdio(0);
    cout << setprecision(20);
    ll k;
    cin >> k;

    string s = "FESTIVA";
    // 1,1,1...1

    ll sm = 0;
    for (int i = 0; i < 7; i++) {
        ll u = k % BN;
        s += string(u, S[7]); // use
        k /= BN;
        //x256
        if (i == 6) break;
        for (int fe = 0; fe < BS; fe++) {
            for (int j = 6; j >= i+1; j--) {
                s += S[j];
            }
            ll c = 1<<(fe+1);
            c -= 1<<fe;
            s += string(c, S[i]);
        }
    }
//    cout << sm << endl;
//    cout << s.size() << endl;
    cout << s << endl;
//    cout << calc(s) << endl;
    return 0;
}

Submission Info

Judge Result