Solzhenitsyn

Fuck that noise.

$7

And then you factor inflation. And the fact that without credit, you won't get a good fixed rate on your mortgage. And that in the post-recession world, financial institutions are less likely to give you loans unless you have excellent credit with a large transaction history. And then Bob is sad. Sorry Bob, you tried.

Only retards care about post count. Don't post unless you have something to say.

Can probably run 6 clients running well written scripts. 8-10 if you are willing to run in low resource mode.

PCPartPicker part list / Price breakdown by merchant CPU: AMD FX-8350 4.0GHz 8-Core Processor ($151.98 @ Newegg) Motherboard: ASRock 970M PRO3 Micro ATX AM3+/AM3 Motherboard ($37.24 @ Newegg) Memory: Team Vulcan 16GB (2 x 8GB) DDR3-1600 Memory ($61.88 @ OutletPC) Storage: Western Digital VelociRaptor 300GB 2.5" 10000RPM Internal Hard Drive ($32.98 @ Amazon) Video Card: EVGA GeForce GTX 750 Ti 2GB Video Card ($119.13 @ B&H) Case: Xion XON-310_BK MicroATX Mid Tower Case ($21.98 @ Newegg) Power Supply: EVGA 500W 80+ Bronze Certified ATX Power Supply ($42.33 @ OutletPC) Total: $467.52 Prices include shipping, taxes, and discounts when available Put together a build for you that will be better than buying a high memory server. Should give you a good starting place. Some people hate AMD CPUs, but it's honestly unwarranted. For the cost, they are great CPUs. They run hot if you overclock though, so keep that in mind.

I don't know, some dudes want fat girls wearing whale penis strap-ons to poop on their chests while humming the Soviet anthem. Alternate solution: coz dey so...

Someone who spends an unhealthy amount of brainpower thinking about anime and Japanese culture. (They are typically soft and pasty, except for their massive forearms, which develop after spending countless hours jerking off into their waifu body pillows)

What level is the agility?

If you are willing to work hard to learn (read: not be spoonfed code snippets) you can ask me questions. @@Imateamcape @@Juggles ...and others are also helpful users.

I think that they are the same, but personally I would go with the for-loop version (since the postfix operators seem to fit the convention of a for loop). Side note; since you're the first person I've met who has done any assembly, check out this pseudo bubble sorting algorithm I implemented for fun. .386 ; Identifies minimum CPU required. .MODEL flat, stdcall ; Flat -> protected mode program, StdCall -> Can call Windows system functions. .STACK 4096 ; Allocates 4096 bytes (1000h) for the stack. ; == Prototypes == ExitProcess PROTO,dwExitCode:DWORD ; From Win32, exits to Windows. Clrscr PROTO ; Irvine32, clears screen of contents. ReadChar PROTO ; Irvine32, pauses runtime until a key is run. bubbleSort PROTO, arrayLoc:PTR DWORD, arraySize:DWORD ; Performs a bubble sort (O(n^2)) on a specified region of memory. ; == Data Segement == .data array DWORD 1,3,3,4,5 ; Label to be sorted. ; == Code Segment == .code ; * Bubble Sort Procedure - Sorts a given memory region in descending order. Arguments: Pointer to array, size of array. ; A bubble sort marches through an array, comparing the current and next element. When the next element is greater than ; the current element, the two elements are swapped. The process is repeated as many times as is needed to successfully ; march through the array without finding an out of place element. bubbleSort PROC USES eax ebx ecx esi, arrayLoc:PTR DWORD, arraySize:DWORD sub arrayLoc, type DWORD; Move the pointer back by four bytes. jmp setup ; Begin instructions. swap: ; The instructions in this label will swap the values of the current and next elements. xchg eax, [esi+4] ; Correct the value at next element mov [esi], eax ; Correct the value at current element mov ebx, 1 ; A value has been modified, so raise flag. loop march ; Continue marching if we are not at the end, otherwise fall through to setup next run. setup: ; The instructions in this label will set/reset program for it's next march. mov ebx, 0 ; Ebx will be used as a flag. When a swap is performed, ebx=1. When ebx=1, instead of exiting we march again. mov esi, arrayLoc ; Set esi to the location in memory. mov ecx, arraySize ; Set loop counter to the number of elements... dec ecx ; ...less one. march: ; The instructions in this label will iterate through the memory region. If currElem<nextElem, then call swap label. add esi, type DWORD ; Look at the next element mov eax, [esi] ; Store current element in eax cmp eax, [esi+4] ; Compare current element and next element. jl swap ; If currElement<nextElement, then swap values. loop march ; If we aren't done iterating through the array, then continue working. Otherwise, fall through. done: ; The instructions in this label will check to see if the memory region is sorted. cmp ebx, 0 ; If we made a swap operation, then ebx=1. jne setup ; If a swap operation was made, then march again. ret ; Otherwise, return. bubbleSort ENDP main proc call Clrscr ; Clear the screen invoke bubbleSort, OFFSET array, LENGTHOF array ; Run the bubble sort call ReadChar ; Pauses the runtime until a key is pressed. invoke ExitProcess, 0 ; Exit runtime. main ENDP END main Using Irvine32 lib for user I/O.

