[problem:2230A] Idea: [user:fcspartakm,2026-05-19], preparation: [user:fcspartakm,2026-05-19] <spoiler summary="Tutorial"> [tutorial:2230A] </spoiler> <spoiler summary="Solution (BledDest)"> ~~~~~ t = int(input()) for i in range(t): n, a, b = map(int, input().split()) c = n // 3 d = n % 3 print(min((c + 1) * b, c * b + d * a, n * a)) ~~~~~ </spoiler> [problem:2230B] Idea: [user:BledDest,2026-05-19], preparation: [user:Neon,2026-05-19] <spoiler summary="Tutorial"> [tutorial:2230B] </spoiler> <spoiler summary="Solution (BledDest)"> ~~~~~ t = int(input()) for i in range(t): s = input() pref2 = 0 suf = 0 for x in s: if x == '1' or x == '3': suf += 1 ans = pref2 + suf for x in s: if x == '2': pref2 += 1 if x == '1' or x == '3': suf -= 1 ans = max(ans, pref2 + suf) print(len(s) - ans) ~~~~~ </spoiler> [problem:223...

Полный текст и комментарии »