Codeforces Round #FF (Div. 2)

2 problems from Codeforces Round #FF (Div. 2) (contest 447), difficulty 800-1000. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round #FF (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1000 | 2m 29s

#	Problem	Rating	Tags	Accepted	Time	✓
A	DZY Loves Hash	800	implementation	10,282	1m 18s	✓
B	DZY Loves Strings	1000	greedy, implementation	21,023	1m 11s	✓

Practice › Codeforces Solutions › Codeforces Round #FF (Div. 2) ›

CF 447A - DZY Loves Hash

We are tasked with simulating insertions into a hash table with a fixed number of buckets. Each bucket can hold at most one element. The hash function is simple: for a number $x$, the target bucket is $x mod p$. We receive a sequence of numbers and must insert them in order.

Practice › Codeforces Solutions › Codeforces Round #FF (Div. 2) ›

CF 447B - DZY Loves Strings

We are given a string made of lowercase letters and a way to assign a numerical weight to each letter. The value of a full string is computed by summing, over all positions, the product of the position index (starting from 1) and the weight of the character at that position.