Algorithmia IIITN 2024 - Round 1

8 problems from Algorithmia IIITN 2024 - Round 1 (contest 105418), difficulty -. 3/8 solutions verified against sample I/O.

8 items

Algorithmia IIITN 2024 - Round 1

Special | 8 problems | 3/8 verified | Difficulty - | 11m 38s

#	Problem	Time	✓
A	Phoenix Against the Monsters	1m 39s
B	Spidey and the Palindrome Sequence	1m 29s
C	Reduce or Divide	1m 29s	✓
D	Harsh and profits	1m 11s	✓
E	Magical Coins	1m 22s
F	Oddly Even Challenge	1m 40s
G	Odd Non Primes	1m 20s
H	AI Takeover	1m 28s	✓

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418C - Reduce or Divide

We start with a number $n$ that is encoded in binary, but the string is given in reverse order, so the least significant bit comes first. The first task is simply to interpret this string correctly as an integer. Two players, Bob and Alice, alternate moves starting from Bob.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418H - AI Takeover

We start with a population of AI bots arranged in levels. Initially there are only level-n bots, and there are k of them. Time advances in fixed 5-minute steps, and at each step every bot performs exactly one action.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418G - Odd Non Primes

We are given several independent test cases. Each test case is a sequence of integers representing a row of cards.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418F - Oddly Even Challenge

We are asked to count how many integers in the range from 0 up to a given large number satisfy a positional digit rule. The rule depends on writing each number in decimal and looking at its digits from left to right using 1-based indexing.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418E - Magical Coins

We are given a set of coin denominations that follow a very structured pattern: each coin is a number consisting entirely of digit 1, and the lengths grow in a special way. So we get values like 11, 111, 1111, 11111, and so on, continuing indefinitely.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418D - Harsh and profits

The problem describes a profit process that grows in a very structured way. On the first day Harsh earns nothing, and each next day his daily gain increases by exactly one more unit than the previous increase.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418A - Phoenix Against the Monsters

We are given a directed network of cities connected by roads, where each road has a non-negative cost representing how many monsters Phoenix must fight if he travels along it. Phoenix starts at city 1 and must reach city n using any sequence of directed roads.

Practice › Codeforces Solutions › Algorithmia IIITN 2024 - Round 1 ›

CF 105418B - Spidey and the Palindrome Sequence

We are given a string and we are allowed to rearrange its characters arbitrarily. After rearrangement, we want to split the resulting string into several consecutive blocks. Every block must be a palindrome and all blocks must have the same length.