SYMBOL INDEX (39 symbols across 16 files) FILE: submissions/danielsalles/problema-1.cpp type Seed (line 5) | struct Seed { method Seed (line 9) | Seed(int c, int p, int s) : cost(c), profit(p), space(s) {} function calculateMaxProfit (line 12) | int calculateMaxProfit(const std::vector& seeds, int availableSpac... function main (line 25) | int main() { FILE: submissions/devmessias_01_numba_AOT/aot/knapsack.py function knapsack (line 9) | def knapsack(items, capacity): FILE: submissions/diogosm/problema-1.py function calc_lucro (line 16) | def calc_lucro(n_aux, s_aux): FILE: submissions/gabrielng-rj99/Problema_1/Python/problema-1.py function knapsack (line 2) | def knapsack(SPACE, ARRAY): function execute_algorithm (line 14) | def execute_algorithm(file_path): FILE: submissions/gabrielng-rj99/Problema_1/Rust/src/main.rs function knapsack (line 5) | fn knapsack(space: i64, array: &[(i64, i64, f64)]) -> i64 { function execute_algorithm (line 19) | fn execute_algorithm(file_path: &str) -> i64 { function main (line 44) | fn main() { FILE: submissions/gabrielng-rj99/Problema_2/Python/problema-2.py function count_edges (line 8) | def count_edges(N, edges): function add_ans (line 15) | def add_ans(): function open_edges_file (line 21) | def open_edges_file(file_path): function roots_leaves_from (line 33) | def roots_leaves_from(cycle: list): function is_connected (line 55) | def is_connected(nodes: list): function leaves_connected_to_not_roots (line 65) | def leaves_connected_to_not_roots(leaves, roots, cycle): function erase_edge_from (line 75) | def erase_edge_from(cycle): function find_cycle_starting_from (line 143) | def find_cycle_starting_from(start_node): function break_all_cycles (line 152) | def break_all_cycles(): function main (line 159) | def main(file_path): FILE: submissions/gbpagano/src/main.rs function main (line 5) | fn main() { FILE: submissions/gutogalego/src/main.rs function knapsack (line 6) | fn knapsack(items: &[(usize, usize)], capacity: usize) -> usize { function main (line 18) | fn main() -> io::Result<()> { FILE: submissions/gutogalego__2/src/main.rs function main (line 6) | fn main() -> io::Result<()> { FILE: submissions/gutogalego__3/src/main.rs function main (line 6) | fn main() -> io::Result<()> { FILE: submissions/jojodev/problema-1.py function ler_entrada (line 3) | def ler_entrada(nome_arquivo): function knapsack_iterativo (line 21) | def knapsack_iterativo(capacidade, pesos, valores, n): FILE: submissions/juanplopes/problema-1.cpp function main (line 9) | int main() { FILE: submissions/olegon/main.cpp function main (line 12) | int main(void) { function optimize (line 33) | int optimize(int i, int n, vector &w, vector &v, int W, vector... FILE: submissions/ryrden/ryrden.go function knapsack (line 9) | func knapsack(totalItems int, maxCapacity int, values []int, weights []i... function main (line 28) | func main() { function max (line 36) | func max(a, b int) int { function readInput (line 43) | func readInput(reader *bufio.Reader) (int, int, []int, []int) { FILE: submissions/wmsbill/problema_01.js function parse (line 4) | function parse(fileContent) { function main (line 13) | function main(file) { FILE: submissions/zeroskullx/problema-01.js function maxCoins (line 7) | function maxCoins(seeds, W) { function buildInventory (line 37) | function buildInventory(filename) {