Codeforces Round #527 (Div. 3)(A. Uniform String)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll tst,n,p;

    cin>>tst;

    while(tst--)

    {

        cin>>n>>p;

        ll mi=n/p,lo=0;

        for(ll i=0; i<p; i++)

            for(ll j=0; j<mi; j++)

                printf("%c",i+'a'),lo++;

        ll i=0;

        while(lo!=n)

            printf("%c",i+'a'),lo++,i++;

        cout<<endl;

    }

    return 0;

}

///Alhamdulillah

Problem Link: https://codeforces.com/contest/1092/problem/A