首页 > 其他分享 >111

111

时间:2024-03-08 20:11:56浏览次数:17  
标签:std TxMinecraft mc 111 include con

#include <bits/stdc++.h>
#include "minecraft.h"
#include <Windows.h>
using namespace std;
TxMinecraft mc;
int main() {
    bool con = mc.ConnectMinecraft("zk","4cd7d6e558c943c397a3a5243fa78e19");
    if(!con){
        cout<<"连接失败";
    }
    mc.setPlayerFly("wangyihang");
    int x = 852,y = 78,z = 936,id = 251,data;
    mc.fillBlocks(x-10,y-5,z,x+30,y+35,z,0,0);
    //黄色
    data = 4;
    mc.drawLine(x+10,y+22,z,x+10,y+24,z,id,data);
    mc.drawLine(x+11,y+24,z,x+11,y+25,z,id,data);
    mc.setBlock(x+23,y+28,z,id,data);
    //深蓝色
    data = 11;
    mc.drawLine(x+18,y+19,z,x+19,y+19,z,id,data);
    mc.drawLine(x+17,y+20,z,x+20,y+20,z,id,data);
    mc.drawLine(x+18,y+21,z,x+21,y+21,z,id,data);
    mc.drawLine(x+19,y+22,z,x+20,y+22,z,id,data);
    mc.setBlock(x+20,y+23,z,id,data);
    mc.drawLine(x+16,y+22,z,x+17,y+22,z,id,data);
    mc.drawLine(x+16,y+23,z,x+18,y+23,z,id,data);
    mc.drawLine(x+17,y+24,z,x+18,y+24,z,id,data);
    mc.setBlock(x+15,y+24,z,id,data);
    mc.drawLine(x+13,y+25,z,x+16,y+25,z,id,data);
    mc.drawLine(x+12,y+26,z,x+16,y+26,z,id,data);
    mc.drawLine(x+12,y+27,z,x+14,y+27,z,id,data);
    mc.drawLine(x+9,y+26,z,x+10,y+26,z,id,data);
    mc.drawLine(x+9,y+27,z,x+10,y+27,z,id,data);
    mc.drawLine(x+8,y+28,z,x+10,y+28,z,id,data);
    mc.drawLine(x+6,y+26,z,x+7,y+26,z,id,data);
    mc.drawLine(x+5,y+27,z,x+7,y+27,z,id,data);
    mc.drawLine(x+4,y+28,z,x+6,y+28,z,id,data);
    mc.drawLine(x+4,y+25,z,x+4,y+26,z,id,data);
    mc.setBlock(x+3,y+27,z,id,data);
    //红色
    data = 14;
    mc.setBlock(x+18,y+26,z,id,data);
    mc.setBlock(x+17,y+27,z,id,data);
    mc.drawLine(x+15,y+28,z,x+16,y+28,z,id,data);
    mc.drawLine(x+12,y+29,z,x+15,y+29,z,id,data);
    //粉色
    data = 6;
    mc.setBlock(x+23,y+27,z,id,data);
    mc.setBlock(x+24,y+28,z,id,data);
    mc.setBlock(x+22,y+28,z,id,data);
    mc.setBlock(x+23,y+29,z,id,data);
    //绿色
    data = 5;
    mc.setBlock(x+17,y+1,z,id,data);
    mc.setBlock(x+18,y+2,z,id,data);
    mc.setBlock(x+23,y+7,z,id,data);
    mc.setBlock(x+1,y+4,z,id,data);
    mc.drawLine(x+3,y+1,z,x+1,y+3,z,id,data);
    mc.drawLine(x+9,y+12,z,x+9,y+13,z,id,data);
    mc.drawLine(x+11,y+9,z,x+11,y+13,z,id,data);
    mc.setBlock(x+10,y+11,z,id,data);
    mc.drawLine(x+22,y+8,z,x+22,y+9,z,id,data);
    //浅蓝色
    data = 3;
    mc.drawLine(x+3,y+3,z,x+3,y+6,z,id,data);
    mc.drawLine(x+4,y+2,z,x+4,y+8,z,id,data);
    mc.drawLine(x+5,y+1,z,x+5,y+10,z,id,data);
    mc.drawLine(x+6,y+1,z,x+6,y+3,z,id,data);
    mc.drawLine(x+6,y+10,z,x+6,y+11,z,id,data);
    mc.drawLine(x+7,y+1,z,x+7,y+12,z,id,data);
    mc.drawLine(x+8,y+1,z,x+8,y+11,z,id,data);
    mc.drawLine(x+9,y+1,z,x+9,y+9,z,id,data);
    mc.drawLine(x+10,y+1,z,x+10,y+9,z,id,data);
    mc.drawLine(x+11,y+1,z,x+11,y+9,z,id,data);
    mc.drawLine(x+12,y+1,z,x+12,y+11,z,id,data);
    mc.drawLine(x+13,y+1,z,x+13,y+11,z,id,data);
    mc.drawLine(x+14,y+1,z,x+14,y+10,z,id,data);
    mc.drawLine(x+15,y+1,z,x+15,y+8,z,id,data);
    mc.drawLine(x+16,y+4,z,x+16,y+6,z,id,data);
    mc.drawLine(x+17,y+3,z,x+17,y+4,z,id,data);
    //黑色
    data = 15;
    mc.drawLine(x+3,y,z,x+17,y,z,id,data);
    mc.drawLine(x+2,y+1,z,x+1,y+2,z,id,data);
    mc.drawLine(x+4,y+1,z,x+3,y+2,z,id,data);
    mc.drawLine(x,y+3,z,x,y+4,z,id,data);
    mc.drawLine(x+2,y+3,z,x+2,y+6,z,id,data);
    mc.setBlock(x+1,y+5,z,id,data);
    mc.drawLine(x+3,y+7,z,x+3,y+8,z,id,data);
    mc.drawLine(x+4,y+9,z,x+4,y+10,z,id,data);
    mc.drawLine(x+5,y+11,z,x+7,y+13,z,id,data);
    mc.drawLine(x+7,y+3,z,x+11,y+3,z,id,data);
    mc.drawLine(x+6,y+4,z,x+6,y+9,z,id,data);
    mc.drawLine(x+7,y+10,z,x+11,y+10,z,id,data);
    mc.drawLine(x+12,y+4,z,x+12,y+9,z,id,data);
    mc.drawLine(x+9,y+6,z,x+8,y+7,z,id,data);
    mc.setBlock(x+10,y+7,z,id,data);
    mc.drawLine(x+16,y+1,z,x+16,y+3,z,id,data);
    mc.drawLine(x+17,y+2,z,x+15,y+4,z,id,data);
    mc.drawLine(x+18,y+1,z,x+19,y+2,z,id,data);
    mc.drawLine(x+19,y+3,z,x+18,y+4,z,id,data);
    mc.drawLine(x+17,y+5,z,x+17,y+6,z,id,data);
    mc.drawLine(x+16,y+7,z,x+16,y+8,z,id,data);
    mc.drawLine(x+15,y+9,z,x+15,y+10,z,id,data);
    mc.setBlock(x+14,y+11,z,id,data);
    mc.drawLine(x+12,y+12,z,x+13,y+12,z,id,data);
    mc.setBlock(x+12,y+13,z,id,data);
    mc.setBlock(x+9,y+11,z,id,data);
    mc.setBlock(x+11,y+11,z,id,data);
    mc.drawLine(x+10,y+12,z,x+10,y+13,z,id,data);
    mc.drawLine(x+8,y+12,z,x+8,y+15,z,id,data);
    mc.setBlock(x+9,y+14,z,id,data);
    mc.drawLine(x+6,y+15,z,x+7,y+15,z,id,data);
    mc.drawLine(x+5,y+16,z,x+4,y+17,z,id,data);
    mc.drawLine(x+3,y+18,z,x+4,y+19,z,id,data);
    mc.drawLine(x+4,y+20,z,x+4,y+24,z,id,data);
    mc.drawLine(x+3,y+25,z,x+3,y+26,z,id,data);
    mc.drawLine(x+2,y+26,z,x+2,y+27,z,id,data);
    mc.drawLine(x+3,y+28,z,x+5,y+26,z,id,data);
    mc.drawLine(x+4,y+29,z,x+11,y+29,z,id,data);
    mc.setBlock(x+7,y+28,z,id,data);
    mc.drawLine(x+8,y+26,z,x+8,y+27,z,id,data);
    mc.drawLine(x+5,y+25,z,x+10,y+25,z,id,data);
    mc.drawLine(x+11,y+26,z,x+11,y+28,z,id,data);
    mc.setBlock(x+7,y+23,z,id,data);
    mc.setBlock(x+6,y+22,z,id,data);
    mc.drawLine(x+7,y+20,z,x+7,y+21,z,id,data);
    mc.setBlock(x+9,y+18,z,id,data);
    mc.drawLine(x+9,y+21,z,x+9,y+24,z,id,data);
    mc.drawLine(x+11,y+22,z,x+11,y+23,z,id,data);
    mc.setBlock(x+10,y+21,z,id,data);
    mc.drawLine(x+12,y+24,z,x+12,y+25,z,id,data);
    mc.drawLine(x+13,y+24,z,x+14,y+24,z,id,data);
    mc.drawLine(x+12,y+28,z,x+14,y+28,z,id,data);
    mc.drawLine(x+12,y+30,z,x+16,y+30,z,id,data);
    mc.drawLine(x+16,y+29,z,x+19,y+26,z,id,data);
    mc.drawLine(x+15,y+27,z,x+16,y+27,z,id,data);
    mc.drawLine(x+17,y+25,z,x+17,y+26,z,id,data);
    mc.drawLine(x+18,y+25,z,x+19,y+25,z,id,data);
    mc.drawLine(x+19,y+23,z,x+19,y+24,z,id,data);
    mc.drawLine(x+20,y+24,z,x+21,y+23,z,id,data);
    mc.drawLine(x+13,y+24,z,x+14,y+24,z,id,data);
    mc.drawLine(x+14,y+23,z,x+15,y+23,z,id,data);
    mc.drawLine(x+15,y+22,z,x+14,y+21,z,id,data);
    mc.drawLine(x+13,y+19,z,x+13,y+20,z,id,data);
    mc.setBlock(x+13,y+22,z,id,data);
    mc.drawLine(x+16,y+21,z,x+17,y+21,z,id,data);
    mc.drawLine(x+16,y+20,z,x+16,y+19,z,id,data);
    mc.setBlock(x+16,y+24,z,id,data);
    mc.setBlock(x+18,y+22,z,id,data);
    mc.drawLine(x+21,y+22,z,x+22,y+21,z,id,data);
    mc.drawLine(x+21,y+20,z,x+20,y+19,z,id,data);
    mc.drawLine(x+16,y+19,z,x+17,y+19,z,id,data);
    mc.drawLine(x+17,y+18,z,x+19,y+18,z,id,data);
    mc.drawLine(x+16,y+13,z,x+16,y+14,z,id,data);
    mc.drawLine(x+17,y+10,z,x+17,y+14,z,id,data);
    mc.drawLine(x+18,y+9,z,x+18,y+10,z,id,data);
    mc.setBlock(x+19,y+8,z,id,data);
    mc.drawLine(x+20,y+7,z,x+22,y+7,z,id,data);
    mc.drawLine(x+21,y+8,z,x+21,y+9,z,id,data);
    mc.drawLine(x+23,y+6,z,x+24,y+6,z,id,data);
    mc.drawLine(x+24,y+7,z,x+24,y+8,z,id,data);
    mc.drawLine(x+23,y+8,z,x+23,y+9,z,id,data);
    mc.drawLine(x+23,y+9,z,x+25,y+9,z,id,data);
    mc.setBlock(x+22,y+10,z,id,data);
    mc.setBlock(x+17,y+31,z,id,data);
    mc.setBlock(x+21,y+31,z,id,data);
    mc.drawLine(x+20,y+32,z,x+18,y+32,z,id,data);
    mc.drawLine(x+22,y+30,z,x+24,y+30,z,id,data);
    mc.drawLine(x+22,y+26,z,x+24,y+26,z,id,data);
    mc.drawLine(x+21,y+29,z,x+21,y+27,z,id,data);
    mc.drawLine(x+25,y+29,z,x+25,y+27,z,id,data);
    mc.setBlock(x+22,y+27,z,id,data);
    mc.setBlock(x+22,y+29,z,id,data);
    mc.setBlock(x+24,y+27,z,id,data);
    mc.setBlock(x+24,y+29,z,id,data);
    return 0;
}

 

