• Life Game-cww


    #include<cstdio>
    #include<cstring>
    #include<iostream>
    using namespace std;
    const int N=22,M=66;
    const int dx[]={-1,0,1,0,-1,-1,1,1};
    const int dy[]={0,-1,0,1,-1,1,-1,1};
    int g[N][M],gg[N][M],x,y,n=20,m=60;
    bool ok[N][M];
    char ch;
    
    int main(){
        puts("Welcome");
        for (;scanf("%d%d",&x,&y)==2&&!(x==-1&&y==-1);){
            if (ok[x][y])continue;
            for (int i=0;i<8;i++) g[x+dx[i]][y+dy[i]]++;
            ok[x][y]=1;
        }
        for (int i=1;i<=n;i++){
          for (int j=1;j<=m;j++)
            if (ok[i][j])printf("*");
            else printf("-");
          puts("");
        }
        puts("fuck or not?");
        for (;cin>>ch&&ch!='n';){
            for (int i=1;i<=n;i++) 
              for (int j=1;j<=m;j++)gg[i][j]=g[i][j];
            for (int i=1;i<=n;i++){
              for (int j=1;j<=m;j++){
                if (ok[i][j]&&(gg[i][j]!=2&&gg[i][j]!=3)){
                    for (int di=0;di<8;di++) g[i+dx[di]][j+dy[di]]--;
                    ok[i][j]=0;
                }
                if ((!ok[i][j])&&gg[i][j]==3){
                    for (int di=0;di<8;di++) g[i+dx[di]][j+dy[di]]++;
                    ok[i][j]=1;
                }
                if (ok[i][j])printf("*");else printf("-");
              }
              puts("");
            }
            puts("fuck or not?");
        }
        return 0;
    }
  • 相关阅读:
    预分频之三
    MySQL超时配置
    随机森林深入理解
    决策树算法——ID3
    指数平滑法
    最小二乘法的Java实现
    JS实战
    CSS布局实战
    Win7 Python开发环境搭建
    神经网络正向传播与反向传播公式
  • 原文地址:https://www.cnblogs.com/cww97/p/7534014.html
Copyright © 2020-2023  润新知