☰

Automatic Tree

Automatic Tree Claiming

当前为 2023-12-17 提交的版本，查看 最新版本。

// ==UserScript==
// @name         Automatic Tree
// @namespace    Terminator.Scripts
// @version      0.3.3
// @description  Automatic Tree Claiming
// @author       TERMINATOR
// @license      MIT
// @match        https://knolix.com/*
// @match        https://ads.knolix.com/int/*
// @match        https://scripts.cs2resellers.com/ads/?automatictree
// @grant        none
// ==/UserScript==

(function() {
    'use strict';

    function clickBtctree() {
        var btctreeElement = document.getElementById('btctree');
        if (btctreeElement) {
            btctreeElement.click();
        } else {
            console.log("Strom nenalezen")
        }
    }

    function clickSkipButton() {
        var skipButtonElement = document.querySelector('a#skip_bu2tton');
        if (skipButtonElement) {
            skipButtonElement.click();
            window.close();
        }
    }
    window.onload = function() {
        if (window.location.href.startsWith("https://scripts.cs2resellers.com/ads/?automatictree")) {
            setTimeout(function() {
                window.location.href = "https://knolix.com/";
            }, 60000 * 10);
        } else if (window.location.href.startsWith("https://knolix.com/harvest.php?reward_token=")) {
            window.location.href = "https://scripts.cs2resellers.com/ads/?automatictree";
        } else if (window.location.href.startsWith('https://knolix.com/')) {
            setInterval(function() {
                clickBtctree();
            }, 60000 * 0.3);
        } else if (window.location.href.startsWith("https://ads.knolix.com/int/")) {
            setInterval(function() {
                clickSkipButton();
            }, 60000 * 0.3);
        } else {
            window.location.href = "https://knolix.com/";
        }
    }

})();