Gelöst

Decode an Encrypted AES image using CTR (counter mode) with no padding
Given an encoded AES image using CTR mode with no padding, the Initialization Vector (IV) (32 byte in uint8), and the AESkey (25...

6 Monate vor

Problem

6 Monate vor | 0 | 3 Lösungsvorschläge

Gelöst

Decode Message using AES with Cipher Block Chaining (CBC) and PKCS#5 padding
Provided an encrypted message using AES CBC mode with PKCS#5 padding, an encrypted AES key in the form of an audio .wav file tha...

6 Monate vor

Problem

6 Monate vor | 0 | 3 Lösungsvorschläge

Gelöst

Problem: Battery State Estimation with Temperature Effect
In a Battery Management System (BMS), the usable capacity of a battery decreases when operating at extreme temperatures. The ef...

6 Monate vor

Gelöst

Robust Corner Sum with Special Value Handling in Arrays
Compute the sum of the corner elements of an array (vector or matrix). If any corner element is NaN, return NaN. If any corner...

6 Monate vor

Gelöst

EXODUS - THE VOID SINGULARITY ( PHASE OMEGA-ZERO )
Background: The Swarm has reached the edge of the known universe, entering the 5th Dimension (The Void). Here, Euclidean geomet...

6 Monate vor

Gelöst

The Singularity: Omega Pulse ( Neural Dominance )
Abstract In the final phase of Omega experiment, you no longer control a single signal. You are tasked with commanding a Quantu...

6 Monate vor

Gelöst

The Genesis Sypnapse Protocol
Ⅰ.Context In a synthetic bio-neural network, information is transmitted between neurons through chemical and electrical signal...

6 Monate vor

Gelöst

The Omega Protocol: Hyper-dimensional Navigation and the Singularity Constraint
Description [EMERGENCY TRANSMISSION - GALACTIC COMMAND] Subject: Mission Omega-7 - Navigation through the K-94 Tesseract Anoma...

6 Monate vor

Gelöst

Project Aether: Non-Linear Temporal Flow Optimization
Ⅰ. Description In the year 2450, you are the Chief Architect of the Neo-Elysium defense grid. You must manage energy distributi...

6 Monate vor

Gelöst

The Heisenberg Entanglement Protocol
Abstract: A quantum signal must be routed through nodes. The cost of transmission is not purely geometric but depends on the p...

6 Monate vor

Gelöst

The Singularity: Omega Phase
Abstract: Navigate a signal through a non-linear, resource-constrained, time-varying neural network. The topology and node prop...

6 Monate vor

Gelöst

Concentric Squares Mandala
Generate concentric square rings of alternating 1s and 0s to form a layered mandala-style matrix. e.g. N = 5; 1 1 1 1 1;...

7 Monate vor

Gelöst

Circular Ring Approximation Mandala
Generate a matrix that approximates a circular ring using distance-based thresholding , a visually rich mandala-inspired challen...

7 Monate vor

Gelöst

Diagonal Cross Mandala
Generate an N×N matrix with diagonals highlighted to form an artistic X-shaped mandala pattern. e.g. N = 5; 1 0 0...

7 Monate vor

Gelöst

Plus Cross Mandala
Create a symmetrical plus (+) shaped pattern centered in an N×N matrix.

7 Monate vor

Gelöst

Vertical Mirror Mandala
Create a symmetric left-right mirrored pattern in an N×N matrix to emulate mandala reflection symmetry. e.g. N = 5; ...

7 Monate vor

Gelöst

Hourglass Mandala
Generate an hourglass shape using matrix geometry and symmetry. e.g. N = 5; 1 1 1 1 1; 0 1 1 1 0; ...

7 Monate vor

Gelöst

Record the Actions ( Medium )
Find the minimum steps to get T units from jugs A and B. Return the sequence of actions as cell array of strings. Available act...

7 Monate vor

Gelöst

The Classic 8-5-3 Sharing ( Medium )
You have 3 jugs with capacities [8,5,3]. The 8L jug, the others are empty: [8,0,0]. There is no tap and no drain. You can only p...

7 Monate vor

Gelöst

Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...

7 Monate vor

Gelöst

Interstellar Navigation: Minimum Time with Moving Hazards
You are the pilot of a spaceship at the origin P_start = (0,0,0) at time t = 0. Your mission is to reach a space station located...

7 Monate vor

Gelöst

The Quantum Knight's Tour on a Toroidal Hexagonal Board
In this challenge, you must navigate a knight on a Toroidal Hexagonal Grid of size The grid: We use the Axial Coordinate Syst...

7 Monate vor

Gelöst

Total Volume Goal ( Medium )
Usually, the target T must be in one jug. In this version, the target T is the sum of water in all N jugs. Example: C = [3,5], ...

7 Monate vor

Gelöst

The Broken Jug: Constrain ( Hard )
One of your jugs is "broken": it can not be Emptied to the drain. It can only be Filled or Poured to another jug. Input: C, T, ...

7 Monate vor

Gelöst

Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

7 Monate vor

Gelöst

The Ultimate Water Challenge ( Expert )
Description: In the previous problems, you were given a target T and asked to find the minimum number of steps to reach it. ...

7 Monate vor

Gelöst

Robust Huffman Decoding: The Single-Bit Error Challenge
In the world of data compression, Huffman coding is a classic algorithm. However, it is notoriously fragile: a single bit error ...

7 Monate vor

Gelöst

The Optimal 2D Guillotine Cutting Stock Problem
You are working in a factory that produces rectangular glass sheets. You have a large stock plate of size W x H. Customers have ...

7 Monate vor