int main() { int* a; a = malloc(sizeof(int)); *a = 'a'; int b = 16; if (&b == a) { // &b is a pointer to the address where the integer literal bound to b is stored // do something } return 0; } I think that this is how you do it -- I started with ASM/CPP, but I don't even have gcc installed any more so I can't actually check to see if this will compile.

It looks fine, you've implemented a bubble sort that also sets duplicate pointers to null. I haven't used C before (only C++14, and my exposure is limited at that) so don't take my advice with much seriousness but I'm surprised that your teacher is having you use strcmp to compare pointers. Is that normal? If they are giving you string literals, I would have thought that the comparison should be performed by dereferencing pointers. This would save you an assignment operation and a fetch operation which as far as I know is much slower than handling as many operations as possible in your registers. But again, I feel the need once again to declare my general ignorance on the matter and if there is someone with more education than me I would defer to their opinion.

capital theta(n^2) although i know that you don't care about efficiency right now. What do you think using address the numeric value of each address as a basis to perform a quicksort, and then you march through your array one time to search for duplicates? That would bring you down to capital theta(n log(n)), but maybe the k_1 constant will be high enough that you lose overall efficiency.

...oh.

Edit: Really not sure where to post this, but I would really like to get feedback from more programmers who are more knowledgeable than I am so that I can continue to progress in the correct direction. I started programming about four months ago, and I have found that the best way to improve problem solving abilities is to solve difficult problems. I don't have anyone who I can compare my answers with. If anyone else would like to solve problems that they find interesting, and then discuss strategies and techniques, I would really appreciate it. I have been using Python, but I think that learning about specific language features is less important than learning about concepts which can be applied to any (most?) languages. I am also avoiding the use of any non-builtin function, as that is cheating. Problem #1: Write a function which computes every combination of n-length integers, such that each n-digit integer uses digit values of only 1 and 9, and no integer contains two or more consecutive ones. Examples: >> no_consecutive_ones(2): 99 91 19 >> no_consecutive_ones(3): 999 991 919 199 191 >> no_consecutive_ones(4): 9999 9991 9919 9199 9191 1999 1991 1919 Solutions: Python 3 (@Solzhenitsyn) def no_consecutive_ones(n): cache = {} def get_list_of_digits(n): if n == 0: # Base case - return an empty list if n is zero as there are no valid values. return [[]] if n == 1: # Base case - return a list containing singleton lists of 9 and 1, which are the only return [[9], [1]] # valid values for an integer of length 1. else: if n - 1 not in cache: # Avoid making duplicate recursive calls be storing the results of previous cache[n - 1] = get_list_of_digits(n - 1) # recursive calls in a dictionary. if n - 2 not in cache: cache[n - 2] = get_list_of_digits(n - 2) nines_first = cache[n - 1] ones_first = cache[n - 2] return [[9] + previous_digits for previous_digits in nines_first] \ + [[1, 9] + previous_digits for previous_digits in ones_first] # Convert a list of digits into an integer. def combine_digits(digits, k=0): if len(digits) == 0: return k else: return combine_digits(digits[1:], k + digits[0] * 10 ** (len(digits) - 1)) return [combine_digits(digits) for digits in get_list_of_digits(n)] ''' Remarks: A call to n-2 will always yield a list of lists where each sublist has one fewer element than a call to n-1. With an argument of 1, the following values are valid: - 9 - 1 With an argument of 2, the following values are valid: - 99 - 91 - 19 Wtih an argument of 3, the following values are valid: - 999 - 991 - 919 - 199 - 191 Notice: - All results of n=3 beginning with 9 be produced by adding a digit of 9 to the beginning of each value produced in the call of n=2. - All results of n=3 beginning with 1 can be produced by adding the two digits of 1,9 to the beginning of each value produced in the call of n=1. ''' Please leave me feedback on my code.

As if having a non-grey name or an avatar means anything.

Account also has 60 attack.

It's because I'm using a mouse listener to to add user input to the event queue so that they will not interrupt the script logic. I wish you wouldn't assume the worst about my intentions, especially considering I typically make scripts for my own personal use.

Does anyone know how to do this? There are some get methods in the client class, but I don't see any way to modify their values. Edit: Specifically, I want to be able to force the client to ignore user inputs and to force random dismissal on.

@@Lemons EDIT: Nevermind, I wasn't paying attention. --- Without having looked at his code, if he's "lagging out", I suspect that the problem isn't that he's making a lot of calls to random or to sleep. There is probably a null pointer error somewhere, and if a gun were pointed to my head and I had to throw out a wild guess, it would be that he isn't doing a nullity check on a player object before interacting with it. @@TheGreatests You don't learn new skills by being lazy and waiting until you are spoon fed.

As usual, you demonstrate ignorance by pretending to know that which you know nothing about. Private, local, and internal are synonyms, as are public and external, and are all acceptable for use. See section 3 of RFC 1918, which set the standard for private network address assignment. As for for last comment about internal addresses doing nothing...

You have no way of knowing that chain bans are caused by concurrent connections.

@@TrapMan Each one of your devices has it's own private IP, which is assigned by the router. Your router has a public IP which is assigned by your ISP. If you aren't using a proxy, then each client will establish a connection to Jagex's servers, all of which will show your public IP. No one knows how Jagex decides to ban accounts. Personally I'm of the opinion that Jagex doesn't the location from which a originates from as a significant part of their banning algorithm (if at all), because there are too many instances where that would raise a false positive (shared apartment connections, university/work networks, public networks, etc). I also think that many people buy a shitty $2.00 proxy, which is probably being oversold to 20 other bots, and then think they are safe. If anything, this is even worse than using no proxy at all.

I don't know why you guys are being dicks to him. OP acknowledges the fact that he knows little, and wants to learn, so answer his question. Derp. Your router assigns a private IP to each of your devices. Your ISP assigns your router an IP. I drew you a beaaaooooteeefool diagram. @Trapman Edit: To answer your question, This is what it looks like when device 1 is routing traffic through a proxy server and device 2 is not. Your router is assigned a public IP by your ISP. In the case where you are using a proxy server, that proxy server also has a public IP. In this scenario, if devices 1 and 2 ping the same server, that server will see the public IP addresses of the proxy server from device 1, and that proxy server sees your public IP. That server will see the public IP address of your network when you ping it using device 2.