For this Question: You are given a sequence of 26 integers P=(P<sub>1</sub>, P<sub>2</sub>, …, P<sub>26</sub> ) consisting of integers from 1 through 26. It is guaranteed that all elements in P are distinct.

Print a string S of length 26 that satisfies the following condition. For every i (1&le;i&le;26), the i- th character of S is the lowercase English letter that comes P<sub>i</sub>- th in alphabetical order.The input contains 26 space separated integers as follows:
P<sub>1</sub> P<sub>2</sub>. . P<sub>26</sub>

<b>Constraints</b>
1&le;P<sub>i</sub>&le;26
All values in input are integers.Print the string S.<b>Sample Input 1</b> 
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
<b>Sample Output 1</b> 
abcdefghijklmnopqrstuvwxyz

<b>Sample Input 2</b> 
2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
<b>Sample Output 2</b> 
bacdefghijklmnopqrstuvwxyz

<b>Sample Input 3</b> 
5 11 12 16 25 17 18 1 7 10 4 23 20 3 2 24 26 19 14 9 6 22 8 13 15 21
<b>Sample Output 3</b> 
eklpyqragjdwtcbxzsnifvhmou, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
    string ans;
    for(int i = 0; i < 26; i++){
        int p; cin >> p; p--;
        ans += (char)('a'+p);
    }
    cout << ans << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?