UVA - 10785 The Mad Numerologist

#include<iostream>
#include<cstdio>
#include<string.h>
#include<stdlib.h>
#include<cmath>
using namespace std;
char y[]="AUEOI";
char f[]="JSBKTCLDMVNWFXGPYHQZR";
char str1[500],str2[500];
int count = 0;
int cmp(const void*a,const void*b) {
return *(char*)a - *(char*)b;
}
int main() {
int T;
scanf("%d", &T);
while(T--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n-n/2 ; i++)
str1[i] = y[i/21];
for (int i = 0; i < n/2; i++)
str2[i] = f[i/5];
qsort(str1, n-n/2, sizeof(str1[0]), cmp);
qsort(str2, n/2, sizeof(str2[0]), cmp);

printf("Case %d: ",++count);
int t = 0, k = 0;
for(int i = 0; i < n; i++)
if (i % 2 == 0)
printf("%c", str1[t++]);
else printf("%c", str2[k++]);
printf("\n");
}
return 0;
}