This file contains hidden or 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
| alfredo@Kurisu ~ ls -l ✓ 12:09:46 | |
| total 4 | |
| drwx------ 5 alfredo staff 170 May 25 09:44 Applications | |
| -rw-r--r-- 1 alfredo staff 1803 Oct 21 11:38 CCP-Dev-openrc.sh | |
| drwx------+ 13 alfredo staff 442 Nov 4 12:09 Desktop | |
| drwx------+ 16 alfredo staff 544 Nov 4 09:13 Documents | |
| drwx------+ 10 alfredo staff 340 Nov 4 10:39 Downloads | |
| drwx------+ 72 alfredo staff 2448 Oct 12 00:09 Library | |
| drwx------+ 6 alfredo staff 204 Jul 4 00:37 Movies | |
| drwx------+ 6 alfredo staff 204 Jun 16 23:06 Music |
This file contains hidden or 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
| 1 2 3 4 5 6 7 8 9 | |
| 2 1 3 4 5 6 7 8 9 | |
| 3 1 2 4 5 6 7 8 9 | |
| 4 1 2 3 5 6 7 8 9 | |
| 6 1 2 3 4 5 7 8 9 | |
| 7 1 2 3 4 5 6 8 9 | |
| 8 1 2 3 4 5 6 7 9 | |
| 9 1 2 3 4 5 6 7 8 |
This file contains hidden or 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
| 1 9 2 3 | |
| 2 4 2 9 8 | |
| 3 6 5 7 | |
| 4 1 3 7 | |
| 6 4 8 |
This file contains hidden or 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
| import networkx as nx | |
| import matplotlib | |
| import matplotlib.pyplot as plt | |
| def read_graph(): | |
| graph_adjacency_list = { } | |
| for line in open("input.txt"): | |
| line = map(int, line.rstrip("\t\r\n").split("\t")) | |
| graph_adjacency_list.update({ line[0]: { e: 1 for e in line[1:] } }) |
This file contains hidden or 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
| 1 37 79 164 155 32 87 39 113 15 18 78 175 140 200 4 160 97 191 100 91 20 69 198 196 | |
| 2 123 134 10 141 13 12 43 47 3 177 101 179 77 182 117 116 36 103 51 154 162 128 30 | |
| 3 48 123 134 109 41 17 159 49 136 16 130 141 29 176 2 190 66 153 157 70 114 65 173 104 194 54 | |
| 4 91 171 118 125 158 76 107 18 73 140 42 193 127 100 84 121 60 81 99 80 150 55 1 35 23 93 | |
| 5 193 156 102 118 175 39 124 119 19 99 160 75 20 112 37 23 145 135 146 73 35 | |
| 6 155 56 52 120 131 160 124 119 14 196 144 25 75 76 166 35 87 26 20 32 23 | |
| 7 156 185 178 79 27 52 144 107 78 22 71 26 31 15 56 76 112 39 8 113 93 | |
| 8 185 155 171 178 108 64 164 53 140 25 100 133 9 52 191 46 20 150 144 39 62 131 42 119 127 31 7 | |
| 9 91 155 8 160 107 132 195 26 20 133 39 76 100 78 122 127 38 156 191 196 115 | |
| 10 190 184 154 49 2 182 173 170 161 47 189 101 153 50 30 109 177 148 179 16 163 116 13 90 185 |
This file contains hidden or 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
| def swap(array, first, second): | |
| array[first], array[second] = array[second], array[first] | |
| def quick_sort(array): | |
| return _quick_sort(array, 0, len(array) - 1) | |
| def _quick_sort(array, start, end): | |
| if start < end: | |
| pivot_index = partition(array, start, end) | |
| _quick_sort(array, start, pivot_index - 1) |
This file contains hidden or 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
| span { | |
| display: none; | |
| } | |
| [value="pdf"]:checked ~ [class=appendDataCheckbox]{ | |
| display: inline; | |
| } |
This file contains hidden or 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
| span { | |
| display: none; | |
| } | |
| [value="pdf"]:checked ~ [class=appendDataCheckbox]{ | |
| display: inline; | |
| } |
This file contains hidden or 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
| def merge(a, b): | |
| i = 0 | |
| j = 0 | |
| c = [] | |
| while(i < len(a) and j < len(b)): | |
| if(a[i] <= b[j]): | |
| c.append(a[i]) | |
| i += 1 | |
| else: |
This file contains hidden or 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
| import groovyx.net.http.* | |
| //if you import these classes statically, you'll be able to use the classes you import with this without qualified access | |
| //notice how we're using just POST in some calls below, for example, instead of having to do Method.POST | |
| import static groovyx.net.http.ContentType.* | |
| import static groovyx.net.http.Method.* | |
| class LoginService{ | |
| def authenticateURL = //url | |
| def decryptURL = //url |