Position: Home page » Equipment » Write a similar mining program with code

Write a similar mining program with code

Publish: 2021-05-13 09:00:18
1.

Ha Yu miner

you can mine with Windows system or Linux system

Windows system mining, directly download the installation software, and then one click mining, here's about Linux system mining

to use the Linux system for mining, it only needs two steps to use the services of Harbin fish miner

< UL >
  • open the website, enter the mobile phone number, select how many CPUs you want to use to mine, the default is to use 50% CPU to mine, click to generate your exclusive command and

  • only two steps, you can mine on Linux system, the money you dig only needs to go to the website of hayu miner, enter your mobile phone number to withdraw

    2.

    a new customer recently consulted with sine security company, saying that his server often fails to open the website of the card, and the remote connection to the server is extremely slow. Sometimes the Ping value reaches 300-500, and he often switches. After listening to the customer's words,

    will generally judge that he has been attacked by CC + DDoS mixed traffic, It's strange to say that there is no traffic attack on the computer room. It's not a traffic attack, but it also causes the server card and website to fail to open. What kind of attack is this? In order to solve the problem of

    client server card, we immediately arranged a security engineer to carry out security detection and deployment on his Linux server

    {rrrrrrr}

    Mining Trojan horse is also designed. If the mining process is forced to stop by customers, it will automatically start to continue mining to achieve uninterrupted mining.

    careful inspection shows that it is through setting the hourly task plan, remotely downloading shell mining Trojan horse, and then executing, Check whether the current process exists or not. If not, start the Trojan horse to mine

    a detailed security inspection was carried out on the client's Linux server. It was found that fortunately, there was no encrypted server data, and the worm was infected with the disease

    virus. If the data was encrypted, the loss would be great. The client was a platform, and the client's data was very important. After finding out the mining Trojan horse,

    do customers need to know how the server is attacked? Was the Trojan horse uploaded? It can prevent the attack

    in the later stage

    through the security detection and analysis of our security engineers, we found that the server uses Apache Tomcat environment, the open architecture of the platform is JSP + Oracle database, and Apache Tomcat uses the version of 2016, which leads to the serious remote command execution vulnerability of Apache, Through this vulnerability, the intruder can directly invade the server and get the administrator permission of the server,

    sine security engineer immediately repairs the Apache vulnerability and clears the Trojan horse. So far, the problem has been solved, the client server

    runs stably, and the network station opens normally

    3. EGD network generates new EGD through "mining". In essence, the so-called "mining" is to solve a complex mathematical problem with computer to ensure the consistency of EGD network distributed accounting system. EGD network will automatically adjust the difficulty of mathematical problems, so that the whole network can get a qualified answer every 2.5 minutes. Then the EGD network will generate a certain amount of EGD as a reward to reward the person who gets the answer. When EGD was born on January 1, 2014, each reward was 50 EGDS. Two and a half minutes after its birth, the first batch of 50 EGDS were generated, and the total amount of money at this time was 50. Then EGD increased at a rate of about 50 per 2.5 minutes. When the total amount reaches 42 million (50% of 84 million), the bounty will be halved to 25. When the total amount reaches 63 million (21 million new output, or 50% of 4200), the bounty will be further halved to 12.5.
    4.

    小游戏2048源码:

    #include<stdio.h>

    #include<stdlib.h>

    #include<conio.h>

    #include<time.h>

    #include<windows.h>

    int jsk( ); //计算空格数

    void rsgm( ); //重置游戏

    void inkey( ); //按键输入

    void left( ); //向左移动

    void right( ); //向右移动

    void up( ); //向上移动

    void down( ); //向下移动

    void show( ); //输出界面

    void adnum( ); //添加随机数

    void yes( ); //游戏是否结束(1是0否)

    void gtxy(int x, int y); //控制光标位置的函数

    int a[4][4]; //存储16个格子中的数字

    int score = 0; //每局得分

    int best = 0; //最高得分

    int ifnum; //是否需要添加数字(1是0否)

    int over; //游戏结束标志(1是0否)

    int i,j,k;

    int main( )

    { rsgm( ); //重置游戏

    inkey( ); //按键输入

    return 0;

    }

    void setColor(unsigned short ForeColor = 7, unsigned short BackGroundColor = 0)

    { HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);

    SetConsoleTextAttribute(handle, ForeColor + BackGroundColor * 0x10);

    } //用于控制字符颜色的函数

    void rsgm( ) //重置游戏

    { score = 0; ifnum = 1; over = 0; srand((unsigned)time(0)); //启动随机数发生器

    int n = rand( ) % 16; //随机函数产生0-15的数字

    for (i = 0; i < 4; i++)

    {for (j = 0; j < 4; j++)

    { if (n == 0) { int k = rand( ) % 3; if (k == 0 || k == 1) { a[i][j] = 2; }

    else { a[i][j] = 4; } n--; }

    else { a[i][j] = 0; n--; }

    }

    }

    adnum( );

    system("cls");

    CONSOLE_CURSOR_INFO cursor_info={1,0}; //以下两行是隐藏光标的设置

    SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE),&cursor_info);

    setColor(14, 0); //设置字体淡红色,背景为黑色

    printf(" 2048小游戏"); setColor(7, 0); //恢复白字黑底

    printf(" ┌──────┬──────┬──────┬──────┐");

    printf(" │ │ │ │ │");

    printf(" ├──────┼──────┼──────┼──────┤");

    printf(" │ │ │ │ │");

    printf(" ├──────┼──────┼──────┼──────┤");

    printf(" │ │ │ │ │");

    printf(" ├──────┼──────┼──────┼──────┤");

    printf(" │ │ │ │ │");

    printf(" └──────┴──────┴──────┴──────┘");

    show( );

    }

    void show( ) //输出界面

    { for(i=0;i<4;i++)

    for(j=0;j<4;j++)

    { gtxy(7*j+9,2*i+4); //gtxy(7*j+9, 2*i+4)是光标到指定位置输出数字

    if(a[i][j]==0){printf(" "); setColor(7, 0); printf("│");}

    else if(a[i][j]<10){ if (a[i][j] == 2) {setColor(14, 0); }

    else if (a[i][j] == 4) {setColor(13, 0); }

    else if (a[i][j] == 8) {setColor(12, 0); }

    printf(" %d ", a[i][j]); setColor(7, 0); printf("│");

    }

    else if (a[i][j] < 100){if (a[i][j] == 16) {setColor(12, 0); }

    else if (a[i][j] == 32) {setColor(10, 0); }

    else if (a[i][j] == 64) {setColor(2, 0); }

    printf(" %d ", a[i][j]); setColor(7, 0); printf("│");

    }

    else if (a[i][j] < 1000) {if (a[i][j] == 128) {setColor(9, 0); }

    else if (a[i][j] == 256) {setColor(1, 0); }

    else if (a[i][j] == 512) {setColor(13, 0); }

    printf(" %d ", a[i][j]); setColor(7, 0); printf("│");

    }

    else if (a[i][j] < 10000) {if (a[i][j] == 1024) {setColor(5, 0); }

    else {setColor(15, 0); }

    printf(" %d ", a[i][j]); setColor(7, 0); printf("│");

    }

    }

    if (jsk( ) == 0)

    { yes( ); if (over) { gtxy(9,12); setColor(10, 0);

    printf(" 游戏结束是否继续? [ Y/N ]:"); }

    }

    }

    void inkey( ) //按键输入

    { int key;

    while (1)

    { key = getch( );

    if (over) { if (key == 89|| key == 121) {rsgm( ); continue; }

    else if (key == 78|| key == 110) { return; }

    else continue; }

    ifnum = 0;

    if(key==224)key=getch( );

    switch (key)

    { case 75: left( ); break;

    case 77: right( ); break;

    case 72: up( ); break;

    case 80: down( );break;

    }

    if (score > best) { best = score; }

    if (ifnum) { adnum( ); show( ); }

    }

    }

    int jsk( ) //计算空格数

    { int n = 0;

    for (i = 0; i < 4; i++)

    { for (j = 0; j < 4; j++) { if ( a[i][j] == 0) {n++;} } }

    return n;

    }

    void left( ) //向左移动

    { for (i = 0; i < 4; i++)

    {for (j = 1, k = 0; j < 4; j++)

    { if (a[i][j] > 0)

    { if ( a[i][k] == a[i][j])

    { a[i][k] *= 2; k++;

    score = score + 2 * a[i][j];

    a[i][j] = 0; ifnum = 1; }

    else if ( a[i][k] == 0) { a[i][k] = a[i][j]; a[i][j] = 0; ifnum = 1; }

    else { a[i][k + 1] = a[i][j]; if ((k + 1) != j) { a[i][j] = 0; ifnum = 1; }

    k++; }

    }

    }

    }

    }

    void right( ) //向右移动

    {for (i = 0; i < 4; i++)

    {for (j = 2, k = 3; j >= 0; j--)

    {if (a[i][j] > 0)

    { if (a[i][k] == a[i][j])

    {a[i][k] *= 2; k--; score = score + 2 * a[i][j]; a[i][j] = 0; ifnum = 1; }

    else if ( a[i][k] == 0) {a[i][k] = a[i][j]; a[i][j] = 0; ifnum = 1; }

    else { a[i][k - 1] = a[i][j]; if ((k - 1) != j) { a[i][j] = 0; ifnum = 1; } k--; }

    }

    }

    }

    }

    void up( ) //向上移动

    {for (i = 0; i < 4; i++)

    {for (j = 1, k = 0; j < 4; j++)

    {if (a[j][i] > 0)

    {if ( a[k][i] == a[j][i]) { a[k][i] *= 2; k++;score = score + 2 * a[j][i];

    a[j][i] = 0; ifnum = 1; }

    else if ( a[k][i] == 0) { a[k][i] = a[j][i]; a[j][i] = 0; ifnum = 1; }

    else { a[k + 1][i] = a[j][i]; if ((k + 1) != j) { a[j][i] = 0; ifnum = 1; }

    k++; }

    }

    }

    }

    }

    void down( ) //向下移动

    { for (i = 0; i < 4; i++)

    {for (j = 2, k = 3; j >= 0; j--)

    {if (a[j][i] > 0)

    {if (a[k][i] == a[j][i])

    {a[k][i] *= 2; k--;score = score + 2 * a[j][i]; a[j][i] = 0; ifnum = 1; }

    else if (a[k][i] == 0) {a[k][i] = a[j][i]; a[j][i] = 0; ifnum = 1; }

    else {a[k - 1][i] = a[j][i];

    if ((k - 1) != j) {a[j][i] = 0; ifnum = 1; } k--; }

    }

    }

    }

    }

    void adnum( ) //添加随机数

    { srand(time(0)); //启动随机数发生器

    int n = rand( ) % jsk( );

    for (int i = 0; i < 4; i++)

    {for (int j = 0; j < 4; j++)

    { if (a[i][j] == 0) { if (n != 0) { n--; }

    else {int k = rand() % 3;

    if (k == 0 || k == 1) {a[i][j] = 2; return; }

    else {a[i][j] = 4; return; } }

    }

    }

    }

    }

    void yes( ) //游戏是否结束

    { for (int i = 0; i < 4; i++)

    {for (int j = 0; j < 3; j++)

    {if (a[i][j] == a[i][j + 1] || a[j][i] == a[j + 1][i]) {over = 0; return; }}

    }

    over = 1;

    }

    void gtxy(int x, int y) //控制光标位置的函数

    { COORD coord;

    coord.X = x;

    coord.Y = y;

    SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), coord);

    }

    5. Golden finger CMF code file suffix should be changed to XXX. CMF, such as: mhp3. CMF is not in TXT format
    you can first the code from the Internet to the TXT text document, and then change the suffix to CMF, put it into the CMF folder, and then call out in the game.
    6.

    numbers=[]

    while True:

    n=input()

    numbers.append(n)

    if len(numbers)==5:

    numbers.sort(reversed=False)

    print(numbers)

    break

    7. Unknown_Error
    8. This is not good. Let's search it
    9. Vb series of simple Notepad proceres, University, do not know in, I go back to find, you leave a mailbox. I suggest you add some points, "and write down its purpose and the meaning of the code program", which is very time-consuming and energy-consuming. If I don't add it, I'll just give you the code, use it, and don't explain it to you. I'm too tired
    10. Code, and finally get the result of the process. Although the computer is very powerful. It can be used for you to surf the Internet, play games, manage the company's personnel relations, etc., but without a program, it is like a pile of scrap iron, ignoring the "orders" we give it. So, we have to tame it only through one way - the program, which is the only way we communicate with the computer.
    Hot content
    Inn digger Publish: 2021-05-29 20:04:36 Views: 341
    Purchase of virtual currency in trust contract dispute Publish: 2021-05-29 20:04:33 Views: 942
    Blockchain trust machine Publish: 2021-05-29 20:04:26 Views: 720
    Brief introduction of ant mine Publish: 2021-05-29 20:04:25 Views: 848
    Will digital currency open in November Publish: 2021-05-29 19:56:16 Views: 861
    Global digital currency asset exchange Publish: 2021-05-29 19:54:29 Views: 603
    Mining chip machine S11 Publish: 2021-05-29 19:54:26 Views: 945
    Ethereum algorithm Sha3 Publish: 2021-05-29 19:52:40 Views: 643
    Talking about blockchain is not reliable Publish: 2021-05-29 19:52:26 Views: 754
    Mining machine node query Publish: 2021-05-29 19:36:37 Views: 750