ACM篇:POJ 1786--Bridge Hands

恶心的模拟

#include <iostream>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>
using namespace std;

struct Card
{
    int suit;
    int rank;
} card[4][13];
int p_cur[4];

int _turn(int t, bool is_player, bool is_in, bool is_suit);
bool _cmp(Card a, Card b);
void _print(Card s[], int kase);

int main()
{
    int t;
    while (t=getchar())
    {
        if (t == ' ' || t == '\n') continue;
        if (t == '#') return 0;

        int ch;
        int cur = (_turn(t, true, false, false) + 1) % 4;

        memset(card, 0, sizeof(card));
        memset(p_cur, 0, sizeof(p_cur));
        //  input
        int cnt = 0;
        while (ch=getchar())
        {
            if (ch == '\n' || ch == ' ') continue;
            else 
            {
                card[cur][p_cur[cur]].suit = _turn(ch, false, true, false);
                card[cur][p_cur[cur]].rank = _turn(getchar(), false, true, false);
                p_cur[cur]++;
                cur = (cur+1) % 4;
                if (++cnt == 52) break;
            }
        }
        //  sort
        for (int i = 0; i < 4; i++) sort(card[i], card[i]+13, _cmp);
        //  print
        for (int i = 0; i < 4; i++) _print(card[i], i);
        putchar('\n');
    }
    return 0;
}

const char PLAYER[] = "SWNE";
const char SUITS[] = "CDSH";
const char RANKS[] = "  23456789TJQKA" ;
int _turn(int t,bool is_player, bool is_in, bool is_suit)
{
    if (is_player)
    {
        for (int i = 0; PLAYER[i] != '\0'; i++)
        {
            if (t == PLAYER[i]) return i;
        }
    }
    else if (is_in)
    {
        for (int i = 0; SUITS[i] != '\0'; i++) 
        {
            if (t == SUITS[i]) return i;
        }
        for (int i = 0; RANKS[i] != '\0'; i++)
        {
            if (t == RANKS[i]) return i;
        }   
    }
    else 
    {
        if (is_suit) return SUITS[t];
        else return RANKS[t];
    }
}

bool _cmp(Card a, Card b)
{
    if (a.suit != b.suit) return (a.suit < b.suit);
    else return (a.rank < b.rank);
}

const char player_name[][16] = {"South player", "West player", "North player", "East player"};
void _print(Card s[], int kase)
{
    printf("%s:\n", player_name[kase]);

    for (int i = 1; i <= 5; i++)
    {
        for (int j = 1; j <= 53; j++)
        {
            if (i == 1 || i == 5) 
            {
                if(j%4 == 1) putchar('+');
                else putchar('-');
            }
            else if (i == 2 || i == 4)
            {
                if (j % 4 == 1) putchar('|');
                else if(j % 4 == 3) putchar(' ');
                else putchar(_turn(s[(j-1)/4].rank, false, false, false));
            }
            else 
            {
                if (j % 4 == 1) putchar('|');
                else if(j % 4 == 3) putchar(_turn(s[(j-1)/4].suit, false, false, true));
                else putchar(' ');
            }
        }
        putchar('\n');
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值