| // made according to typst ieee template and official acm word template | |
| // --- Draft Formatting | |
| // Papers will be submitted electronically in PDF format via the web submission form. | |
| // 1. Submissions may have at most 12 pages of technical content, including all text, figures, tables, etc. Bibliographic references are not included in the 12-page limit. | |
| // 2. Use A4 or US letter paper size, with all text and figures fitting inside a 178 x 229 mm (7 x 9 in) block centered on the page, using two columns separated by 8 mm (0.33) of whitespace. | |
| // 3. Use 10-point font (typeface Times Roman, Linux Libertine, etc.) on 12-point (single-spaced) leading. | |
| // 4. Graphs and figures should be readable when printed in grayscale, without magnification. |
| class DJS{ | |
| private: | |
| vector<int> size; | |
| vector<int> parent; | |
| public: | |
| DJS(int n){ | |
| size.resize(n, 0); | |
| parent.resize(n, 0); | |
| for(int i = 0 ; i < n; i++){ | |
| parent[i] = i; |
This guide will help you set up a red team phishing infrastructure as well as creating, perform and evaluate a phishing campaign. This is the basic lifecycle of your phishingn campaign:
+---------------------+
|Get Hardware | Order / setup a vServer
+---------------------+
+---------------------+
|Setup | Install Gophish & Mail Server
+---------------------+
| # This is a short collection of tools that are useful for managing your | |
| # known_hosts file. In this case, I'm using the '-f' flag to specify the | |
| # global known_hosts file because I'll be adding many deploy users on this | |
| # system. Simply omit the -f flag to operate on ~/.ssh/known_hosts | |
| # Add entry for host | |
| ssh-keyscan -H github.com > /etc/ssh/ssh_known_hosts | |
| # Scan known hosts | |
| ssh-keygen -f /etc/ssh/ssh_known_hosts -H -F github.com |
| vector<bool> sieveOfEratosthenes(int size) { | |
| vector<bool> sieve(size+1, true); | |
| sieve[0] = false; | |
| sieve[1] = false; | |
| for (int p = 2; p * p <= size; p++) { | |
| if (sieve[p] == true) { | |
| for (int i = p * p; i <= size; i += p){ | |
| sieve[i] = false; | |
| } |
| vector<int> DIJKSTRA(int start, int end, vector<vector<int>>& edges, int n) { | |
| vector<vector<pair<int, int>>> graph(n); | |
| for (const auto& edge : edges) { | |
| graph[edge[0]].push_back({edge[1], edge[2]}); | |
| graph[edge[1]].push_back({edge[0], edge[2]}); | |
| } | |
| vector<int> distance(n, INT_MAX); | |
| priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; | |
| pq.push({0, start}); |
This is a list of the most commonly used and relevant vtubing software. The "best" will always be subjective and depend on your specific requirements. Overall, the information in this list is as accurate as I could figure it out, but there might be errors or some details might become out of date. If you find anything that needs to be corrected, please let me know. You can also note it in a comment.
Additional explanations:
| // String p # s | |
| // S: a a b # a a b a a b a a b | |
| // LPS: 0 1 0 0 1 2 3 1 2 3 1 2 3 | |
| vector<int> KMP(string& s){ | |
| vector<int> LPS(s.length(), 0); | |
| for(int i = 1 ; i < s.length(); i++){ | |
| int prev_idx = LPS[i-1]; | |
| while(prev_idx > 0 && s[i] != s[prev_idx]){ |
