A. Festival Greeting A simple greetign problem to start the contest. public class Greeting { public static void main(String[] args) { System.out.println("Happy Lantern Festival!"); } } B. Lantern Riddles Simulate solving lantern riddles in a circular arrangement. import java.util.*; public...
Scholarship Allocation A school distributes scholarships after each semester's final exams. There are five scholarship types available: Academician Scholarship: 8000 yuan for students with final exam scores > 80 and atleast one published paper May Fourth Scholarship: 4000 yuan for students with f...
Problem A: Rain Read four integers a, b, c, d and one target value x. For each of the four values, output 0 if it's greater than x, otherwise output x - value. #include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int a, b, c, d, x; cin >&...
Problem A: Building Height Comparison Given an array of building heights, find the first building taller than the first one. #include <cstdio> const int MAX_SIZE = 105; int heights[MAX_SIZE]; int main() { int n; scanf("%d", &n); int result = -1; for (int i = 1; i <= n; i++) {...
To determine the number of operations required to reduce a non-negative integer to zero, specific rules apply based on parity. If the value is even, perform division by two. If the value is odd, subtract one. The process repeats until the value reaches zero. Consider the input 14. The sequence invol...
Greeting Code #include <iostream> int main() { std::cout << "Competition Day!" << '\n'; return 0; } Neighbor Sum Array #include <iostream> #include <vector> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int len; cin >>...
D. Prefix Reversal Construction A palindrome insertion strategy can transform any sequence by reversing prefixes. Inserting a pattern like abc...cba after a prefix abc... effectively reverses that prefix while leaving subsequent elements unchanged. Key insight: Two flip operations suffice for transf...
Core Concepts and Prerequisites To effectively implement merging operations on range-based data structures, understanding dynamic node allocation and order statistic trees is essential. Standard segment trees often consume excessive memory when built fully; dynamic initialization allowss resources t...
A knapsack problem involves selecting items with given weights and values to maximize total value without exceeding a capacity limit. It appears in resource allocation, scheduling, logistics, and investment scenarios. Problem Categories Binary Knapsack — Each item can be taken at most once. Given n...
Bubble Sort Two-pointer loop, swap when out of order, until the desired element floats to the boundary. function bubbleSort(arr) { const n = arr.length; for (let i = 0; i < n; i++) { for (let j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]...
