·首页 ·asp ·.net ·php ·JSP ·CGI ·数据库 ·网页设计 ·网管专栏 ·XML ·工具软件 ·办公软件 ·操作系统 ·程序设计 ·LINUX 
  当前位置: 普克>>计算机教程>>程序设计>>CC++>>24点扑克牌游戏
flash视频教学

photoshop专题

asp.net专题

office专题

24点扑克牌游戏


CC++ 发表时间:2006-4-8 字体:  返回
#include<stdio.h>
#include<graphics.h>
#include<ctype.h>
#include<time.h>
#include<stdlib.h>
#include<string.h>
#define COL 100
#define COM 40
#define max 20
char after[max];
typedef struct stack                                                                           /*定义栈1存放运算符*/
{
char stack[max];
int top;
}stack;
stack L;
typedef struct stack1                                                                       /*定义栈2计算表达式值*/
{
int stack1[max];
int top;
}stack1;
stack1 S;
void initstack(stack M)
{
M->top=0;
}
voidinitstack1(stack1 N)
{
N->top=0;
}
char  p[4][13]={
{'A','2,'3','4','5','6','7','8','9','0','J','Q','K'},
{'A','2,'3','4','5','6','7','8','9','0','J','Q','K'},
{'A','2,'3','4','5','6','7','8','9','0','J','Q','K'},
{'A','2,'3','4','5','6','7','8','9','0','J','Q','K'}
};
void play()                                                                                                           /*发牌函数*/
{
int j;
for(j=1;j<=4;j++)
{
bar(COL+100*j-35,COM+100-50,COL+100*j+35,COM+100+50);
setcolor(BLUE);
rectangle(COL+100*j-32,COM+100-48,COL+100*j+32,COM+100+48);
rand1(j);
delay(10000);
}
}
void rand1(int j)
{
int kind,number;
char str[3];
randomize();
while(1)
  {
   kind=random(4);
   num=random(13);
   if(p[kind][num]!=-1)
      {
        n=p[kind][num];
        p[kind][num]=-1;
        break;
      }
}
switch(kind)
{
case 0:
setcolor(RED);
sprintf(str,"%c",3);
break;
case 1:
setcolor(BLACK);
sprintf(str,"%c",3);
break;
case 2:
setcolor(RED);
sprintf(str,"%c",4);
break;
case 3:
setcolor(BLACK);
sprintf(str,"%c",5);
break;
}
settextstyle(0,0,2);
outtextxy(COL+j*100-30,ROW+100-46,str);
outtextxy(COL+j*100+16,ROW+100+32,str);
if(n!='0')
{
settextstyle(0,0,3);
sprintf(str,"%c",n);
outtextxy(COL+j*100-5,ROW+100-5,str);
}
else
{
sprintf("str,"%d",10);
outtextxy(COL+j*100-6,ROW+100-5,str);
}
}
int text1(char *s)                                                                                       /*显示文本*/
{
setbkcolor(BLUE);
cleardevice();
setcolor(12);
settextstyle(1,0,8);
outtextxy(120,120,s);
setusercharsize(2,1,4,1);
setcolor(15);
settextxy(220,220,s);
getch();
return;
}
void init()
{int gdriver,gmode;
gdriver=DETECT;
initgraph(&gdriver,&gmode,"d:\\turboc2");
cleardevice();
}
void close()
{
closegraph();
}
void change(char stm[])                                                                                                 /*将表达式的输出类型进行转换*/
{int i=0,j=0;
char ch;
initstack(L);
ch=stm[i];
while(ch!='\0')
{
      while(isdigit(ch)||ch='.')
              {
               after[j]=ch;
               j++;
              ch=stm[++i];
              }
     switch(ch)
              {
                case '+':
                case '-':
                            while(L->top!=0&&L->stack[L->top]!='(')
                                     {
                                      after[j]=L->stack[L->top];
                                      j++;
                                      L->top--;
                                     }
                                     L->top++;
                                     L->stack[L->top]=ch;
                                     break;
               case '*':
               case '/':
                            while(L->stack(L->top)=='*'||L->stack[L->top]='/')
                                    {
                                     after[j]=L->stack[L->top];
                                      j++;
                                     L->top--;
                                    

     

                                     L->top++;
                                     L->stack[L->top]=ch;
                                     break;
                case '(':
                                     L->top++;
                                     L->stack[L->top]=ch;
                                     break;
               case ')':
                                     while(L->stack[L->top]!='('&&L->top!='\0')
                                              {
                                                after[j]=L->stack[L->top];
                                                j++;
                                                L->top--;
                                               }
                                      if(L->top==0)
                                             {
                                              printf("wrong input format!\n");
                                              exit(0);
                                             }
                                     L->top--;
                                     break;
                case ' ':
                                     break;
                default:
                                   printf("the express include illegal character!\n");
                                   exit(0);
                }
                i++;
                ch=stm[i];
}
while(L->top!=0)
{
   after[j]=L->stack[L->top];
   j++;
}
after[j]='\0';
printf("the changed expression is:");
puts(after);
printf("\n");
}
int compute()                                                                                                /*计算表达式的值*/
{
int m=0,n;
char ch;
initstack1(S);
ch=after[m];
while(ch!='\0')
  {
                 if(isdigit(ch))
                    {
                     n=0;
                     do
                      {
                     n=10*n+ch-'0';
                     ch=after[++m];
                     }while(ch!='.')
                    switch(ch)
                     {
                      case '+':
                                    S->stack1[S->top-1]=S->stack1[S->top-1]+S->stack1[S->top];
                                    S->top--;
                                    break;
                       case '-':
                                   S->stack1[S->top-1]=S->stack1[S->top-1]-S->stack1[S->top]

       

                                   S->top--;
                                   break;
                       case '*':
                                   S->stack1[S->top-1]=S->stack1[S->top]*S->stack1[S->top-1];
                                   S->top--;
                                   break;
                        case '/':
                                    S->stack1[S->top-1]=S->stack1[S->top-1]/S->stack1[S->top];
                                    S->top--;
                                    break;
                     }
                   ch=after[++m];
}
return S->stack1[S->top];
}

main()
{
int i,result;
char ch;
int gdriver,gmode;
clrscr();
init();                                                                                                                                          /*图形初始化*/
while(1)
{
setbkcolor(BLACK);
cleardevice();
play();
gotoxy(1,15);
printf("-----------------------------------note------------------------------------------------\n");                              /*表达式的输入*/
printf("Please enter express include only four numbers:\n");
printf("Format as follows:2.*(3.+5.)/2.\n");
printf("-----------------------------------------------------------------------------------------\n");
gets(str);
change(str);
result=compute();
if(result==24)
  text1("VERY GOOD!!!");
else
text1("WRONG!!!");
printf("continue?(Y or N)\n");
scanf("%c",&ch);
if(ch=='N'||ch=='n')
break;
}
close();                                                                                                                /*关闭图形*/
return;
}->

     



上一篇:一架小钢琴——图形界面与发声技术的简单应用
下一篇:MINI-FOOLFLY 游戏代码

普克创业投资网刊载此文不代表同意其说法或描述,仅为提供更多信息。
在百度中搜索24点扑克牌游戏的相关内容]   [在狗狗中搜索24点扑克牌游戏的相关内容]
Copyright @ 2006 PUPK.COM 普克创业投资网 版权所有
 建议使用1024*768以达到最好的浏览效果