(原创)斗牛游戏 初版

/*

纯属原创,如有雷同,他抄我的;

*/


#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <string>
#include <cstring>
using namespace std;
char card_color[] = {'\a','\3','\4','\5','\6'};
int card_total[] = {101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113,
                    201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213,
                    301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313,
                    401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413 };
string card_name[] = {"0","A","2","3","4","5","6","7","8","9","10","J","Q","K"};
string player_name[] = {"player0","玩家1","玩家2","玩家3","玩家4","玩家5","玩家6","玩家7","玩家8"};
struct player
{
    string name;//玩家名字
    char card_co[6];//牌颜色
    string card_na[6];//牌名
    int card_value[6];//牌值
    int niu_x;//牛几
    bool zhuang;//庄家
    int yazhu;
}players[9];

// 随机打乱一个数组
void random(int a[], int n)
{
	int index, tmp, i;
	srand(time(NULL));
	for (i = 0; i <n; i++)
	{
		index = rand() % (n - i) + i;
		if (index != i)
		{
			tmp = a[i];
			a[i] = a[index];
			a[index] = tmp;
		}
	}
}
int wuhua(player players)
{
    int fl = 1;
    for(int i = 1; i <= 5; i++)
    {
        if(players.card_value[i]!=10)
            fl =0;
    }
    return fl;
}
void prin_card(player players)
{
    cout<<players.name<<":  ";
    for(int i = 1; i <= 5; i++)
        cout<<players.card_co[i]<<players.card_na[i]<<"  ";
    cout<<endl;
    if(wuhua(players))
        cout<<"\t\t\t\t==五花=="<<endl;
    else
    if(players.niu_x>0)
        cout<<"\t\t\t\t==牛"<<players.niu_x<<"=="<<endl;
    else
    if(players.niu_x==0)
        cout<<"\t\t\t\t==牛牛=="<<endl;
    else
        cout<<"\t\t\t\t==无牛=="<<endl;
}
void prin_card(int a)
{
    cout<<card_color[a/100]<<card_name[a%100]<<" ";
}
int card_num(player players)
{
    int sum = 0;
    for(int i = 1; i <= 5; i++)
    {
        sum += players.card_value[i];
    }
    for(int i = 1; i <= 5; i++)
    {
        if(i+1<=5)
        for(int j = i+1; j <=5; j++)
        {
            if(j+1<=5)
            for(int k = j+1; k <= 5; k++)
            {
                int ans = players.card_value[i]+players.card_value[j]+players.card_value[k];
                //cout<<players.card_value[i]<<"  "<<players.card_value[j]<<"  "<<players.card_value[k]<<endl;
                if(ans%10 == 0)
                 {
                      //cout<<"ans: "<<ans<<endl;
                    return (sum-ans)%10;
                 }
            }
        }
    }
    return -1;
}
int main()
{
    //printf("a\1b\2c\3d\4e\5f\6g\7h\8i\9j\n");

	int i;
	cout<<"原牌排列:"<<endl;
	for (i = 0; i < 52; i++)
	{
	    if(i%13==0)
            printf("\n\n");
	    prin_card(card_total[i]);
	}
	random(card_total, 52);
	cout<<"\n洗牌后排列:"<<endl;
	for (i = 0; i < 52; i++)
	{
	    if(i%13==0)
            printf("\n\n");
	    prin_card(card_total[i]);
	}
	int p = 0;
	int n,z;
	cout<<"\n输入玩家个数(不要超过8):"<<endl;
	cin>>n;
	cout<<"输入庄家序号(不要超过总玩家人数):"<<endl;
	cin>>z;
	for(int i = 0; i <= n; i++)
    {
        players[i].name = player_name[i];
        players[i].zhuang = false;
    }
    players[z].zhuang = true;
    cout<<"发牌结束:"<<endl;
	for(int i = 1; i <= 5; i++)
	{
	    for(int j = 1; j <= n; j++,p++)
	    {
	        players[j].card_co[i] = card_color[card_total[p]/100];
	        players[j].card_na[i] = card_name[card_total[p]%100];
	        if(card_total[p]%100>=10)
                players[j].card_value[i] = 10;
            else
                players[j].card_value[i] = card_total[p]%100;
	    }
	}
	for(int i = 1; i <= n; i++)
	    players[i].niu_x = card_num(players[i]);
	cout<<"\t\t\t(庄家)";
	prin_card(players[z]);
	cout<<"玩家:\n";
	for(int i = 1; i <= n; i++)
	{
	    if(i!=z)
            prin_card(players[i]);
	}
	printf("\n");
	system("pause");
	return 0;
}


内容概要:本文详细介绍了“秒杀商城”微服务架构的设计与实战全过程,涵盖系统从需求分析、服务拆分、技术选型到核心功能开发、分布式事务处理、容器化部署及监控链路追踪的完整流程。重点解决了高并发场景下的超卖问题,采用Redis预减库存、消息队列削峰、数据库乐观锁等手段保障数据一致性,并通过Nacos实现服务注册发现与配置管理,利用Seata处理跨服务分布式事务,结合RabbitMQ实现异步下单,提升系统吞吐能力。同时,项目支持Docker Compose快速部署和Kubernetes生产级编排,集成Sleuth+Zipkin链路追踪与Prometheus+Grafana监控体系,构建可观测性强的微服务系统。; 适合人群:具备Java基础和Spring Boot开发经验,熟悉微服务基本概念的中高级研发人员,尤其是希望深入理解高并发系统设计、分布式事务、服务治理等核心技术的开发者;适合工作2-5年、有志于转型微服务或提升架构能力的工程师; 使用场景及目标:①学习如何基于Spring Cloud Alibaba构建完整的微服务项目;②掌握秒杀场景下高并发、超卖控制、异步化、削峰填谷等关键技术方案;③实践分布式事务(Seata)、服务熔断降级、链路追踪、统一配置中心等企业级中间件的应用;④完成从本地开发到容器化部署的全流程落地; 阅读建议:建议按照文档提供的七个阶段循序渐进地动手实践,重点关注秒杀流程设计、服务间通信机制、分布式事务实现和系统性能优化部分,结合代码调试与监控工具深入理解各组件协作原理,真正掌握高并发微服务系统的构建能力。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值