Subscribed unsubscribe Subscribe Subscribe

0w1

Hi everyone, please feel free to have discussions with me!

CFR 637 C. Promocodes with Mistakes ( Ad hoc, Bruteforce )

Problem - C - Codeforces題意: 給若干個條碼,由六個 0 ~ 9 之間的數字組成。求一個最大 K,保證就算打錯 K 個數字,依然可以確定是哪個條碼。數據範圍: 條碼的數量 1 ≤ N ≤ 1000解法: 首先顯然如果 N = 1,那一定是 K = 6,全部打錯都行。否則顯然 K = …