This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
cl_crosshairalpha "153" | |
cl_crosshaircolor "4" | |
cl_crosshaircolor_b "50" | |
cl_crosshaircolor_r "50" | |
cl_crosshaircolor_g "250" | |
cl_crosshairdot "0" | |
cl_crosshairgap "-3" | |
cl_crosshairsize "3" | |
cl_crosshairstyle "4" | |
cl_crosshairusealpha "1" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Atom |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#define SIZE 10 | |
int i; | |
int array[SIZE] = {1, 5, 9, 59, 19, 950, 124, 4, 555, 512}; | |
int selection_sort(int a[], int n) { | |
if (n == 1) { | |
return 0; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
unbindall | |
bind "1" "slot1" | |
bind "2" "slot2" | |
bind "3" "slot3" | |
bind "5" "slot5" | |
bind "9" "slot9" | |
bind "a" "+moveleft" | |
bind "b" "buymenu" | |
bind "c" "use weapon_knife;use weapon_smokegrenade" | |
bind "d" "+moveright" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
struct nodo { | |
int chiave; | |
struct nodo *prec, *succ; | |
}; | |
typedef struct nodo nodo; | |
int main() { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Node* Reverse(Node *head) | |
{ | |
Node *current_node = head, *next_node; | |
head = NULL; | |
while (current_node != NULL) { | |
next_node = current_node->next; | |
current_node->next = head; | |
head = current_node; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
struct nodo { | |
int chiave; | |
struct nodo *prec, *succ; | |
}; | |
typedef struct nodo nodo; | |
struct paridispari { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Merge two sorted lists A and B as one linked list | |
Node is defined as | |
struct Node | |
{ | |
int data; | |
struct Node *next; | |
} | |
*/ | |
Node* MergeLists(Node *headA, Node* headB) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Knowing that max length of linked list is 100 (was part of the problem text) | |
int HasCycle(Node* head) | |
{ | |
if (head == NULL || head->next == NULL) { | |
return 0; | |
} | |
int sum = 0; | |
while (head->next != NULL && sum <= 100) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Find merge point of two linked lists | |
Node is defined as | |
struct Node | |
{ | |
int data; | |
Node* next; | |
} | |
*/ | |
int FindMergeNode(Node *headA, Node *headB) |
OlderNewer