Submission #28416152

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <algorithm>
#include <math.h>
#include <climits>
typedef long long LL;
using namespace std;

string func(LL K)
{
    LL Kdash = K + 1;
    LL nDigit = 0;
    LL currentP = 0;
    while (true)
    {
        if (pow(2, currentP) > K)
        {
            nDigit = currentP;
            break;
        }
        currentP++;
    }

    string reversed;
    for (LL i = 0; i < nDigit; ++i)
    {
        LL n = pow(2, i + 1);
        LL amari = (Kdash - 1) % n;
        if (amari < (n / 2))
        {
            reversed.push_back('0');
        }
        else
        {
            reversed.push_back('2');
        }
    }

    string result;
    for (LL i = reversed.size()-1; i >= 0; --i)
    {
        cout << reversed[i];
    }
    cout << endl;
    return result;
}
int main()
{
    LL K = 0;
    cin >> K;

    func(K);
    //cout << func(K) << endl;

   /* for (LL i = 1; i < 12; ++i)
    {
        cout << func(i) << endl;
    }*/
}

Submission Info

Judge Result