Jump to content
MaxCheaters Official Group at Discord
--> Place your ad text here <--

Stealth

Legendary Member
 View Profile  See their activity

  • Posts

    1,178

  • Credits

    0 

  • Joined

  • Last visited

  • Feedback

    0%

 Content Type 

Posts posted by Stealth

    [L2JTool] Ridiculously Easy Buff Time Changer (Interlude)

    in Server Development Discussion [L2J]

    Posted

    hm now it didnt change times of several buffs, like wind walk, bless the body..

    but in log it says its changed hm

     

    Im checking this again.

     

    Yes I found the problem.

     

    On buffs that can be enchanted my app doesn't work well, Im going to fix this and pm you.

    <for>
      <effect count="1" name="Buff" time="7200" val="0" stackOrder="#Tab-runSpd" stackType="SpeedUp">
        <add order="0x40" stat="runSpd" val="#Tab-runSpd" />
      </effect>
    </for>
    <enchant1for>
      <effect count="1" name="Buff" time="#ench1time" val="0" stackOrder="33" stackType="SpeedUp">
        <add order="0x40" stat="runSpd" val="33" />
      </effect>
    </enchant1for>

    [L2JTool] Ridiculously Easy Buff Time Changer (Interlude)

    in Server Development Discussion [L2J]

    Posted

    Great tool, any tools like this for Hi5 ?

     

    It probably works for other chronicles too, but you need to add the new buffs inside the text files contained in the same directory as the application.

    Do it in this form Buff_name;Buff_id and it will work fine.

     

    doesnt work, its getting error while trying to cast xml comment to xml element. probably not optimized for l2jserver

     

    What error exactly I also need the source of your xml file.

    [L2JTool] Ridiculously Easy Buff Time Changer (Interlude)

    in Server Development Discussion [L2J]

    Posted

    Well for all people tired to change the time of buffs on interlude one by one and edit all those freaking xml files (like me FML), I made this tool which will save them A LOT OF TIME.

    Yeah true story, and the thing is that this tool is ridiculously easy to use, so Im gonna post pictures and video along with the tool so you can get an idea.

     

    m290g.png

     

     

    Download link: http://www.mediafire.com/download.php?mlsctttnvt1auk8 Bugfix v0.3b

     

    Bug reports and shit: sparda-x@hotmail.com or pm me here, cause I ll probably answer the mail that you send me after a year or so, thankies.

     

    HIDDEN TO PREVENT LEECHING :D LOL

    [GR]["No Kids"] Kana Kalo "Hack" Gia WiFi Pezei ?

    in Spam Topics

    Posted

    Υπάρχει ένα εργαλείο στα backtrack λέγεται Reaver είναι σχετικά νέο και μπορεί ακόμη και να βρει ευπάθειες (σε συγκεκριμένα routers) για σπάσεις WPA/WPA2 passwords.Δεν το έχω χρησιμοποιήσει συνήθως το aircrack είναι αρκετό για WEP κλειδιά, και για WPA/WPA2 αν έχεις καλό wordlist και αρκετή επεξεργαστική ισχύ.

     

    BT5 = http://www.backtrack-linux.org/downloads/

    Reaver = http://code.google.com/p/reaver-wps/

     

    Σημείωση* μιλάμε πάντα για bruteforce.

    MiniProject C# HELP

    in Programming

    Posted

    κάτι πρόχειρο αλλά δουλεύει νομίζω

    using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main()
        {
            string[] args = new string[2];
            args[0] = "username";
            args[1] = "password";

            int fAttempts = 0;

            while (fAttempts <= 3)
            {
                Console.WriteLine("Username:");
                string username = Console.ReadLine();
                Console.WriteLine("Password:");
                string password = Console.ReadLine();
                if (username == args[0] && password == args[1])
                {
                    break; //exit while
                }
                else { fAttempts++; Console.WriteLine("Login failed invalid credentials!\n"); }
            }
            if (fAttempts == 3) { Console.WriteLine("Your login attempts limit has been reached, application will now exit!"); Console.ReadLine(); return; } //Exit

            int menu = 1;
                    
            while (menu != 0)
            {
                showMenu();
                menu = Convert.ToInt32(Console.ReadLine()); //ksanadiavazei

                if (menu == 1)
                {
                    Console.WriteLine("Dwse to M:");
                    int m = Convert.ToInt32(Console.ReadLine());

                    if (m>0)
                    {
                        int sum = 0;
                        int tSum = 0;

                        int i;
                        for (i = 0; i <= m; i++)
                        {
                            if (sum >= m) break;
                            sum = sum * 2 + 1; // ((0x2) + 1 ),(1x2)+1) klp klp
                            tSum += sum;
                           // Console.WriteLine(sum + "\n");
                        }
                        Console.WriteLine(tSum + "\n");
                    }
                }
                else if (menu == 2)
                {
                    Console.WriteLine("Dwse prwto akeraio:");
                    int a = Convert.ToInt32(Console.ReadLine());
                    Console.WriteLine("Dwse deutero akeraio:");
                    int b = Convert.ToInt32(Console.ReadLine());
                    Console.WriteLine(gcd(a, b));
                }
                else if (menu == 3)
                {
                    int i = 100;
                    for (i = 100; i <= 999; i++)
                    {
                        int f = (i / 100) % 10;
                        int s = (i / 10) % 10;
                        int t = i % 10;
                        int sum = f + s + t;
                        if (i % sum == 0) Console.WriteLine(i+",");
                    }
                    Console.WriteLine("\n");
                }
                else if (menu == 0)
                {
                    Console.WriteLine("The application will not exit, you typed 0!");
                    Console.ReadLine();
                    return;
                }
            }

        }

        static int gcd(int u, int v)
               {
                // simple cases (termination)
                 if (u == v)
                 return u;
                if (u == 0)
                 return v;
                if (v == 0)
                 return u;

              // look for factors of 2
                if (u%2==0) // u is even
                if (v%2==1) // v is odd
                return gcd(u >> 1, v);
                else // both u and v are even
                return gcd(u >> 1, v >> 1) << 1;
                if (v%2==0) // u is odd, v is even
                return gcd(u, v >> 1);

                // reduce larger argument
                if (u > v)
                return gcd((u - v) >> 1, v);
                return gcd((v - u) >> 1, u);
                }

        static void showMenu()
        {
            Console.WriteLine("MiniProject C#\n");

            Console.WriteLine("1 - Ypologismos Ginomenou");
            Console.WriteLine("2 - Megistos Koinos Diairetis");
            Console.WriteLine("3 - 3psifioi Arithmoi Harshad");
            Console.WriteLine("0 - Exit\n");

            Console.Write("Epiloges (1,2,3,or 0): ");
        }
    }
}

     

    se VS 2008

×
×
  • Create New...