pat 1042

最新推荐文章于 2020-03-26 20:35:04 发布

andyyang0212

最新推荐文章于 2020-03-26 20:35:04 发布

阅读量311

点赞数

CC 4.0 BY-SA版权

分类专栏： Pat

本文链接：https://blog.youkuaiyun.com/andyyang0212/article/details/43561523

Pat 专栏收录该内容

101 篇文章

订阅专栏

本文介绍了一个基于卡片排序的算法实现，通过输入特定的顺序来对包含不同花色的54张卡片进行多次排序。每张卡片都有其独特的顺序值，算法使用了qsort函数根据这些顺序值来进行排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

根据order进行n次排序

#include<iostream>

using std::cout;
using std::cin;
using std::endl;

struct poke{
    char name;
    int order;
    int num;
} card[54];
int order[54];

int cmp(const void *a, const void *b){
    return (*(struct poke *)a).order - (*(struct poke *)b).order;
}
int main(){
    int i,times,j;
    freopen("1.in", "r", stdin);
    cin >> times;
    for (i = 0; i < 13; i++)
    {
        cin >> order[i];
        card[i].name = 'S';
        card[i].num = i + 1;
        card[i].order = order[i];
    }
    for (i = 13; i < 26; i++)
    {
        cin >> order[i];
        card[i].name = 'H';
        card[i].num = i + 1 - 13;
        card[i].order = order[i];
    }
    for (i = 26; i < 39; i++)
    {
        cin >> order[i];
        card[i].name = 'C';
        card[i].num = i + 1 - 26;
        card[i].order = order[i];
    }
    for (i = 39; i < 52; i++)
    {
        cin >> order[i];
        card[i].name = 'D';
        card[i].num = i + 1 - 39;
        card[i].order = order[i];
    }
    for (i = 52; i < 54; i++)
    {
        cin >> order[i];
        card[i].name = 'J';
        card[i].num = i + 1 - 52;
        card[i].order = order[i];
    }
    while (times--){
        qsort(card, 54,sizeof(struct poke),cmp);
        for (i = 0; i < 54; i++)
            card[i].order = order[i];
    }
    for (i = 0; i < 54; i++)
        if (i == 53)
            cout << card[i].name << card[i].num << endl;
        else cout << card[i].name << card[i].num << " ";
    return 0;
}