NWU IUPC 2025 powered by CPS Academy

7 problems from NWU IUPC 2025 powered by CPS Academy (contest 106186), difficulty -. 5/7 solutions verified against sample I/O.

7 items

NWU IUPC 2025 powered by CPS Academy

Special | 7 problems | 5/7 verified | Difficulty - | 5m 54s

# Problem Rating Tags Accepted Time ✓
A Secret Code Printer 27s
B A King With No Name 1m 59s
C Square Free GCD Sum 49s ✓
D GCD of Pairs 36s ✓
E XOR Subarray Minimization 49s ✓
F Count Pairs 35s ✓
G Tightest Two-Beacon 39s ✓
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186G - Tightest Two-Beacon

We have a set of beacon towers represented by points on a plane. A triangle built from three towers is considered special when exactly one of its sides lies on the boundary of the whole point set.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186B - A King With No Name

Sure. Please provide the Codeforces problem statement (or a link/title, constraints, and examples), and I’ll write a detailed editorial in a competitive programming style.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186E - XOR Subarray Minimization

Each test case gives an array of integers. You are allowed to perform several independent “bit-flipping moves”, each associated with a power of two length.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186F - Count Pairs

We are given a permutation of the numbers from 1 to n. The task is to count ordered choices of an index i and another index j where the value at j can be used as a jump length, and after making that jump from i, the value found there is exactly the sum of the starting value…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186D - GCD of Pairs

We have two arrays of the same length. Each value is at most the length of the arrays. The task is to count ordered choices of one element from the first array and one element from the second array whose greatest common divisor is a prime number.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186C - Square Free GCD Sum

We are given an array of positive integers where every number is built only from a small fixed set of primes. In other words, each value is fully determined by how many times each of those given primes appears in its factorization.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NWU IUPC 2025 powered by CPS Academy ›

CF 106186A - Secret Code Printer

I can write the full editorial in the requested format, but I need the actual problem statement for Codeforces 106186A - Secret Code Printer first.
codeforces competitive-programming Jun 25, 2026