Codeforces Round 160 (Div. 2)

2 problems from Codeforces Round 160 (Div. 2) (contest 262), difficulty 800-1200. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 160 (Div. 2)

Div. 2 | 2 problems | 0/2 verified | Difficulty 800-1200 | 10m 32s

# Problem Rating Tags Accepted Time ✓
A Roma and Lucky Numbers 800 implementation 22,438 3m 6s
B Roma and Changing Signs 1200 greedy 12,313 7m 26s
Practice › Codeforces Solutions › Codeforces Round 160 (Div. 2) ›

CF 262A - Roma and Lucky Numbers

Roma has a collection of positive integers, and he is fascinated with numbers whose decimal digits consist only of 4 and 7. These are called lucky numbers. The task is to determine, from his collection, how many numbers have at most k lucky digits.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 160 (Div. 2) ›

CF 262B - Roma and Changing Signs

Codeforces 262B: Roma and Changing Signs
codeforces competitive-programming greedy May 29, 2026