Detective Pikachu FrenzyExists
🗿
FrenzyExists
/ simplification_table.py
Created
November 5, 2024 18:58
A script I made based on an exam. It takes a csv table that represents the a state table, parses it, creates an implication table, reduces the states, gets the pairs and shows the new table.
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
| import pandas as pd | |
| from collections import defaultdict | |
| import argparse | |
| """ | |
| PS, 0, 1, z1, z2 | |
| A, F, D, 0, 0 | |
| B, J, C, 0, 0 | |
| C, A, F, 1, 1 | |
| D, I, B, 1, 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
| from time import sleep | |
| import sys | |
| QuestionBank = [ | |
| { | |
| "question": "I prefer working independently rather than in a team.", | |
| "pointer": ["INDEPENDENT", "TEAM_PLAYER"] | |
| }, | |
| { | |
| "question": "I am comfortable taking risks to achieve my career \ |
FrenzyExists
/ DynamicFib.txt
Last active
November 4, 2023 01:10
Recursive Fibbonaci Sequence using Dynamic Programming
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 <iostream> | |
| #include <map> | |
| std::map<int, int> dynoFib; | |
| int fibRecursive(int n) { | |
| if (n <= 2) { | |
| return 1; | |
| } else { | |
| if(!dynoFib.count(n)) { | |
| dynoFib[n] = fibRecursive(n - 1) + fibRecursive(n - 2); |
FrenzyExists
/ string-conversion.rs
Created
October 27, 2021 00:24
— forked from jimmychu0807/string-conversion.rs
Conversion between String, str, Vec<u8>, Vec<char> in Rust
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
| use std::str; | |
| fn main() { | |
| // -- FROM: vec of chars -- | |
| let src1: Vec<char> = vec!['j','{','"','i','m','m','y','"','}']; | |
| // to String | |
| let string1: String = src1.iter().collect::<String>(); | |
| // to str | |
| let str1: &str = &src1.iter().collect::<String>(); | |
| // to vec of byte |
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
| [ | |
| { | |
| "backcolor": "#2E3440", | |
| "name": "Commoplank", | |
| "author": "Pikachu", | |
| "radii": "20px", | |
| "switchMount": "cherry", | |
| "switchBrand": "gateron", | |
| "switchType": "KS-3-Red", | |
| "plate": false |