Problem:
Score : 300 points

Problem Statement

1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:

the dogs numbered 1,2,\cdots,26 were respectively given the names a, b, ..., z;

the dogs numbered 27,28,29,\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;

the dogs numbered 703,704,705,\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;

the dogs numbered 18279,18280,18281,\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;

the dogs numbered 475255,475256,\cdots were respectively given the names aaaaa, aaaab, ...;

and so on.

To sum it up, the dogs numbered 1, 2, \cdots were respectively given the following names:

a, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...

Now, Roger asks you:

"What is the name for the dog numbered N?"

Constraints

N is an integer.

1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer to Roger's question as a string consisting of lowercase English letters.

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)


import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
import java.lang.*;

import static java.lang.Character.isUpperCase;

public class Main {
    public static Scanner key = new Scanner(System.in);
    public static void solveJuice()
    {
        int n = key.nextInt();
        int k = key.nextInt();
        int[] f = new int[n];
        for(int i = 0;i <= n-1;i++)
            f[i] = key.nextInt();
        Arrays.sort(f,0,n);
        int sum = 0;
        for(int j =0;j <= k-1;j++)
        {
            sum += f[j];
        }
        System.out.println(sum);
    }

    /*public static void redScarf()
    {

    }
    */
    public static String reverseString(String str){
        StringBuilder sb=new StringBuilder(str);
        sb.reverse();
        return sb.toString();
    }
    public static void solveC()
    {
        long N = key.nextLong();
        String ans = "";
        while(N > 1)
        {
            if(N%26 == 0)
                ans += 'z';
            else
            {
                char c = (char)(96 + N%26);
                ans += c;
            }

            N /= 26;
        }
        ans = reverseString(ans);
        System.out.println(ans);
    }
    public static void replacing()
    {
        int N = key.nextInt();
        int[] A = new int[N];
        HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
        long sum = 0;
        for(int i = 0;i <= N - 1;i++) {
            A[i] = key.nextInt();
            map.put(A[i],map.getOrDefault(A[i],0) + 1);
            sum += A[i];
        }
        int q = key.nextInt();
        while(q > 0)
        {
            q--;
            int a = key.nextInt();
            int b = key.nextInt();
            if(map.containsKey(a))
            {
                sum += (b-a)*map.get(a);
                int c = map.get(a);
                map.remove(a);
                map.put(b,map.getOrDefault(b,0)+c);
                System.out.println(sum);
            }
            else
                System.out.println(sum);
        }
    }

    public static void main(String[] args)
    {
       /* solveJuice();*/
        //replacing();
        solveC();
    }
}