标签:std,TxMinecraft,mc,111,include,con
From: https://www.cnblogs.com/wangyihang-xh/p/18061768

相关文章

  • 111. 二叉树的最小深度c
    /***Definitionforabinarytreenode.*structTreeNode{*intval;*structTreeNode*left;*structTreeNode*right;*};*/intmin(inti,intj){if(i<j)returni;returnj;}intminDepth(structTreeNode*root){......
  • 20211121杨博川《密码工程》1、2章笔记
    一二章笔记@目录一二章笔记第1章密码学研究范围思维导图知识概述1.1密码学作用1.2木桶原理1.3对手设定1.4专业偏执狂1.5威胁模式1.6密码学不是唯一解决方案1.7密码学是非常难的1.8密码学是简单的部分1.9通用攻击1.10安全性和其他设计准则1.11更多阅读材料1.12专业偏执狂练习第2......
  • 11111
    #include<bits/stdc++.h>#include"minecraft.h"#include<Windows.h>usingnamespacestd;TxMinecraftmc;intmain(){boolcon=mc.ConnectMinecraft("zk","4cd7d6e558c943c397a3a5243fa78e19");if(!con){......
  • 111
    #include<iostream>#include"minecraft.h"usingnamespacestd;TxMinecraftmc;voidset1(intx,inty,intz){mc.drawLine(x+1+1,y,z,x+2+1,y,z,143,3);mc.drawLine(x+4+1,y,z,x+5+1,y,z,143,3);mc.drawLine(x+7+1,y,z,x+8+1,y,z,143,3......
  • P1110 [ZJOI2007] 报表统计 题解
    考察点:STL的熟练运用。记:\(l_i\)表示序列中不超过\(a_i\)的最大数,\(r_i\)表示序列中超过\(a_i\)的最小数。开一个vectorinsert[N]存储\(a_i\)后面插入的所有数字。首先,我们使用一个multisets1来存储相邻元素的差的绝对值,然后再开一个multisets2来存储当前出......
  • CF111D Petya and Coloring 题解
    很明显这是一道组合题。首先特判一下,当\(m=1\)时,答案就是\(k^n\)。对于\(m>1\)的情况,我们可以得出一个结论:对于沿格子的线穿过的任何垂直线,会将棋盘分成两个非空的部分,这两个部分中的不同颜色的数量相同且总是不变。设这个不同颜色的数量为\(i\),那么左边这部分的颜色一定......
  • P1110 (平衡树实现)
    难度1还是比较板的一道题,考的是对平衡树各功能的灵活使用。首先看要求的操作,发现操作三在每次插入时求下前驱后继即可,因为如果答案不是有这个更新的,那么这个答案必定在之前计算过,所以能保证正确性。然后看操作二,发现在每次插入时,有一个原来的差不能再对答案做出贡献,并且有两个新......
  • 111
      interface声明的变量是限制对象的,对象里的属相要和上面 IIntegralRule  定义的类型一样1letobj:IIntegralRule={2action:'qwe',3actionid:'fdf',4id:123,5.....6}  这里又声明了一个变量叫  IIntegralListResponse 但是继承了 ICommon......
  • P1119 灾后重建题解
    目录思路代码\(原题传送门\)思路首先先来分析一下算法,Floyd算法的时间复杂度是\(O(n^3)\)虽然很多,但在这一题里很合适。dijkstra算法用堆优化的时间复杂度是\(O(m\logn)\),在这一题里会超时。Bellman–Ford算法的时间复杂度是\(O(mn)\),会超时。所以说这一题是能用Flo......
  • 111
    #!/bin/bash#BasicenvironmentvariablesRAINBOND_VERSION=${VERSION:-'v5.17.0'}IMGHUB_MIRROR=${IMGHUB_MIRROR:-'registry.cn-hangzhou.aliyuncs.com/goodrain'}#DefinecolorfulstdoutRED='\033[0;31m'GREEN='\033[32;1......