Freaks City

Everyone Loves to Sleep Convert all times to minutes and store in a sorted set. Use binary search to find the nearest alarm time. If no alarm exists after bedtime, calculate duration untill first alarm next day. #include <iostream> #include <set> #include <climits> using namespace std; void calculateSleepDuration() { int ...

Task A – Permutation Duel A cyclic permutation maps [1\to2\to3\to\dots\to13\to1] Two players choose indices (x,y\in[1,13]). Compare the images (p(x)) and (p(y)); output the winner or "Draw". int main() { int x, y; std::cin >> x >> y; int px = (x == 13 ? 1 : x + 1); int py = (y == 13 ? 1 : y + 1); if (px == ...

Problem A: Plus Minus Given the sum and difference of two numbers, we can easily retrieve the original values. The first number is the average of the sum and difference, while the second is half of the difference subtracted from the sum. s, d = map(int, input().split()) print((s + d) // 2, (s - d) // 2) Problem B: DNA Sequence A substring is c ...

01 Knapsack Problem Statement Given N items and a knapsack with capacity m, each item has a volume v[i] and value w[i]. Each item can be selected at most once. Determine which items to select so that the total volume does not exceed the knapsack's capacity and the total value is maximized. Approach Let dp[i][j] denote the maximum value achievab ...

Problem A: Honest or Dishonest Two characters (a) and (b) are given, each either H (honest) or D (dishonest). Person A always tells the truth if (a = H), otherwise always lies. A states that B is honest if (b = H), or that B is dishonest if (b = D). Determine whether B is actually honest. Solution If A is dishonest ((a = D)), the statement is f ...