Submission #17714849

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<int>>;


int main()
{

  ll n;
  cin >> n;

  ll a = 26;
  ll count = 1;
  REP(i,15){
    if(n<=a){
      break;
    }else{
      n -= a;
      a *= 26;
      count++;
    }
  }

  vector<int> answer(count,0);
  n--;
  count--;

  for(int i=count; i>=0; i--){
    ll keta = pow(26,i);
    answer.at(i) = n/keta;
    n = n%keta;
  }

  for(int i=count; i>=0; i--){
    char c = 'a'+ answer.at(i);
    cout << c;
  }
  cout << endl;


}

Submission Info

Judge Result