B. K-th Beautiful String

B. K-th Beautiful String
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
For the given integer n (n>2) let’s write down all the strings of length n which contain n−2 letters ‘a’ and two letters ‘b’ in lexicographical (alphabetical) order.

Recall that the string s of length n is lexicographically less than string t of length n, if there exists such i (1≤i≤n), that si<ti, and for any j (1≤j<i) sj=tj. The lexicographic comparison of strings is implemented by the operator < in modern programming languages.

For example, if n=5 the strings are (the order does matter):

aaabb
aabab
aabba
abaab
ababa
abbaa
baaab
baaba
babaa
bbaaa
It is easy to show that such a list of strings will contain exactly n⋅(n−1)2 strings.

You are given n (n>2) and k (1≤k≤n⋅(n−1)2). Print the k-th string from the list.

Input
The input contains one or more test cases.

The first line contains one integer t (1≤t≤104) — the number of test cases in the test. Then t test cases follow.

Each test case is written on the the separate line containing two integers n and k (3≤n≤105,1≤k≤min(2⋅109,n⋅(n−1)2).

The sum of values n over all test cases in the test doesn’t exceed 105.

Output
For each test case print the k-th string from the list of all described above strings of length n. Strings in the list are sorted lexicographically (alphabetically).

Example
inputCopy
7
5 1
5 2
5 8
5 10
3 1
3 2
20 100
outputCopy
aaabb
aabab
baaba
bbaaa
abb
bab
aaaaabaaaaabaaaaaaaa

#include<iostream>
using namespace std;
int main()
{
	int n,a,b;
	cin>>n;
	while(n--)
	{
		cin>>a>>b;
		int k=b;
		int t=1,f=0;
		for(int i=1;i<a;i++)
		{
			if(k-i<=0)
			{
				f=t;
				break;
			}
			else
			{
				k=k-i;
				t++;
			}
		}
		if(b==1)
		{
			for(int i=0;i<=a-3;i++)
			{
				cout<<"a";
			}
			for(int i=0;i<2;i++)
			{
				cout<<"b";
			}
			cout<<endl;
		}
		else
		{
			for(int i=a-1-t;i>0;i--)
			{
				cout<<"a";
			}
			cout<<"b";
			for(int i=f-k;i>0;i--)
			{
				cout<<"a";
			}
			cout<<"b";
			for(int i=k-1;i>0;i--)
			{
				cout<<"a";
			}
			cout<<endl;
		}
	}
}