The Mad Numerologist UVA - 10785 （sort 排序）

最新推荐文章于 2021-11-22 11:48:00 发布

qq_44201936

最新推荐文章于 2021-11-22 11:48:00 发布

阅读量1.1k

点赞数 2

分类专栏：排序检索文章标签： UVa 题解 uva10785题解

本文链接：https://blog.csdn.net/qq_44201936/article/details/87714158

版权

排序检索专栏收录该内容

4 篇文章 0 订阅

订阅专栏

sort 排序

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;

const string vo="AAAAAAAAAAAAAAAAAAAAAUUUUUUUUUUUUUUUUUUUUUEEEEEEEEEEEEEEEEEEEEEOOOOOOOOOOOOOOOOOOOOOIIIIIIIIIIIIIIIIIIIII";
const string co="JJJJJSSSSSBBBBBKKKKKTTTTTCCCCCLLLLLDDDDDMMMMMVVVVVNNNNNWWWWWFFFFFXXXXXGGGGGPPPPPYYYYYHHHHHQQQQQZZZZZRRRRR";

int main()
{
    int m;//freopen("input.txt","r",stdin);
    cin>>m;int jj=1;
    while(m--){
        int n;
        cin>>n;
        int num_vo,num_co;
        num_vo=n/2;num_co=n/2;
        if(n%2) num_vo++;
        string ss_vo="",ss_co="";
        for(int i=0;i<num_vo;i++)
            ss_vo=ss_vo+vo[i];
        for(int i=0;i<num_co;i++)
            ss_co=ss_co+co[i];
        sort(ss_vo.begin(),ss_vo.end());
        sort(ss_co.begin(),ss_co.end());
        cout<<"Case "<<jj<<": ";
        for(int i=0;i<num_co;i++){
            cout<<ss_vo[i]<<ss_co[i];
        }
        if(n%2)cout<<ss_vo[num_co];
        cout<<endl;jj++;
    }//while
}