UVa 10785 - The Mad Numerologist

最新推荐文章于 2016-07-20 21:14:24 发布

cugfjp

最新推荐文章于 2016-07-20 21:14:24 发布

阅读量459

点赞数

分类专栏：算法文章标签： UVa

本文链接：https://blog.csdn.net/cugfjp/article/details/9532825

版权

算法专栏收录该内容

154 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;
char letter[2][22] = {"AUEOI", "JSBKTCLDMVNWFXGPYHQZR"};
int c[2] = {21, 5};
char t[22];
char out[212];
int n;

// k=0 vowel, k=1 consonant
// cnt 个数
void set_out(int k, int cnt)
{
    int times = c[k]; //单个字母出现最多次数
    int num, last;
    if(cnt%times) {
        num = cnt/times + 1;
        last = cnt%times;
    } else {
        num = cnt/times;
        last = times;
    }
    memcpy(t, letter[k], sizeof(t[0])*num);
    sort(t, t+num);
    for(int i=0, j=k; i<num; i++) {
        int l = t[i]==letter[k][num-1] ? last : times;
        while(l--) {
            out[j] = t[i];
            j += 2;
        }
    }
}

int main() {
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    int T;
    scanf("%d", &T);
    for(int t=1; t<=T; t++) {
        scanf("%d", &n);
        set_out(0, n%2?n/2+1:n/2);
        set_out(1, n/2);
        out[n] = 0;
        printf("Case %d: %s\n", t, out);
    }
    return 0;
}