Codeforces Round 148 (Div. 2)

2 problems from Codeforces Round 148 (Div. 2) (contest 239), difficulty 1200-1500. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 148 (Div. 2)

Div. 2 | 2 problems | 1/2 verified | Difficulty 1200-1500 | 4m 55s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Two Bags of Potatoes	1200	greedy, implementation, math	20,608	1m 23s	✓
B	Easy Tape Programming	1500	brute-force, implementation	1,474	3m 32s

Practice › Codeforces Solutions › Codeforces Round 148 (Div. 2) ›

CF 239A - Two Bags of Potatoes

We know the second bag contains y potatoes. The first bag originally contained some positive number x, but that value was lost. The only remaining information is that the total number of potatoes, x + y, was divisible by k and did not exceed n.

Practice › Codeforces Solutions › Codeforces Round 148 (Div. 2) ›

CF 239B - Easy Tape Programming

We are given a string consisting of digits, <, and characters. Every query selects a substring and treats it as a standalone program in a tiny tape language. The interpreter keeps two pieces of state.