300Thousand
Members-
Content Count
815 -
Last visited
Content Type
Profiles
Forums
Calendar
Gallery
Blogs
Store
Articles
Downloads
Classifieds
Everything posted by 300Thousand
-
[supreme] AMAZON GIFTCARD CODES GENERATOR + CHECKER (FOR .COM ONLY))
300Thousand replied to Putin's topic in Premium Tools
thanks brodda :) -
Atom,Kate and vim for coding :) and notepad for normal Text file stuff
-
did you get your money back with infinity upgrade?
-
[hide]https://anonfile.com/Rd53u5v9b4/300k_GAMING_COMBO_txt[/hide] APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
[hide]https://pastr.io/view/Wo9ujR[/hide] all worked when posted :) APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
Click on the lock Icon in the Editor and Paste your url in there so it is not public for everyone Another tip Upload your File on anonfile and the Put the link from anonfile in pastr.io because pastr doesnt load when you have to many accounts copy pasted
-
i started working when i was 16 but only in school holidays that money was enough for me for a year :D earned around 2-3k in around 2 months.
-
LINK IS DEAD HAVE NO ACCESS TO THE ACCOUNT
-
welcome, if you have some questions how some tools works or something feel free to ask me try to help as good as i can :)
-
pc specs? get urls with dork searcher ez and import them to sqli dumper 8.3 modified version from antileech. dont put your threads to high
-
dont use 2.4.4 that version is unstable and has some known issues use 2.1.6 or if you can get it from somewhere than use newer version than 2.4.4 but 2.1.6 is also uploaded in this forum
-
[hide]https://anonfile.com/0fN6t1vcb2/300k_GAMING_txt[/hide] APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
[hide]https://anonfile.com/0fN6t1vcb2/300k_GAMING_txt[/hide] APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
Any preference for brand? DM me on Discord: Rocapixx#3983 I'm new on this fórum, trying to build some rep. Payment after shipment is confirmed Steelseries,Logitech or roccat i dont care tbh i just want a new gaming mouse :D i checked your thread and it was a refunding service the thing is are you also doing se's or only refunds? i already did 4 refunds with my paypal account i dont want it to get limited so now refund service but if you do SE i will add you on discord:) i will add you on discord if you se
-
no theser were just for the extra spaces if you need 200gb there should be nothing interesting in them no theser were just for the extra spaces if you need 200gb there should be nothing interesting in them
-
[WORKING] [HQ] Corsair SE Method | Working as of FEB 16 / 2019
300Thousand replied to Code76's topic in Social Engineering
thank you very much i want to start with the se shit :D -
[hide]https://anonfile.com/d9Bfsav8b1/340k_combo_txt[/hide] APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
Hi, i am right now using a roccat kone pure but the left click button is not working correctly sometimes it makes 2-3 clicks that means i need a new mouse for gaming and to work on my pc. write me a private message and i will give you detailed information :) would pay with paypal or maybe with bitcoin.
-
thank you very much and dont sell your key gen :D
-
[hide]https://pastr.io/view/eX6Qnz [/hide] Worked when posted dont hate me if some not work anymore:) APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
[hide]30gb lana rain porn LANA RAIN LINK REMOVED BECAUSE DOESNT WORK 39gb Hentai and normal porn https://mega.nz/#F!WExF2A7a!ZB4NP50DJRoev7C9LxCEiw 820gb porn REMOVED BECAUSE LINK DOESNT WORK ANYMORE 27gb porn https://mega.nz/#F!m4ZUgI7Z!7MjKKDHHtSQmFgO21k7Z1Q [/hide] and i did not check anything so there also could be weird shit dont know how long the links will work till the owner notice it if someone has a better method for getting links permanent let me know i did this link sharing thing for my first time :) APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
[hide]https://pastr.io/view/vSlHwn[/hide] APPRECIATE MY WORK WITH A LIKE. LEECHERS=REPORTED. AND LEECHER COMMENTS LIKE "thanks or only quote of my thread" GETS ALSO REPORTED.
-
Hello i have a program where i needed to add 3 functions to it. sum up elements, insert at end and delete at front. The rest was already written from my teacher. Now i could do the first 2 functions they are in bottom of the code but i dont know how i could do the last function. the last function is under the main function i tried some shit but thats soooooo wrong. Some text is on german but you should still understand everything Pls help me Here is the code: #include #include struct node { int number; struct node *next; }; struct node *insert_at_head(int x, struct node *list); void display_list(struct node *list); int sum_up_elements(struct node *list); struct node *insert_at_tail(int x, struct node *list); int main() { struct node *my_list = NULL; my_list = insert_at_head(3, my_list); my_list = insert_at_tail(15, my_list); my_list = insert_at_tail(-4, my_list); my_list = insert_at_tail(99, my_list); display_list(my_list); printf("the sum of the elements: %d\n",sum_up_elements(my_list)); return(0); } struct node *delete_at_head(struct node *z){ struct node *current_node; struct node *previous_node; if(z==NULL){ printf("Liste ist empty\n"); } else current_node=z; z=z->next; printf("%d got deleted",current_node->number); free(current_node); } struct node *insert_at_head(int x, struct node *z) { struct node *new_node = malloc(sizeof(struct node)); if (new_node == NULL) { printf("Fehler bei der Speicherallokation\n"); return(NULL); } new_node->number = x; new_node->next = z; return(new_node); } void display_list(struct node *z) { while (z != NULL) { printf("%d ", z->number); z = z->next; } printf("\n"); } int sum_up_elements(struct node *z) { int sum=0; for(;z->next!=NULL;z=z->next){ sum +=z->number; } return(sum); } struct node *insert_at_tail(int x, struct node *list) { struct node *new_node=malloc(sizeof(struct node)); if(new_node==NULL){ printf("Fehler bei der Speicherallokation\n"); return(NULL); } new_node->number=x; new_node->next=NULL; if(list==NULL) return(new_node); struct node *head=list; while(list->next!=NULL) list=list->next; list->next=new_node; return(head); }