Freaks City

Interstellar PathfindingProblem StatementThere are n galaxies in the universe, each with an energy value e_i. There are m bidirectional wormholes connecting galaxies u and v. Using a wormhole from u to v consumes energy c and provides an energy gain of d (if current energy is less than c, the wormhole cannot be used). Find the minimum initial e ...

Given a completed 9×9 Sudoku grid, the task requires preserving some digits (minimum one) while replacing others with mines. The condition is that each remaining digit must equal the count of adjacent mines in its 8 surrounding cells. Solution Approach Identify any non-edge cell containing '8' and convert all other cells to mines. This satisfie ...

A straightforward Rust implementation for finding all factors of a number is shown below. This approach iterates up to the square root of the input value. fn compute_factors_simple(num: u64) -> Vec<u64> { let sqrt_val = (num as f64).sqrt().floor() as u64; let mut factors = Vec::new(); for divisor in 1..=sqrt_val { i ...

Simulated Annealing (SA) is a probabilistic optimization algorithm inspired by the physical annealing process in metallurgy. The Physical Annealing Process Annealing involves heating a material to a specific temperature and then cooling it down gradually. During this process, the internal energy of crystalline molecules tends to decrease. The m ...

Problem Overview A pyramid consists of N levels numbered from top (level 1) to bottom (level N). Each level i contains exactly 2*i - 1 cells arranged in a centered row. The bottommost row (level N) holds a permutation of integers from 1 to 2*N - 1. Values in upper layers are derived by taking the median of three values directly beneath each cel ...

In a binary matrix of size m x n, a subset of rows is considered "good" if, for every column, the sum of the elements in that column does not exceed half the size of the subset. Formally, if the subset conntains k rows, the sum of each column must be less than or equal to floor(k / 2). The goal is to return the indices of such a subse ...

The Pragmatic Guide to Maximizing Scores in Informatics Contests In competitive programming, the prevailing wisdom often emphasizes rigorous training and mastering advanced algorithms. However, for those who are still developing their technical foundation, "cheating"—or more accurately, strategic scoring—is an essential survival skill ...

Calculating Sturcture Member Size #include <stdio.h> // Get size of struct member #define MEMBER_SIZE(type, member) sizeof(((type*)0)->member) // Get offset of struct member #define MEMBER_OFFSET(type, member) ((size_t)(&(((type*)0)->member))) typedef struct { char x; char y; char z; } coord_t; typedef struct { ...

Tensor Creaiton and Initialization Basic Tensor Operations import torch # Create tensor from list data_tensor = torch.tensor([1, 2, 3], dtype=torch.float32) # Create tensor with random values (uniform distribution) rand_tensor = torch.rand(2, 3) # Create tensor with normal distribution values normal_tensor = torch.randn(3, 4) # Create tenso ...

0/1 Knapsack Given N items and a knapsack with capacity V, each item can only be selected once. Item i has volume v[i] and value w[i]. Determine which items to select to maximize total value without exceeding the knapsack's volume. Constraints: 0 < N, V ≤ 1000 0 < v[i], w[i] ≤ 1000 Time Complexity: O(N × V) int n, m; int f[100010], w[10 ...