zoukankan      html  css  js  c++  java
  • C语言之二维数组棋盘游戏

    #include<iostream>
    
    #include<stdio.h>
    using namespace std;
    int main()
    {
    //-1 没人赢 0:O赢 1:X赢
    int size;
    printf("0表示“甲方”,1表示“乙方”
    
    ");
    printf("请输入矩阵的大小
    ");
    while (scanf("%d", &size) == 1)
    {
    int board[100][100];
    int num_of_O;
    int num_of_X;
    int result = -1;
    int i, j;
    for (i = 0; i < size; i++)
    for (j = 0; j < size; j++)
    {
    scanf("%d", &board[i][j]);
    }
    
    //检查行
    for (i = 0; i < size&&result == -1; i++)
    {
    num_of_O = num_of_X = 0;
    for (j = 0; j < size; j++)
    {
    if (board[i][j] == 1)
    {
    num_of_X++;
    }
    else if(board[i][j] == 0)
    {
    num_of_O++;
    }
    }
    if (num_of_O == size)
    {
    result = 0;
    }
    else
    if (num_of_X == size)
    {
    result = 1;
    }
    }
    
    //检查列
    if (result == -1)
    {
    for (j = 0; j < size&&result == -1; j++)
    {
    num_of_O = num_of_X = 0;
    for (i = 0; i < size; i++)
    {
    if (board[i][j] == 1)
    {
    num_of_X++;
    }
    else
    if (board[i][j] == 0)
    {
    num_of_O++;
    }
    }
    if (num_of_O == size)
    {
    result = 0;
    }
    else
    if (num_of_X == size)
    {
    result = 1;
    }
    }
    }
    //检查正对角线
    num_of_O = num_of_X = 0;
    for (i = 0; i < size; i++)
    {
    if (board[i][i] == 1)
    {
    num_of_X++;
    }
    else
    if (board[i][i] ==0 )
    {
    num_of_O++;
    }
    
    }
    
    if (num_of_O == size)
    {
    result = 0;
    }
    else
    if (num_of_X == size)
    {
    result = 1;
    }
    
    //检查反对角线
    num_of_O = num_of_X = 0;
    for (i = 0; i < size; i++)
    {
    if (board[i][size - 1 - i] == 1)//反对角线计算方法
    {
    num_of_X++;
    }
    else
    if (board[i][size - 1 - i] == 0)
    {
    num_of_O++;
    }
    }
    
    if (num_of_O == size)
    {
    result = 0;
    }
    else
    if (num_of_X == size)
    {
    result = 1;
    }
    
    if (result == -1)
    {
    printf("抱歉啊,没有人赢哦!
    不服,再战!
    ");
    }
    else
    if (result == 0)
    {
    printf("恭喜!!!甲方赢啦
    ");
    }
    else
    if (result == 1)
    {
    printf("恭喜!!!乙方赢啦
    ");
    }
    printf("请输入矩阵的大小
    ");
    }
    return 0;
    }
    以大多数人努力程度之低,根本轮不到去拼天赋~
  • 相关阅读:
    微软与谷歌盈利模式对比分析
    unity开源移动库iTween使用完整Demo
    开发过程遇到的问题和解决方法(备忘)
    微信开发基础教程
    WorkFlow基础实战
    操作系统学习笔记
    编译原理学习
    微信生态圈盈利模式分析
    数据与计算机通信学习笔记
    利用Spring.Net技术打造可切换的分布式缓存读写类
  • 原文地址:https://www.cnblogs.com/gcter/p/5746743.html
Copyright © 2011-2022 走看看