开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 游戏 > 棋牌游戏 > 查看源码
重做斗地主View.cpp
资源名称：DouDiZhu.rar　[点击查看]
上传用户：xyf7799
上传日期：2022-08-01
资源大小：2008k
文件大小：47k
源码类别：

棋牌游戏

开发平台：

Visual C++

重做斗地主View.cpp：源码内容
  1. // 重做斗地主View.cpp : implementation of the CMyView class
  2. //
  4. #include "stdafx.h"
  5. #include "重做斗地主.h"
  7. #include "重做斗地主Doc.h"
  8. #include "重做斗地主View.h"
  10. #ifdef _DEBUG
  11. #define new DEBUG_NEW
  12. #undef THIS_FILE
  13. static char THIS_FILE[] = __FILE__;
  14. #endif
  16. /////////////////////////////////////////////////////////////////////////////
  17. // CMyView
  19. IMPLEMENT_DYNCREATE(CMyView, CView)
  21. BEGIN_MESSAGE_MAP(CMyView, CView)
  22. //{{AFX_MSG_MAP(CMyView)
  23. ON_WM_LBUTTONDOWN()
  24. ON_WM_RBUTTONDOWN()
  25. ON_COMMAND(IDM_BAN_START, OnBanStart)
  26. ON_WM_KEYDOWN()
  27. //}}AFX_MSG_MAP
  28. END_MESSAGE_MAP()
  30. /////////////////////////////////////////////////////////////////////////////
  31. // CMyView construction/destruction
  33. CMyView::CMyView()
  34. {
  35. // TODO: add construction code here
  36. //位图的引入
  37. for(int i=0;i<54;i++)
  38. {
  39. bmpPai[i].LoadBitmap(IDB_BITMAP1+i);
  40. }
  41. bmpTable.LoadBitmap(IDB_BITMAP55);
  42. bmpCusor.LoadBitmap(IDB_BITMAP56);
  43. bmpNull.LoadBitmap(IDB_BITMAP57);
  44. bmpZheDang.LoadBitmap(IDB_BITMAP61);
  45. for(i=0;i<3;i++)
  46. {
  47. bmpTurn[i].LoadBitmap(IDB_BITMAP58+i);
  48. }
  49. //初始化所有的牌组
  50. for(i=0;i<20;i++)
  51. {
  52. P[i].z=0;
  53. C1[i].z=0;
  54. C2[i].z=0;
  55. L[i].z=0;
  56. nCusor[i]=0;
  57. F[i].z=0;
  58. }
  59. //定义地主是谁
  60. srand(GetTickCount());
  61. nIsDiZhu=rand()%3;
  62. nIsWho=nIsDiZhu;
  63. nLastFormWho=2;
  64. for(i=0;i<3;i++)
  65. {
  66. nZongZiJin[i]=1000;
  67. }
  68. //发牌
  69. srand(GetTickCount());
  70. i=0;
  71. int j=0;
  72. int DiZhuPai[3];
  73. int temp;
  74. BOOL isChongFu=FALSE;
  75. for(i=0;i<3;i++)
  76. {
  77. DiZhuPai[i]=0;
  78. }
  79. //先定义三张地主牌
  80. i=0;
  81. while(i<3)
  82. {
  83. temp=rand()%54+1;
  84. for(j=0;j<3;j++)
  85. {
  86. if(DiZhuPai[j]==temp)
  87. isChongFu=TRUE;
  88. break;
  89. }
  90. if(isChongFu==FALSE)
  91. {
  92. DiZhuPai[i]=temp;
  93. i++;
  94. }
  95. isChongFu=FALSE;
  96. }
  97. switch(nIsDiZhu)
  98. {
  99. case 0:
  100. C1[19].z=DiZhuPai[2];
  101. C1[18].z=DiZhuPai[1];
  102. C1[17].z=DiZhuPai[0];
  103. break;
  104. case 1:
  105. C2[19].z=DiZhuPai[2];
  106. C2[18].z=DiZhuPai[1];
  107. C2[17].z=DiZhuPai[0];
  108. break;
  109. case 2:
  110. P[19].z=DiZhuPai[2];
  111. P[18].z=DiZhuPai[1];
  112. P[17].z=DiZhuPai[0];
  113. break;
  114. default:
  115. break;
  116. }
  118. //下面是定义剩下的牌
  119. i=1;
  120. int a=0;
  121. int b=0;
  122. int c=0;
  123. while(i<=54)
  124. {
  125. if(i==DiZhuPai[0]||i==DiZhuPai[1]||i==DiZhuPai[2])
  126. {
  127. i++;
  128. }
  129. else
  130. {
  131. j=rand()%3;
  132. switch(j)
  133. {
  134. case 0:
  135. if(a<17)
  136. {
  137. C1[a].z=i;
  138. a++;
  139. i++;
  140. }
  141. break;
  142. case 1:
  143. if(b<17)
  144. {
  145. C2[b].z=i;
  146. b++;
  147. i++;
  148. }
  150. break;
  151. case 2:
  152. if(c<17)
  153. {
  154. P[c].z=i;
  155. c++;
  156. i++;
  157. }
  158. break;
  159. default:
  160. break;
  161. }
  162. }
  163. }
  165. PaiXu(0);
  166. PaiXu(1);
  167. PaiXu(2);
  169. }
  171. CMyView::~CMyView()
  172. {
  173. }
  175. BOOL CMyView::PreCreateWindow(CREATESTRUCT& cs)
  176. {
  177. // TODO: Modify the Window class or styles here by modifying
  178. //  the CREATESTRUCT cs
  180. return CView::PreCreateWindow(cs);
  181. }
  183. /////////////////////////////////////////////////////////////////////////////
  184. // CMyView drawing
  186. void CMyView::OnDraw(CDC* pDC)
  187. {
  188. CMyDoc* pDoc = GetDocument();
  189. ASSERT_VALID(pDoc);
  190. // TODO: add draw code for native data here
  191. //牌桌和牌的显示
  192. CDC dc;
  193. dc.CreateCompatibleDC(pDC);
  194. dc.SelectObject(bmpTable);
  195. pDC->StretchBlt(0,0,640,410,&dc,0,0,640,410,SRCCOPY);
  197. for(int i=0;i<20;i++)
  198. {
  199. if(C1[i].z!=0)
  200. {
  201. TransparentBitmap(pDC->GetSafeHdc(),bmpPai[C1[i].z-1],i*32,150,0,0,RGB(0,0,255));
  202. }
  203. else
  204. {
  205. TransparentBitmap(pDC->GetSafeHdc(),bmpNull,i*32,150,0,0,RGB(255,255,255));
  206. }
  207. }
  208. for(i=0;i<20;i++)
  209. {
  210. if(C2[i].z!=0)
  211. {
  212. TransparentBitmap(pDC->GetSafeHdc(),bmpPai[C2[i].z-1],i*32,214,0,0,RGB(0,0,255));
  213. }
  214. else
  215. {
  216. TransparentBitmap(pDC->GetSafeHdc(),bmpNull,i*32,214,0,0,RGB(255,255,255));
  217. }
  218. }
  219. for(i=0;i<20;i++)
  220. {
  221. if(P[i].z!=0)
  222. {
  223. TransparentBitmap(pDC->GetSafeHdc(),bmpPai[P[i].z-1],i*32,278,0,0,RGB(0,0,255));
  224. }
  225. else
  226. {
  227. TransparentBitmap(pDC->GetSafeHdc(),bmpNull,i*32,278,0,0,RGB(255,255,255));
  228. }
  229. }
  230. for(i=0;i<20;i++)
  231. {
  232. if(L[i].z!=0)
  233. {
  234. TransparentBitmap(pDC->GetSafeHdc(),bmpPai[L[i].z-1],i*32,342,0,0,RGB(0,0,255));
  235. }
  236. else
  237. {
  238. TransparentBitmap(pDC->GetSafeHdc(),bmpNull,i*32,342,0,0,RGB(255,255,255));
  239. }
  240. }
  241. //光标和轮到谁的显示
  242. switch(nIsWho)
  243. {
  244. case 0:
  245. TransparentBitmap(pDC->GetSafeHdc(),bmpTurn[0],0,0,0,0,RGB(0,0,255));
  246. for(i=0;i<20;i++)
  247. {
  248. if(nCusor[i]==1)
  249. TransparentBitmap(pDC->GetSafeHdc(),bmpCusor,i*32,150,0,0,RGB(255,255,255));
  250. }
  251. break;
  252. case 1:
  253. TransparentBitmap(pDC->GetSafeHdc(),bmpTurn[1],0,0,0,0,RGB(0,0,255));
  254. for(i=0;i<20;i++)
  255. {
  256. if(nCusor[i]==1)
  257. TransparentBitmap(pDC->GetSafeHdc(),bmpCusor,i*32,214,0,0,RGB(255,255,255));
  258. }
  259. break;
  260. case 2:
  261. TransparentBitmap(pDC->GetSafeHdc(),bmpTurn[2],0,0,0,0,RGB(0,0,255));
  262. for(i=0;i<20;i++)
  263. {
  264. if(nCusor[i]==1)
  265. TransparentBitmap(pDC->GetSafeHdc(),bmpCusor,i*32,278,0,0,RGB(255,255,255));
  266. }
  267. break;
  268. default:
  269. break;
  270. }
  271. //积分的显示
  272. CString str;
  273. pDC->SetBkColor(RGB(0,128,0));
  274. str.Format("%d",nZongZiJin[0]);
  275. pDC->TextOut(108,134,str);
  276. str.Format("%d",nZongZiJin[1]);
  277. pDC->TextOut(108,198,str);
  278. str.Format("%d",nZongZiJin[2]);
  279. pDC->TextOut(108,262,str);
  283. }
  285. /////////////////////////////////////////////////////////////////////////////
  286. // CMyView diagnostics
  288. #ifdef _DEBUG
  289. void CMyView::AssertValid() const
  290. {
  291. CView::AssertValid();
  292. }
  294. void CMyView::Dump(CDumpContext& dc) const
  295. {
  296. CView::Dump(dc);
  297. }
  299. CMyDoc* CMyView::GetDocument() // non-debug version is inline
  300. {
  301. ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(CMyDoc)));
  302. return (CMyDoc*)m_pDocument;
  303. }
  304. #endif //_DEBUG
  306. /////////////////////////////////////////////////////////////////////////////
  307. // CMyView message handlers
  309. void CMyView::TransparentBitmap(HDC hdc, HBITMAP hBitmap,short xStart, short yStart,
  310. short xadd,short yadd, COLORREF cTransparentColor)
  311. {
  312.    BITMAP     m_bm;
  313.    COLORREF   cColor;  
  314.    // 创建临时DC
  315.    HDC     hMem, hBack, hObject, hTemp, hSave;
  316.    hBack   = CreateCompatibleDC(hdc);
  317.    hObject = CreateCompatibleDC(hdc);
  318.    hMem    = CreateCompatibleDC(hdc);
  319.    hSave   = CreateCompatibleDC(hdc);   
  320.    hTemp   = CreateCompatibleDC(hdc);
  321.    // 选入位图
  322.    SelectObject(hTemp, hBitmap);   
  323.    GetObject(hBitmap, sizeof(BITMAP), (LPSTR)&m_bm);
  324.    //显示位图宽高
  325.    POINT      ptSize;
  326.    // 取得位图的宽度
  327.    ptSize.x = m_bm.bmWidth;     
  328.     // 取得位图的该度
  329.    ptSize.y = m_bm.bmHeight;           
  330.    // 转换为逻辑点值
  331.    DPtoLP(hTemp, &ptSize, 1);   
  332.    // 创建临时位图
  333.    HBITMAP    bmBack, bmObject, bmMem, bmSave;
  334.    // 单色位图
  335.    bmBack   = CreateBitmap(ptSize.x, ptSize.y, 1, 1, NULL);    
  336.    bmObject = CreateBitmap(ptSize.x, ptSize.y, 1, 1, NULL);
  337.    // 与设备兼容位图
  338.    bmMem    = CreateCompatibleBitmap(hdc, ptSize.x, ptSize.y);
  339.    bmSave      = CreateCompatibleBitmap(hdc, ptSize.x, ptSize.y);
  340.    // 将创建的临时位图选入临时DC中
  341.    HBITMAP    OldbmBack, OldbmObject, OldbmMem, OldbmSave;
  342.    OldbmBack   = (HBITMAP)SelectObject(hBack, bmBack);
  343.    OldbmObject = (HBITMAP)SelectObject(hObject, bmObject);
  344.    OldbmMem    = (HBITMAP)SelectObject(hMem, bmMem);
  345.    OldbmSave   = (HBITMAP)SelectObject(hSave, bmSave);
  346.    // 设置映射模式
  347.    SetMapMode(hTemp, GetMapMode(hdc));
  348.    // 先保留原始位图
  349.    BitBlt(hSave, 0, 0, ptSize.x, ptSize.y, hTemp, 0, 0, SRCCOPY);
  350.    // 将背景颜色设置为需透明的颜色
  351.    cColor = SetBkColor(hTemp, cTransparentColor);
  352.    // 创建目标屏蔽码
  353.    BitBlt(hObject, 0, 0, ptSize.x, ptSize.y, hTemp, 0, 0, SRCCOPY);
  354.    // 恢复源DC的原始背景色
  355.    SetBkColor(hTemp, cColor);
  356.    // 创建反转的目标屏蔽码
  357.    BitBlt(hBack, 0, 0, ptSize.x, ptSize.y, hObject, 0, 0, NOTSRCCOPY);
  358.    // 拷贝主DC的背景到目标DC
  359.    BitBlt(hMem, 0, 0, ptSize.x, ptSize.y, hdc, xStart, yStart, SRCCOPY);
  360.    // 屏蔽位图的显示区
  361.    BitBlt(hMem, 0, 0, ptSize.x, ptSize.y, hObject, 0, 0, SRCAND);
  362.    // 屏蔽位图中的透明色
  363.    BitBlt(hTemp, 0, 0, ptSize.x, ptSize.y, hBack, 0, 0, SRCAND);
  364.    // 将位图与目标DC的背景左异或操作
  365.    BitBlt(hMem, 0, 0, ptSize.x, ptSize.y, hTemp, 0, 0, SRCPAINT);
  366.    // 拷贝目标到屏幕上 
  367.    StretchBlt(hdc, xStart, yStart, ptSize.x+xadd, ptSize.y+yadd, hMem, 0, 0, ptSize.x, ptSize.y,SRCCOPY);
  368.    // 恢复原始位图
  369.    BitBlt(hTemp, 0, 0, ptSize.x, ptSize.y, hSave, 0, 0, SRCCOPY);
  370.    // 删除临时内存位图
  371.    DeleteObject(SelectObject(hBack, OldbmBack));
  372.    DeleteObject(SelectObject(hObject, OldbmObject));
  373.    DeleteObject(SelectObject(hMem, OldbmMem));
  374.    DeleteObject(SelectObject(hSave, OldbmSave));
  375.    // 删除临时内存DC
  376.    DeleteDC(hMem);
  377.    DeleteDC(hBack);
  378.    DeleteDC(hObject);
  379.    DeleteDC(hSave);
  380.    DeleteDC(hTemp);
  381. }
  383. void CMyView::OnLButtonDown(UINT nFlags, CPoint point) 
  384. {
  385. // TODO: Add your message handler code here and/or call default
  386. int i=point.x/32;
  387. switch(nIsWho)
  388. {
  389. case 0:
  390. if(point.y<150||point.y>182)
  391. return;
  392. if(nCusor[i]==0)
  393. {
  394. if(C1[i].z!=0)
  395. nCusor[i]=1;
  396. }
  397. else
  398. {
  399. if(C1[i].z!=0)
  400. nCusor[i]=0;
  401. }
  402. InvalidateRect(CRect(i*32,150,i*32+32,182));
  403. break;
  404. case 1:
  405. if(point.y<214||point.y>246)
  406. return;
  407. if(nCusor[i]==0)
  408. {
  409. if(C2[i].z!=0)
  410. nCusor[i]=1;
  411. }
  412. else
  413. {
  414. if(C2[i].z!=0)
  415. nCusor[i]=0;
  416. }
  417. InvalidateRect(CRect(i*32,214,i*32+32,246));
  418. break;
  419. case 2:
  420. if(point.y<278||point.y>310)
  421. return;
  422. if(nCusor[i]==1)
  423. {
  424. if(P[i].z!=0)
  425. nCusor[i]=0;
  426. }
  427. else
  428. {
  429. if(P[i].z!=0)
  430. nCusor[i]=1;
  431. }
  432. InvalidateRect(CRect(i*32,278,i*32+32,310));
  433. break;
  434. }
  435. CView::OnLButtonDown(nFlags, point);
  436. }
  438. void CMyView::OnRButtonDown(UINT nFlags, CPoint point) 
  439. {
  440. // TODO: Add your message handler code here and/or call default
  441. int i=0;
  442. int cusorNum=0;
  443. for(i=0;i<20;i++)
  444. {
  445. if(nCusor[i]==1)
  446. cusorNum++;
  447. }
  448. switch(nIsWho)
  449. {
  450. case 0:
  451. if(cusorNum==0)
  452. return;
  453. for(i=0;i<20;i++)
  454. {
  455. F[i].z=0;
  456. if(nCusor[i]==1)
  457. F[i].z=C1[i].z;
  458. }
  459. PaiXu(4);
  460. if(ChuPaiRule()==FALSE)
  461. {
  462. MessageBox("不符合出牌规则！");
  463. return;
  464. }
  465. //////////////////////////////////////////////
  466. for(i=0;i<20;i++)
  467. {
  468. L[i].z=0;
  469. }
  470. for(i=0;i<20;i++)
  471. {
  472. if(nCusor[i]==1)
  473. {
  474. L[i].z=C1[i].z;
  475. C1[i].z=0;
  476. }
  477. }
  478. for(i=0;i<20;i++)
  479. {
  480. nCusor[i]=0;
  481. }
  482. //////////////////////////////////////////////
  483. PaiXu(0);
  484. PaiXu(3);
  485. InvalidateRect(CRect(0,150,640,182));
  486. InvalidateRect(CRect(0,342,640,374));
  487. nIsWho=++nIsWho%3;
  488. nLastFormWho=2;
  489. break;
  490. case 1:
  491. if(cusorNum==0)
  492. return;
  493. for(i=0;i<20;i++)
  494. {
  495. F[i].z=0;
  496. if(nCusor[i]==1)
  497. F[i].z=C2[i].z;
  498. }
  499. PaiXu(4);
  500. if(ChuPaiRule()==FALSE)
  501. {
  502. MessageBox("不符合出牌规则！");
  503. return;
  504. }
  505. //////////////////////////////////////////////
  506. for(i=0;i<20;i++)
  507. {
  508. L[i].z=0;
  509. }
  510. for(i=0;i<20;i++)
  511. {
  512. if(nCusor[i]==1)
  513. {
  514. L[i].z=C2[i].z;
  515. C2[i].z=0;
  516. }
  517. }
  518. for(i=0;i<20;i++)
  519. {
  520. nCusor[i]=0;
  521. }
  522. //////////////////////////////////////////////
  523. PaiXu(1);
  524. PaiXu(3);
  525. InvalidateRect(CRect(0,214,640,246));
  526. InvalidateRect(CRect(0,342,640,374));
  527. nIsWho=++nIsWho%3;
  528. nLastFormWho=2;
  529. break;
  530. case 2:
  531. if(cusorNum==0)
  532. return;
  533. for(i=0;i<20;i++)
  534. {
  535. F[i].z=0;
  536. if(nCusor[i]==1)
  537. F[i].z=P[i].z;
  538. }
  539. PaiXu(4);
  540. if(ChuPaiRule()==FALSE)
  541. {
  542. MessageBox("不符合出牌规则！");
  543. return;
  544. }
  545. //////////////////////////////////////////////
  546. for(i=0;i<20;i++)
  547. {
  548. L[i].z=0;
  549. }
  550. for(i=0;i<20;i++)
  551. {
  552. if(nCusor[i]==1)
  553. {
  554. L[i].z=P[i].z;
  555. P[i].z=0;
  556. }
  557. }
  558. for(i=0;i<20;i++)
  559. {
  560. nCusor[i]=0;
  561. }
  562. //////////////////////////////////////////////
  563. PaiXu(2);
  564. PaiXu(3);
  565. InvalidateRect(CRect(0,278,640,310));
  566. InvalidateRect(CRect(0,342,640,374));
  567. nIsWho=++nIsWho%3;
  568. nLastFormWho=2;
  569. break;
  570. }
  571. InvalidateRect(CRect(0,0,72,16));
  572. //关于胜利的判断
  573. int jiShu=0;
  574. for(i=0;i<20;i++)
  575. {
  576. if(C1[i].z!=0)
  577. jiShu++;
  578. else
  579. break;
  580. }
  581. if(jiShu==0)
  582. {
  583. MessageBox("电脑1胜！");
  584. MessageBox("进入下轮");
  585. if(nIsDiZhu==0)
  586. {
  587. nZongZiJin[0]+=200;
  588. nZongZiJin[1]-=100;
  589. nZongZiJin[2]-=100;
  590. }
  591. else if(nIsDiZhu==1)
  592. {
  593. nZongZiJin[0]+=100;
  594. nZongZiJin[1]-=200;
  595. nZongZiJin[2]+=100;
  596. }
  597. else if(nIsDiZhu==2)
  598. {
  599. nZongZiJin[0]+=100;
  600. nZongZiJin[1]+=100;
  601. nZongZiJin[2]-=200;
  602. }
  603. nIsDiZhu=0;
  604. nIsWho=0;
  605. AllQingKong();
  606. OnBanStart();
  607. }
  608. else
  609. {
  610. jiShu=0;
  611. for(i=0;i<20;i++)
  612. {
  613. if(C2[i].z!=0)
  614. jiShu++;
  615. else
  616. break;
  617. }
  618. if(jiShu==0)
  619. {
  620. MessageBox("电脑2胜！");
  621. MessageBox("进入下轮");
  622. if(nIsDiZhu==0)
  623. {
  624. nZongZiJin[0]-=200;
  625. nZongZiJin[1]+=100;
  626. nZongZiJin[2]+=100;
  627. }
  628. else if(nIsDiZhu==1)
  629. {
  630. nZongZiJin[0]-=100;
  631. nZongZiJin[1]+=200;
  632. nZongZiJin[2]-=100;
  633. }
  634. else if(nIsDiZhu==2)
  635. {
  636. nZongZiJin[0]+=100;
  637. nZongZiJin[1]+=100;
  638. nZongZiJin[2]-=200;
  639. }
  640. nIsDiZhu=1;
  641. nIsWho=1;
  642. AllQingKong();
  643. OnBanStart();
  644. }
  645. else
  646. {
  647. jiShu=0;
  648. for(i=0;i<20;i++)
  649. {
  650. if(P[i].z!=0)
  651. jiShu++;
  652. else
  653. break;
  654. }
  655. if(jiShu==0)
  656. {
  657. MessageBox("玩家胜！");
  658. MessageBox("进入下轮");
  660. if(nIsDiZhu==0)
  661. {
  662. nZongZiJin[0]-=200;
  663. nZongZiJin[1]+=100;
  664. nZongZiJin[2]+=100;
  665. }
  666. else if(nIsDiZhu==1)
  667. {
  668. nZongZiJin[0]+=100;
  669. nZongZiJin[1]-=200;
  670. nZongZiJin[2]+=100;
  671. }
  672. else if(nIsDiZhu==2)
  673. {
  674. nZongZiJin[0]-=100;
  675. nZongZiJin[1]-=100;
  676. nZongZiJin[2]+=200;
  677. }
  678. nIsDiZhu=2;
  679. nIsWho=2;
  680. AllQingKong();
  681. OnBanStart();
  682. }
  683. }
  684. }
  688. CView::OnRButtonDown(nFlags, point);
  689. }
  690. void CMyView::PaiXu(int nTurn)
  691. {
  692. int i=0;
  693. int nTemp[20];
  694. for(i=0;i<20;i++)
  695. {
  696. nTemp[i]=0;
  697. }
  698. int j=0;
  699. int z=0;
  700. int zz=0;
  701. int zzz=0;
  702. switch(nTurn)
  703. {
  704. case 0:
  705. for(z=3;z<=13;z++)
  706. {
  707. zz=z;
  708. for(zzz=0;zzz<4;zzz++)
  709. {
  710. for(i=0;i<20;i++)
  711. {
  712. if(C1[i].z==zz)
  713. {
  714. nTemp[j]=zz;
  715. j++;
  716. }
  717. }
  718. zz+=13;
  719. }
  720. }
  721. for(z=1;z<=2;z++)
  722. {
  723. zz=z;
  724. for(zzz=0;zzz<4;zzz++)
  725. {
  726. for(i=0;i<20;i++)
  727. {
  728. if(C1[i].z==zz)
  729. {
  730. nTemp[j]=zz;
  731. j++;
  732. }
  733. }
  734. zz+=13;
  735. }
  736. }
  737. for(i=0;i<20;i++)
  738. {
  739. if(C1[i].z==53)
  740. {
  741. nTemp[j]=53;
  742. j++;
  743. }
  744. }
  745. for(i=0;i<20;i++)
  746. {
  747. if(C1[i].z==54)
  748. {
  749. nTemp[j]=54;
  750. j++;
  751. }
  752. }
  753. for(i=0;i<20;i++)
  754. {
  755. if(C1[i].z==0)
  756. {
  757. nTemp[j]=0;
  758. j++;
  759. }
  760. }
  762. for(i=0;i<20;i++)
  763. {
  764. C1[i].z=nTemp[i];
  765. }
  766. break;
  767. case 1:
  768. for(z=3;z<=13;z++)
  769. {
  770. zz=z;
  771. for(zzz=0;zzz<4;zzz++)
  772. {
  773. for(i=0;i<20;i++)
  774. {
  775. if(C2[i].z==zz)
  776. {
  777. nTemp[j]=zz;
  778. j++;
  779. }
  780. }
  781. zz+=13;
  782. }
  783. }
  784. for(z=1;z<=2;z++)
  785. {
  786. zz=z;
  787. for(zzz=0;zzz<4;zzz++)
  788. {
  789. for(i=0;i<20;i++)
  790. {
  791. if(C2[i].z==zz)
  792. {
  793. nTemp[j]=zz;
  794. j++;
  795. }
  796. }
  797. zz+=13;
  798. }
  799. }
  800. for(i=0;i<20;i++)
  801. {
  802. if(C2[i].z==53)
  803. {
  804. nTemp[j]=53;
  805. j++;
  806. }
  807. }
  808. for(i=0;i<20;i++)
  809. {
  810. if(C2[i].z==54)
  811. {
  812. nTemp[j]=54;
  813. j++;
  814. }
  815. }
  816. for(i=0;i<20;i++)
  817. {
  818. if(C2[i].z==0)
  819. {
  820. nTemp[j]=0;
  821. j++;
  822. }
  823. }
  825. for(i=0;i<20;i++)
  826. {
  827. C2[i].z=nTemp[i];
  828. }
  829. break;
  830. case 2:
  831. for(z=3;z<=13;z++)
  832. {
  833. zz=z;
  834. for(zzz=0;zzz<4;zzz++)
  835. {
  836. for(i=0;i<20;i++)
  837. {
  838. if(P[i].z==zz)
  839. {
  840. nTemp[j]=zz;
  841. j++;
  842. }
  843. }
  844. zz+=13;
  845. }
  846. }
  847. for(z=1;z<=2;z++)
  848. {
  849. zz=z;
  850. for(zzz=0;zzz<4;zzz++)
  851. {
  852. for(i=0;i<20;i++)
  853. {
  854. if(P[i].z==zz)
  855. {
  856. nTemp[j]=zz;
  857. j++;
  858. }
  859. }
  860. zz+=13;
  861. }
  862. }
  863. for(i=0;i<20;i++)
  864. {
  865. if(P[i].z==53)
  866. {
  867. nTemp[j]=53;
  868. j++;
  869. }
  870. }
  871. for(i=0;i<20;i++)
  872. {
  873. if(P[i].z==54)
  874. {
  875. nTemp[j]=54;
  876. j++;
  877. }
  878. }
  879. for(i=0;i<20;i++)
  880. {
  881. if(P[i].z==0)
  882. {
  883. nTemp[j]=0;
  884. j++;
  885. }
  886. }
  888. for(i=0;i<20;i++)
  889. {
  890. P[i].z=nTemp[i];
  891. }
  892. break;
  893. case 3:
  894. for(z=3;z<=13;z++)
  895. {
  896. zz=z;
  897. for(zzz=0;zzz<4;zzz++)
  898. {
  899. for(i=0;i<20;i++)
  900. {
  901. if(L[i].z==zz)
  902. {
  903. nTemp[j]=zz;
  904. j++;
  905. }
  906. }
  907. zz+=13;
  908. }
  909. }
  910. for(z=1;z<=2;z++)
  911. {
  912. zz=z;
  913. for(zzz=0;zzz<4;zzz++)
  914. {
  915. for(i=0;i<20;i++)
  916. {
  917. if(L[i].z==zz)
  918. {
  919. nTemp[j]=zz;
  920. j++;
  921. }
  922. }
  923. zz+=13;
  924. }
  925. }
  926. for(i=0;i<20;i++)
  927. {
  928. if(L[i].z==53)
  929. {
  930. nTemp[j]=53;
  931. j++;
  932. }
  933. }
  934. for(i=0;i<20;i++)
  935. {
  936. if(L[i].z==54)
  937. {
  938. nTemp[j]=54;
  939. j++;
  940. }
  941. }
  942. for(i=0;i<20;i++)
  943. {
  944. if(L[i].z==0)
  945. {
  946. nTemp[j]=0;
  947. j++;
  948. }
  949. }
  951. for(i=0;i<20;i++)
  952. {
  953. L[i].z=nTemp[i];
  954. }
  955. break;
  956. case 4:
  957. for(z=3;z<=13;z++)
  958. {
  959. zz=z;
  960. for(zzz=0;zzz<4;zzz++)
  961. {
  962. for(i=0;i<20;i++)
  963. {
  964. if(F[i].z==zz)
  965. {
  966. nTemp[j]=zz;
  967. j++;
  968. }
  969. }
  970. zz+=13;
  971. }
  972. }
  973. for(z=1;z<=2;z++)
  974. {
  975. zz=z;
  976. for(zzz=0;zzz<4;zzz++)
  977. {
  978. for(i=0;i<20;i++)
  979. {
  980. if(F[i].z==zz)
  981. {
  982. nTemp[j]=zz;
  983. j++;
  984. }
  985. }
  986. zz+=13;
  987. }
  988. }
  989. for(i=0;i<20;i++)
  990. {
  991. if(F[i].z==53)
  992. {
  993. nTemp[j]=53;
  994. j++;
  995. }
  996. }
  997. for(i=0;i<20;i++)
  998. {
  999. if(F[i].z==54)
  1000. {
  1001. nTemp[j]=54;
  1002. j++;
  1003. }
  1004. }
  1005. for(i=0;i<20;i++)
  1006. {
  1007. if(F[i].z==0)
  1008. {
  1009. nTemp[j]=0;
  1010. j++;
  1011. }
  1012. }
  1014. for(i=0;i<20;i++)
  1015. {
  1016. F[i].z=nTemp[i];
  1017. }
  1018. break;
  1019. default:
  1020. break;
  1021. }
  1022. }
  1024. void CMyView::OnBanStart() 
  1025. {
  1026. // TODO: Add your command handler code here
  1027. srand(GetTickCount());
  1028. int i=0;
  1029. int j=0;
  1030. int DiZhuPai[3];
  1031. int temp;
  1032. BOOL isChongFu=FALSE;
  1033. for(i=0;i<3;i++)
  1034. {
  1035. DiZhuPai[i]=0;
  1036. }
  1037. //先定义三张地主牌
  1038. i=0;
  1039. while(i<3)
  1040. {
  1041. temp=rand()%54+1;
  1042. for(j=0;j<3;j++)
  1043. {
  1044. if(DiZhuPai[j]==temp)
  1045. isChongFu=TRUE;
  1046. break;
  1047. }
  1048. if(isChongFu==FALSE)
  1049. {
  1050. DiZhuPai[i]=temp;
  1051. i++;
  1052. }
  1053. isChongFu=FALSE;
  1054. }
  1055. switch(nIsDiZhu)
  1056. {
  1057. case 0:
  1058. C1[19].z=DiZhuPai[2];
  1059. C1[18].z=DiZhuPai[1];
  1060. C1[17].z=DiZhuPai[0];
  1061. break;
  1062. case 1:
  1063. C2[19].z=DiZhuPai[2];
  1064. C2[18].z=DiZhuPai[1];
  1065. C2[17].z=DiZhuPai[0];
  1066. break;
  1067. case 2:
  1068. P[19].z=DiZhuPai[2];
  1069. P[18].z=DiZhuPai[1];
  1070. P[17].z=DiZhuPai[0];
  1071. break;
  1072. default:
  1073. break;
  1074. }
  1076. //下面是定义剩下的牌
  1077. i=1;
  1078. int a=0;
  1079. int b=0;
  1080. int c=0;
  1081. while(i<=54)
  1082. {
  1083. if(i==DiZhuPai[0]||i==DiZhuPai[1]||i==DiZhuPai[2])
  1084. {
  1085. i++;
  1086. }
  1087. else
  1088. {
  1089. j=rand()%3;
  1090. switch(j)
  1091. {
  1092. case 0:
  1093. if(a<17)
  1094. {
  1095. C1[a].z=i;
  1096. a++;
  1097. i++;
  1098. }
  1099. break;
  1100. case 1:
  1101. if(b<17)
  1102. {
  1103. C2[b].z=i;
  1104. b++;
  1105. i++;
  1106. }
  1108. break;
  1109. case 2:
  1110. if(c<17)
  1111. {
  1112. P[c].z=i;
  1113. c++;
  1114. i++;
  1115. }
  1116. break;
  1117. default:
  1118. break;
  1119. }
  1120. }
  1121. }
  1123. PaiXu(0);
  1124. PaiXu(1);
  1125. PaiXu(2);
  1126. Invalidate();
  1128. }
  1130. int CMyView::FoundationCompile(int x)
  1131. {
  1133. switch(x)
  1134. {
  1135. case 54:
  1136. x=17;
  1137. break;
  1138. case 53:
  1139. x=16;
  1140. break;
  1141. case 2:
  1142. case 15:
  1143. case 28:
  1144. case 41:
  1145. x=15;
  1146. break;
  1147. case 1:
  1148. case 14:
  1149. case 27:
  1150. case 40:
  1151. x=14;
  1152. break;
  1153. case 13:
  1154. case 26:
  1155. case 39:
  1156. case 52:
  1157. x=13;
  1158. break;
  1159. default:
  1160. x=x%13;
  1161. break;
  1162. }
  1163. return x;
  1164. }
  1166. BOOL CMyView::ChuPaiRule()
  1167. {
  1168. int i=0;
  1169. int LNum=0;
  1170. int FNum=0;
  1171. for(i=0;i<20;i++)
  1172. {
  1173. if(L[i].z!=0)
  1174. {
  1175. LNum+=1;
  1176. }
  1177. }
  1178. for(i=0;i<20;i++)
  1179. {
  1180. if(F[i].z!=0)
  1181. {
  1182. FNum+=1;
  1183. }
  1184. }
  1185. switch(LNum)
  1186. {
  1187. case 0:
  1188. switch(FNum)
  1189. {
  1190. case 1:
  1191. return TRUE;
  1192. case 2:
  1193. if(F[0].z%13==F[1].z%13)
  1194. return TRUE;
  1195. if(F[0].z==53&&F[1].z==54)
  1196. return TRUE;
  1197. return FALSE;
  1198. case 3:
  1199. if(F[0].z%13==F[1].z%13&&F[1].z%13==F[2].z%13)
  1200. return TRUE;
  1201. return FALSE;
  1202. case 4:
  1203. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1204. return TRUE;
  1205. if(MagicF(4)==6)
  1206. return TRUE;
  1207. return FALSE;
  1208. case 5:
  1209. //三带二
  1210. if(MagicF(5)==12)
  1211. return TRUE;
  1212. //五连
  1213. if(MagicF(5)==20)
  1214. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1215. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1216. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1217. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))  )
  1218. return TRUE;
  1219. return FALSE;
  1220. case 6:
  1221. //123456
  1222. if(MagicF(6)==30)
  1223. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1224. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1225. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1226. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1227. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z)) )
  1228. return TRUE;
  1229. //112233
  1230. if(MagicF(6)==24)
  1231. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[2].z))&&
  1232. (FoundationCompile(F[0].z)+2==FoundationCompile(F[4].z)) )
  1233. return TRUE;
  1234. //111222
  1235. if(MagicF(6)==18)
  1236. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[3].z)) )
  1237. return TRUE;
  1240. return TRUE;
  1242. case 7:
  1243. //1234567
  1244. if(MagicF(7)==42)
  1245. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1246. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1247. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1248. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1249. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1250. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z)) )
  1251. return TRUE;
  1252. case 8:
  1253. //12345678
  1254. if(MagicF(8)==56)
  1255. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1256. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1257. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1258. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1259. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1260. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1261. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z)) )
  1262. return TRUE;
  1263. //11223344
  1264. if(MagicF(8)==48)
  1265. return TRUE;
  1266. case 9:
  1267. //12345678
  1268. if(MagicF(9)==72)
  1269. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1270. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1271. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1272. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1273. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1274. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1275. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1276. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z)) )
  1277. return TRUE;
  1278. //111222333
  1279. if(MagicF(9)==54)
  1280. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[3].z))&&
  1281. (FoundationCompile(F[0].z)+2==FoundationCompile(F[6].z)) )
  1282. return TRUE;
  1283. case 10:
  1284. //1234567890
  1285. if(MagicF(10)==90)
  1286. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1287. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1288. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1289. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1290. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1291. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1292. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1293. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z))&&
  1294. (FoundationCompile(F[0].z)+9==FoundationCompile(F[9].z)) )
  1295. return TRUE;
  1296. //飞机
  1297. if(MagicF(10)==74)
  1298. {
  1299. int F_3_1=-1;
  1300. int F_3_2=-1;
  1301. int F_2_1=-1;
  1302. int F_2_2=-1;
  1303. int j=0;
  1304. int jiShu=0;
  1306. for(i=0;i<10;i++)
  1307. {
  1308. for(j=0;j<10;j++)
  1309. {
  1310. if(F[i].z%13!=F[j].z%13)
  1311. {
  1312. jiShu++;
  1313. }
  1314. }
  1315. if(jiShu==7)
  1316. {
  1317. if(F_3_1==-1)
  1318. F_3_1=F[i].z;
  1319. else
  1320. F_3_2=F[i].z;
  1321. } 
  1322. else
  1323. jiShu=0;
  1324. }
  1326. jiShu=0;
  1327. for(i=0;i<10;i++)
  1328. {
  1329. for(j=0;j<10;j++)
  1330. {
  1331. if(F[i].z%13!=F[j].z%13)
  1332. {
  1333. jiShu++;
  1334. }
  1335. }
  1336. if(jiShu==8)
  1337. {
  1338. if(F_2_1==-1)
  1339. F_2_1=F[i].z;
  1340. else
  1341. F_2_2=F[i].z;
  1342. } 
  1343. else
  1344. jiShu=0;
  1345. }
  1346. if((FoundationCompile(F_3_1)+1==FoundationCompile(F_3_2))&&
  1347. (FoundationCompile(F_2_1)+1==FoundationCompile(F_2_2)))
  1348. return TRUE;
  1349. }
  1350. //1122334455
  1351. if(MagicF(10)==80)
  1352. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[2].z))&&
  1353. (FoundationCompile(F[0].z)+2==FoundationCompile(F[4].z))&&
  1354. (FoundationCompile(F[0].z)+3==FoundationCompile(F[6].z))&&
  1355. (FoundationCompile(F[0].z)+4==FoundationCompile(F[8].z)) )
  1356. return TRUE;
  1358. return FALSE;
  1359. case 11:
  1360. //12345678901
  1361. if(MagicF(11)==110)
  1362. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1363. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1364. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1365. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1366. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1367. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1368. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1369. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z))&&
  1370. (FoundationCompile(F[0].z)+9==FoundationCompile(F[9].z))&&
  1371. (FoundationCompile(F[0].z)+10==FoundationCompile(F[10].z)) )
  1372. return TRUE;
  1373. case 12:
  1374. //123456789012
  1375. if(MagicF(12)==132)
  1376. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1377. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1378. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1379. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1380. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1381. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1382. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1383. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z))&&
  1384. (FoundationCompile(F[0].z)+9==FoundationCompile(F[9].z))&&
  1385. (FoundationCompile(F[0].z)+10==FoundationCompile(F[10].z))&&
  1386. (FoundationCompile(F[0].z)+11==FoundationCompile(F[11].z)) )
  1387. return TRUE;
  1388. default:
  1389. return FALSE;
  1390. }
  1391. case 1:
  1392. //以一打一
  1393. if(FNum==1)
  1394. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1395. return TRUE;
  1396. //以枪打一
  1397. if(FNum==4)
  1398. if(NoJokerF(4))
  1399. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1400. return TRUE;
  1401. //以王打一
  1402. if(FNum==2)
  1403. if(F[0].z==53&&F[1].z==54)
  1404. return TRUE;
  1405. return FALSE;
  1406. case 2:
  1407. //以二打二
  1408. if(FNum==2)
  1409. if(F[0].z%13==F[1].z%13)
  1410. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1411. return TRUE;
  1412. //以王打二
  1413. if(FNum==2)
  1414. if(F[0].z==53&&F[1].z==54)
  1415. return TRUE;
  1416. //以枪打王
  1417. if(FNum==4)
  1418. if(NoJokerF(4))
  1419. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1420. if(L[0].z!=53&&L[1].z!=54)
  1421. return FALSE;
  1422. return FALSE;
  1423. case 3:
  1424. //王打一切
  1425. if(FNum==2)
  1426. if(F[0].z==53&&F[1].z==54)
  1427. return TRUE;
  1428. //以三打三
  1429. if(FNum==3)
  1430. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13)
  1431. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1432. return TRUE;
  1433. //以枪打三
  1434. if(FNum==4)
  1435. if(NoJokerF(4))
  1436. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1437. return TRUE;
  1438. //以王打三
  1439. if(FNum==2)
  1440. if(F[0].z==53&&F[1].z==54)
  1441. return TRUE;
  1442. return FALSE;
  1443. case 4:
  1444. //以枪打枪
  1445. if(FNum==4)
  1446. if(L[0].z%13==L[1].z%13&&L[0].z%13==L[2].z%13&&L[0].z%13==L[3].z%13)
  1447. if(NoJokerF(4))
  1448. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1449. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1450. return TRUE;
  1451. //王打一切
  1452. if(FNum==2)
  1453. if(F[0].z==53&&F[1].z==54)
  1454. return TRUE;
  1455. //枪打三带一
  1456. if(FNum==4)
  1457. if(MagicL(4)==6)
  1458. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1459. return TRUE;
  1460. //三带一打三带一
  1461. if(FNum==4)
  1462. if(MagicL(4)==6)
  1463. if(MagicF(4)==6)
  1464. if(FoundationCompile(YuanShuF(4))>FoundationCompile(YuanShuL(4)))
  1465. return TRUE;
  1466. return FALSE;
  1467. case 5:
  1468. //王打一切
  1469. if(FNum==2)
  1470. if(F[0].z==53&&F[1].z==54)
  1471. return TRUE;
  1472. //三带二打三带二
  1473. if(FNum==5)
  1474. if(MagicL(5)==12)
  1475. if(MagicF(5)==12)
  1476. if(FoundationCompile(YuanShuF(5))>FoundationCompile(YuanShuL(5)))
  1477. return TRUE;
  1478. //顺打顺
  1479. if(FNum==5)
  1480. if(MagicL(5)==20)
  1481. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1482. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1483. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1484. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))  )
  1485. if(MagicF(5)==20)
  1486. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1487. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1488. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1489. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))  )
  1490. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1491. return TRUE;
  1492. //枪打一切五
  1493. if(FNum==4)
  1494. if(NoJokerF(4))
  1495. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1496. return TRUE;
  1497. return FALSE;
  1498. case 6:
  1499. //王打一切
  1500. if(FNum==2)
  1501. if(F[0].z==53&&F[1].z==54)
  1502. return TRUE;
  1503. //枪打六
  1504. if(FNum==4)
  1505. if(NoJokerF(4))
  1506. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1507. return TRUE;
  1508. //六连打六连
  1509. if(FNum==6)
  1510. if(MagicL(6)==30)
  1511. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1512. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1513. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1514. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))&&
  1515. (FoundationCompile(L[0].z)+5==FoundationCompile(L[5].z)) )
  1516. if(MagicF(6)==30)
  1517. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1518. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1519. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1520. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1521. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z)) )
  1522. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1523. return TRUE;
  1524. //112233 vs 112233
  1525. if(FNum==6)
  1526. if(MagicF(6)==24)
  1527. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[2].z))&&
  1528. (FoundationCompile(F[0].z)+2==FoundationCompile(F[4].z)) )
  1529. if(MagicL(6)==24)
  1530. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[2].z))&&
  1531. (FoundationCompile(L[0].z)+2==FoundationCompile(L[4].z)) )
  1532. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1533. return TRUE;
  1534. //111222 VS 111222
  1535. if(FNum==6)
  1536. if(MagicL(6)==18)
  1537. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[3].z)) )
  1538. if(MagicF(6)==18)
  1539. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[3].z)) )
  1540. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1541. return TRUE;
  1542. case 7:
  1543. //1234567 vs 1234567
  1544. if(FNum==7)
  1545. if(MagicL(7)==42)
  1546. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1547. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1548. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1549. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))&&
  1550. (FoundationCompile(L[0].z)+5==FoundationCompile(L[5].z))&&
  1551. (FoundationCompile(L[0].z)+6==FoundationCompile(L[6].z)) )
  1552. if(MagicF(7)==42)
  1553. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1554. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1555. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1556. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1557. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1558. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z)) )
  1559. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1560. return TRUE;
  1561. //王打一切
  1562. if(FNum==2)
  1563. if(F[0].z==53&&F[1].z==54)
  1564. return TRUE;
  1565. //枪打所有7
  1566. if(NoJokerF(4))
  1567. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1568. return TRUE;
  1569. return FALSE;
  1570. case 8:
  1571. //王打一切
  1572. if(FNum==2)
  1573. if(F[0].z==53&&F[1].z==54)
  1574. return TRUE;
  1575. //枪打所有8
  1576. if(NoJokerF(4))
  1577. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1578. return TRUE;
  1579. //12345678 vs 12345678
  1580. if(FNum==8)
  1581. if(MagicL(8)==56)
  1582. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1583. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1584. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1585. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))&&
  1586. (FoundationCompile(L[0].z)+5==FoundationCompile(L[5].z))&&
  1587. (FoundationCompile(L[0].z)+6==FoundationCompile(L[6].z))&&
  1588. (FoundationCompile(L[0].z)+7==FoundationCompile(L[7].z)) )
  1589. if(MagicF(8)==56)
  1590. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1591. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1592. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1593. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1594. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1595. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1596. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z)) )
  1597. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1598. return TRUE;
  1599. //11223344 vs 11223344
  1600. if(FNum==8)
  1601. if(MagicL(8)==48)
  1602. if(MagicF(8)==48)
  1603. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1604. return TRUE;
  1605. case 9:
  1606. //王打一切
  1607. if(FNum==2)
  1608. if(F[0].z==53&&F[1].z==54)
  1609. return TRUE;
  1610. //枪打所有9
  1611. if(NoJokerF(4))
  1612. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1613. return TRUE;
  1614. //111222333 vs 111222333
  1615. if(MagicF(9)==54)
  1616. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[3].z))&&
  1617. (FoundationCompile(F[0].z)+2==FoundationCompile(F[6].z)) )
  1618. return TRUE;
  1619. //123456789 vs 123456789
  1620. if(FNum==9)
  1621. if(MagicL(9)==72)
  1622. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1623. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1624. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1625. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))&&
  1626. (FoundationCompile(L[0].z)+5==FoundationCompile(L[5].z))&&
  1627. (FoundationCompile(L[0].z)+6==FoundationCompile(L[6].z))&&
  1628. (FoundationCompile(L[0].z)+7==FoundationCompile(L[7].z))&&
  1629. (FoundationCompile(L[0].z)+8==FoundationCompile(L[8].z)) )
  1630. if(MagicF(9)==72)
  1631. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1632. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1633. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1634. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1635. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1636. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1637. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1638. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z)) )
  1639. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1640. return TRUE;
  1641. case 10:
  1642. //王打一切
  1643. if(FNum==2)
  1644. if(F[0].z==53&&F[1].z==54)
  1645. return TRUE;
  1646. //枪打所有10
  1647. if(NoJokerF(4))
  1648. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1649. return TRUE;
  1650. //1234567890 vs 1234567890
  1651. if(FNum==10)
  1652. if(MagicL(10)==90)
  1653. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1654. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1655. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1656. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))&&
  1657. (FoundationCompile(L[0].z)+5==FoundationCompile(L[5].z))&&
  1658. (FoundationCompile(L[0].z)+6==FoundationCompile(L[6].z))&&
  1659. (FoundationCompile(L[0].z)+7==FoundationCompile(L[7].z))&&
  1660. (FoundationCompile(L[0].z)+8==FoundationCompile(L[8].z))&&
  1661. (FoundationCompile(L[0].z)+9==FoundationCompile(L[9].z)) )
  1662. if(MagicF(10)==90)
  1663. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1664. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1665. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1666. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1667. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1668. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1669. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1670. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z))&&
  1671. (FoundationCompile(F[0].z)+9==FoundationCompile(F[9].z)) )
  1672. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1673. return TRUE;
  1674. //飞机打飞机
  1675. if(FNum==10)
  1676. if(MagicF(10)==74)
  1677. {
  1678. int F_3_1=-1;
  1679. int F_3_2=-1;
  1680. int F_2_1=-1;
  1681. int F_2_2=-1;
  1682. int j=0;
  1683. int jiShu=0;
  1685. for(i=0;i<10;i++)
  1686. {
  1687. for(j=0;j<10;j++)
  1688. {
  1689. if(F[i].z%13!=F[j].z%13)
  1690. {
  1691. jiShu++;
  1692. }
  1693. }
  1694. if(jiShu==7)
  1695. {
  1696. if(F_3_1==-1)
  1697. F_3_1=F[i].z;
  1698. else
  1699. F_3_2=F[i].z;
  1700. } 
  1701. else
  1702. jiShu=0;
  1703. }
  1705. jiShu=0;
  1706. for(i=0;i<10;i++)
  1707. {
  1708. for(j=0;j<10;j++)
  1709. {
  1710. if(F[i].z%13!=F[j].z%13)
  1711. {
  1712. jiShu++;
  1713. }
  1714. }
  1715. if(jiShu==8)
  1716. {
  1717. if(F_2_1==-1)
  1718. F_2_1=F[i].z;
  1719. else
  1720. F_2_2=F[i].z;
  1721. } 
  1722. else
  1723. jiShu=0;
  1724. }
  1726. if((FoundationCompile(F_3_1)+1==FoundationCompile(F_3_2))&&
  1727. (FoundationCompile(F_2_1)+1==FoundationCompile(F_2_2)))
  1728. {
  1729. if(MagicL(10)==74)
  1730. {
  1731. int L_3_1=-1;
  1732. int L_3_2=-1;
  1733. int L_2_1=-1;
  1734. int L_2_2=-1;
  1735. j=0;
  1736. jiShu=0;
  1739. for(i=0;i<10;i++)
  1740. {
  1741. for(j=0;j<10;j++)
  1742. {
  1743. if(L[i].z%13!=L[j].z%13)
  1744. {
  1745. jiShu++;
  1746. }
  1747. }
  1748. if(jiShu==7)
  1749. {
  1750. if(L_3_1==-1)
  1751. L_3_1=L[i].z;
  1752. else
  1753. L_3_2=L[i].z;
  1754. } 
  1755. else
  1756. jiShu=0;
  1757. }
  1759. jiShu=0;
  1760. for(i=0;i<10;i++)
  1761. {
  1762. for(j=0;j<10;j++)
  1763. {
  1764. if(L[i].z%13!=L[j].z%13)
  1765. {
  1766. jiShu++;
  1767. }
  1768. }
  1769. if(jiShu==8)
  1770. {
  1771. if(L_2_1==-1)
  1772. L_2_1=L[i].z;
  1773. else
  1774. L_2_2=L[i].z;
  1775. } 
  1776. else
  1777. jiShu=0;
  1778. }
  1780. if((FoundationCompile(L_3_1)+1==FoundationCompile(L_3_2))&&
  1781. (FoundationCompile(L_2_1)+1==FoundationCompile(L_2_2)))
  1782. {
  1783. if(FoundationCompile(F_3_1)>FoundationCompile(L_3_1))
  1784. return TRUE;
  1785. }}}}
  1786. //1122334455 VS 1122334455
  1787. if(FNum==10)
  1788. if(MagicF(10)==80)
  1789. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[2].z))&&
  1790. (FoundationCompile(F[0].z)+2==FoundationCompile(F[4].z))&&
  1791. (FoundationCompile(F[0].z)+3==FoundationCompile(F[6].z))&&
  1792. (FoundationCompile(F[0].z)+4==FoundationCompile(F[8].z)) )
  1793. if(MagicL(10)==80)
  1794. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[2].z))&&
  1795. (FoundationCompile(L[0].z)+2==FoundationCompile(L[4].z))&&
  1796. (FoundationCompile(L[0].z)+3==FoundationCompile(L[6].z))&&
  1797. (FoundationCompile(L[0].z)+4==FoundationCompile(L[8].z)) )
  1798. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1799. return TRUE;
  1801. return FALSE;
  1802. case 11:
  1803. //王打一切
  1804. if(FNum==2)
  1805. if(F[0].z==53&&F[1].z==54)
  1806. return TRUE;
  1807. //枪打所有11
  1808. if(NoJokerF(4))
  1809. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1810. return TRUE;
  1811. //12345678901 vs 12345678901
  1812. if(FNum==11)
  1813. if(MagicF(11)==110)
  1814. if( (FoundationCompile(F[0].z)+1==FoundationCompile(F[1].z))&&
  1815. (FoundationCompile(F[0].z)+2==FoundationCompile(F[2].z))&&
  1816. (FoundationCompile(F[0].z)+3==FoundationCompile(F[3].z))&&
  1817. (FoundationCompile(F[0].z)+4==FoundationCompile(F[4].z))&&
  1818. (FoundationCompile(F[0].z)+5==FoundationCompile(F[5].z))&&
  1819. (FoundationCompile(F[0].z)+6==FoundationCompile(F[6].z))&&
  1820. (FoundationCompile(F[0].z)+7==FoundationCompile(F[7].z))&&
  1821. (FoundationCompile(F[0].z)+8==FoundationCompile(F[8].z))&&
  1822. (FoundationCompile(F[0].z)+9==FoundationCompile(F[9].z))&&
  1823. (FoundationCompile(F[0].z)+10==FoundationCompile(F[10].z)) )
  1824. if(MagicL(11)==110)
  1825. if( (FoundationCompile(L[0].z)+1==FoundationCompile(L[1].z))&&
  1826. (FoundationCompile(L[0].z)+2==FoundationCompile(L[2].z))&&
  1827. (FoundationCompile(L[0].z)+3==FoundationCompile(L[3].z))&&
  1828. (FoundationCompile(L[0].z)+4==FoundationCompile(L[4].z))&&
  1829. (FoundationCompile(L[0].z)+5==FoundationCompile(L[5].z))&&
  1830. (FoundationCompile(L[0].z)+6==FoundationCompile(L[6].z))&&
  1831. (FoundationCompile(L[0].z)+7==FoundationCompile(L[7].z))&&
  1832. (FoundationCompile(L[0].z)+8==FoundationCompile(L[8].z))&&
  1833. (FoundationCompile(L[0].z)+9==FoundationCompile(L[9].z))&&
  1834. (FoundationCompile(L[0].z)+10==FoundationCompile(L[10].z)) )
  1835. if(FoundationCompile(F[0].z)>FoundationCompile(L[0].z))
  1836. return TRUE;
  1837. case 12:
  1838. //王打一切
  1839. if(FNum==2)
  1840. if(F[0].z==53&&F[1].z==54)
  1841. return TRUE;
  1842. //枪打所有12
  1843. if(NoJokerF(4))
  1844. if(F[0].z%13==F[1].z%13&&F[0].z%13==F[2].z%13&&F[0].z%13==F[3].z%13)
  1845. return TRUE;
  1846. default:
  1847. return FALSE;
  1848. }
  1850. }
  1852. void CMyView::OnKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags) 
  1853. {
  1854. // TODO: Add your message handler code here and/or call default
  1855. int i=0;
  1856. int j=0;
  1857. int yShua=0;
  1858. switch(nChar)
  1859. {
  1860. case VK_SPACE:
  1861. BuYao();
  1862. break;
  1863. }
  1864. CView::OnKeyDown(nChar, nRepCnt, nFlags);
  1865. }
  1867. int CMyView::MagicF(int num)
  1868. {
  1869. int i=0;
  1870. int j=0;
  1871. int jiShu=0;
  1872. switch(num)
  1873. {
  1874. case 4:
  1875. //判断三带一 6
  1876. for(i=0;i<4;i++)
  1877. {
  1878. if(F[i].z==53||F[i].z==54)
  1879. return 1000;
  1880. for(j=0;j<4;j++)
  1881. {
  1882. if(F[i].z%13!=F[j].z%13)
  1883. jiShu++;
  1884. }
  1885. }
  1886. return jiShu;
  1887. case 5:
  1888. //判断三代二 12
  1889. for(i=0;i<5;i++)
  1890. {
  1891. if(F[i].z==53||F[i].z==54)
  1892. return 1000;
  1893. for(j=0;j<5;j++)
  1894. {
  1895. if(F[i].z%13!=F[j].z%13)
  1896. jiShu++;
  1897. }
  1898. }
  1899. return jiShu;
  1900. case 6:
  1901. //123456 30
  1902. //112233 24
  1903. //111222 18
  1904. for(i=0;i<6;i++)
  1905. {
  1906. if(F[i].z==53||F[i].z==54)
  1907. return 1000;
  1908. for(j=0;j<6;j++)
  1909. {
  1910. if(F[i].z%13!=F[j].z%13)
  1911. jiShu++;
  1912. }
  1913. }
  1914. return jiShu;
  1915. case 7:
  1916. for(i=0;i<7;i++)
  1917. {
  1918. if(F[i].z==53||F[i].z==54)
  1919. return 1000;
  1920. for(j=0;j<7;j++)
  1921. {
  1922. if(F[i].z%13!=F[j].z%13)
  1923. jiShu++;
  1924. }
  1925. }
  1926. return jiShu;
  1927. case 8:
  1928. for(i=0;i<8;i++)
  1929. {
  1930. if(F[i].z==53||F[i].z==54)
  1931. return 1000;
  1932. for(j=0;j<8;j++)
  1933. {
  1934. if(F[i].z%13!=F[j].z%13)
  1935. jiShu++;
  1936. }
  1937. }
  1938. return jiShu;
  1939. case 9:
  1940. for(i=0;i<9;i++)
  1941. {
  1942. if(F[i].z==53||F[i].z==54)
  1943. return 1000;
  1944. for(j=0;j<9;j++)
  1945. {
  1946. if(F[i].z%13!=F[j].z%13)
  1947. jiShu++;
  1948. }
  1949. }
  1950. return jiShu;
  1951. case 10:
  1952. for(i=0;i<10;i++)
  1953. {
  1954. if(F[i].z==53||F[i].z==54)
  1955. return 1000;
  1956. for(j=0;j<10;j++)
  1957. {
  1958. if(F[i].z%13!=F[j].z%13)
  1959. jiShu++;
  1960. }
  1961. }
  1962. return jiShu;
  1963. case 11:
  1964. for(i=0;i<11;i++)
  1965. {
  1966. if(F[i].z==53||F[i].z==54)
  1967. return 1000;
  1968. for(j=0;j<11;j++)
  1969. {
  1970. if(F[i].z%13!=F[j].z%13)
  1971. jiShu++;
  1972. }
  1973. }
  1974. return jiShu;
  1975. case 12:
  1976. for(i=0;i<12;i++)
  1977. {
  1978. if(F[i].z==53||F[i].z==54)
  1979. return 1000;
  1980. for(j=0;j<12;j++)
  1981. {
  1982. if(F[i].z%13!=F[j].z%13)
  1983. jiShu++;
  1984. }
  1985. }
  1986. return jiShu;
  1987. default:
  1988. break;
  1989. }
  1990. }
  1992. int CMyView::YuanShuF(int num)
  1993. {
  1994. int i=0;
  1995. int j=0;
  1996. int jiShu=0;
  1997. switch(num)
  1998. {
  1999. case 4:
  2000. //完成三带一
  2001. for(i=0;i<4;i++)
  2002. {
  2003. for(j=0;j<4;j++)
  2004. {
  2005. if(F[i].z%13!=F[j].z%13)
  2006. {
  2007. jiShu++;
  2008. }
  2009. }
  2010. if(jiShu==1)
  2011. return F[i].z;
  2012. else
  2013. jiShu=0;
  2014. }
  2015. MessageBox("这里出错了YuanShuF(4)");
  2016. break;
  2017. case 5:
  2018. for(i=0;i<5;i++)
  2019. {
  2020. for(j=0;j<5;j++)
  2021. {
  2022. if(F[i].z%13!=F[j].z%13)
  2023. {
  2024. jiShu++;
  2025. }
  2026. }
  2027. if(jiShu==2)
  2028. return F[i].z;
  2029. else
  2030. jiShu=0;
  2031. }
  2032. MessageBox("这里出错了YuanShuF(5)");
  2033. break;
  2034. default:
  2035. break;
  2036. }
  2038. }
  2040. int CMyView::MagicL(int num)
  2041. {
  2042. int i=0;
  2043. int j=0;
  2044. int jiShu=0;
  2045. switch(num)
  2046. {
  2047. case 4:
  2048. for(i=0;i<4;i++)
  2049. {
  2050. if(L[i].z==53||L[i].z==54)
  2051. return 1000;
  2052. for(j=0;j<4;j++)
  2053. {
  2054. if(L[i].z%13!=L[j].z%13)
  2055. jiShu++;
  2056. }
  2057. }
  2058. return jiShu;
  2059. case 5:
  2060. for(i=0;i<5;i++)
  2061. {
  2062. if(L[i].z==53||L[i].z==54)
  2063. return 1000;
  2064. for(j=0;j<5;j++)
  2065. {
  2066. if(L[i].z%13!=L[j].z%13)
  2067. jiShu++;
  2068. }
  2069. }
  2070. return jiShu;
  2071. case 6:
  2072. for(i=0;i<6;i++)
  2073. {
  2074. if(L[i].z==53||L[i].z==54)
  2075. return 1000;
  2076. for(j=0;j<6;j++)
  2077. {
  2078. if(L[i].z%13!=L[j].z%13)
  2079. jiShu++;
  2080. }
  2081. }
  2082. return jiShu;
  2083. case 7:
  2084. for(i=0;i<7;i++)
  2085. {
  2086. if(L[i].z==53||L[i].z==54)
  2087. return 1000;
  2088. for(j=0;j<7;j++)
  2089. {
  2090. if(L[i].z%13!=L[j].z%13)
  2091. jiShu++;
  2092. }
  2093. }
  2094. return jiShu;
  2095. case 8:
  2096. for(i=0;i<8;i++)
  2097. {
  2098. if(L[i].z==53||L[i].z==54)
  2099. return 1000;
  2100. for(j=0;j<8;j++)
  2101. {
  2102. if(L[i].z%13!=L[j].z%13)
  2103. jiShu++;
  2104. }
  2105. }
  2106. return jiShu;
  2107. case 9:
  2108. for(i=0;i<9;i++)
  2109. {
  2110. if(L[i].z==53||L[i].z==54)
  2111. return 1000;
  2112. for(j=0;j<9;j++)
  2113. {
  2114. if(L[i].z%13!=L[j].z%13)
  2115. jiShu++;
  2116. }
  2117. }
  2118. return jiShu;
  2119. case 10:
  2120. for(i=0;i<10;i++)
  2121. {
  2122. if(L[i].z==53||L[i].z==54)
  2123. return 1000;
  2124. for(j=0;j<10;j++)
  2125. {
  2126. if(L[i].z%13!=L[j].z%13)
  2127. jiShu++;
  2128. }
  2129. }
  2130. return jiShu;
  2131. case 11:
  2132. for(i=0;i<11;i++)
  2133. {
  2134. if(L[i].z==53||L[i].z==54)
  2135. return 1000;
  2136. for(j=0;j<11;j++)
  2137. {
  2138. if(L[i].z%13!=L[j].z%13)
  2139. jiShu++;
  2140. }
  2141. }
  2142. return jiShu;
  2143. case 12:
  2144. for(i=0;i<12;i++)
  2145. {
  2146. if(L[i].z==53||L[i].z==54)
  2147. return 1000;
  2148. for(j=0;j<12;j++)
  2149. {
  2150. if(L[i].z%13!=L[j].z%13)
  2151. jiShu++;
  2152. }
  2153. }
  2154. return jiShu;
  2155. default:
  2156. break;
  2157. }
  2158. }
  2160. int CMyView::YuanShuL(int num)
  2161. {
  2162. int i=0;
  2163. int j=0;
  2164. int jiShu=0;
  2165. switch(num)
  2166. {
  2167. case 4:
  2168. for(i=0;i<4;i++)
  2169. {
  2170. for(j=0;j<4;j++)
  2171. {
  2172. if(L[i].z%13!=L[j].z%13)
  2173. {
  2174. jiShu++;
  2175. }
  2176. }
  2177. if(jiShu==1)
  2178. return L[i].z;
  2179. else
  2180. jiShu=0;
  2181. }
  2182. MessageBox("这里出错了YuanShuL(4)");
  2183. break;
  2184. case 5:
  2185. for(i=0;i<5;i++)
  2186. {
  2187. for(j=0;j<5;j++)
  2188. {
  2189. if(L[i].z%13!=L[j].z%13)
  2190. {
  2191. jiShu++;
  2192. }
  2193. }
  2194. if(jiShu==2)
  2195. return L[i].z;
  2196. else
  2197. jiShu=0;
  2198. }
  2199. MessageBox("YuanShuL(5)");
  2200. break;
  2201. default:
  2202. break;
  2203. }
  2205. }
  2207. BOOL CMyView::NoJokerF(int num)
  2208. {
  2209. int i=0;
  2210. switch(num)
  2211. {
  2212. case 4:
  2213. for(i=0;i<4;i++)
  2214. {
  2215. if(F[i].z==54||F[i].z==53)
  2216. return FALSE;
  2217. }
  2218. return TRUE;
  2219. case 5:
  2220. for(i=0;i<5;i++)
  2221. {
  2222. if(F[i].z==54||F[i].z==53)
  2223. return FALSE;
  2224. }
  2225. default:
  2226. break;
  2227. }
  2228. }
  2230. void CMyView::BuYao()
  2231. {
  2232. int i=0;
  2233. int j=0;
  2234. int yShua=0;
  2235. switch(nIsWho)
  2236. {
  2237. case 0:
  2238. yShua=150;
  2239. break;
  2240. case 1:
  2241. yShua=214;
  2242. break;
  2243. case 2:
  2244. yShua=278;
  2245. break;
  2246. }
  2247. for(i=0;i<20;i++)
  2248. {
  2249. nCusor[i]=0;
  2250. InvalidateRect(CRect(i*32,yShua,i*32+32,yShua+32));
  2251. }
  2252. nIsWho=++nIsWho%3;
  2253. InvalidateRect(CRect(0,0,72,16));
  2254. //自己的牌要给自己让路
  2255. nLastFormWho--;
  2256. if(nLastFormWho<=0)
  2257. {
  2258. for(i=0;i<20;i++)
  2259. {
  2260. if(L[i].z!=0)
  2261. {
  2262. L[i].z=0;
  2263. InvalidateRect(CRect(0,342,640,374));
  2264. }
  2265. }
  2266. }
  2267. }
  2269. void CMyView::AllQingKong()
  2270. {
  2271. int i=0;
  2272. for(i=0;i<20;i++)
  2273. {
  2274. C1[i].z=0;
  2275. C2[i].z=0;
  2276. P[i].z=0;
  2277. L[i].z=0;
  2278. F[i].z=0;
  2279. }
  2280. }