Automatic Tree

Automatic Tree Claiming
As of 2023-12-15. See the latest version.
Ask a question, post a review, or report the script.
Wrap lines
// ==UserScript==
// @name         Automatic Tree
// @namespace    Terminator.Scripts
// @version      0.3.2
// @description  Automatic Tree Claiming
// @author       TERMINATOR
// @license      MIT
// @match        https://knolix.com/*
// @match        https://ads.knolix.com/int/*
// @match        https://scripts.cs2resellers.com/ads/
// @grant        none
// ==/UserScript==

(function() {
    'use strict';

    function clickBtctree() {
        var btctreeElement = document.getElementById('btctree');
        if (btctreeElement) {
            btctreeElement.click();
        } else {
            window.location.reload();
        }
    }

    function clickSkipButton() {
        var skipButtonElement = document.querySelector('a#skip_bu2tton');
        if (skipButtonElement) {
            skipButtonElement.click();
            window.close();
        }
    }

    if (window.location.href.startsWith("https://scripts.cs2resellers.com/ads/")) {
        setTimeout(() => {
            window.location.href = "https://knolix.com/";
        }, 60000 * 2)
    } else if (window.location.href.startsWith("https://knolix.com/harvest.php?reward_token=")) {
        window.location.href = "https://scripts.cs2resellers.com/ads/";
    } else if (window.location.href.startsWith('https://knolix.com/')) {
        setInterval(() => {
            clickBtctree();
        }, 60000 * 0.5);
    } else if (window.location.href.startsWith("https://ads.knolix.com/int/")) {
        setInterval(() => {
            clickSkipButton();
        }, 60000 * 0.5);
    } else {
        window.location.href = "https://knolix.com/";
    }

})();