Freaks City

Problem A: Enitial Letter Extraction Given three space-separated lowercase strings, output their initial letters in uppercase. std::string s; std::getline(std::cin, s); for (int i = 0; i < (int)s.size(); i++) { if (i == 0 || s[i - 1] == ' ') std::cout << char(s[i] - 'a' + 'A'); } std::cout << "\n"; Problem B: Large ...

Problem A Given two positive integers \(x\) and \(y\), compute \(\left\lfloor \frac{y}{x} \right\rfloor\). Problem B Given a sequence of integers \(a_1, a_2, \ldots, a_n\), output the minimum value among them. Problem C Problem Statement Each takoyaki remains fresh for exactly \(T\) seconds after being cooked. There are \(N\) takoyakis cooked a ...

A. Be Positive Count how many elements are negative. If the amount is odd, flip one more element so the product becomes positive. void solve() { int n; cin >> n; int neg = 0; for (int i = 0; i < n; ++i) { int v; cin >> v; if (v < 0) ++neg; } cout << (neg & 1 ? neg + 1 : neg) <&l ...

Constrained Tower Moves A variation of the Tower of Hanoi requires moving all disks in the order (1\rightarrow 2\rightarrow 3\rightarrow 1). Given (n) disks on peg (1), determine the number of moves (a) to transfer them all to peg (2), and (b) to peg (3), modulo (998244353). Multiple queries ask for the XOR-sum of all (a) and (b) after taking t ...

Given a tournament with n teams numbered from 0 to n - 1, determine the champion based on match results represented in an n x n boolean matrix. Each element grid[i][j] indicates whether team i defeats team j. If grid[i][j] is 1, then team i is stronger than team j. Otherwise, team j is stronger than team i. A champion is a team that no other te ...

Problem Overview Given multiple video segments from a sports event lasting T seconds, each segment is represented as [start, end]. These segments may overlap and have varying lengths. We can freely split and recombine segments—for instance, [0, 7] can be divided into [0, 1] + [1, 3] + [3, 7]. The objective is to recombine these segments to crea ...

A. Line Trip The fuel tank must be sufficient to cover the distance between every pair of consecutive gas stations, and must also allow returning from the destination back to the start point without refueling at the final station. Click to view solution code #include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_st ...

This document provides solutions for problems from the SMU Summer 2023 Contest, Round 6. A. Burger Optimization This problem involves maximizing profit from selling two types of burgers with different ingredients and prices, given a limited number of buns. The strategy is to iterate through all possible counts of the first burger type, up to th ...

A cow's language, known as Cowphabet, consists of the 26 lowercase letters. However, the order in which a cow recites these letters is a permutation of the standard alphabet sequence. Bessie repeats this song, and Farmer John notes down a string of letters he remembers hearing. The task is to determine the minimum number of complete Cowphabet r ...

A – Distinct Count Input three integers. Output how many different values appear. #include <bits/stdc++.h> using namespace std; int main() { set<int> bag; for (int i = 0; i < 3; ++i) { int x; cin >> x; bag.insert(x); } cout << bag.size() << '\n'; } B – Coloring a Line of Balls G ...