https://codeforces.com/contest/1525/problem/A시간 2초, 메모리 256MBinput :n (2 ≤ n ≤ 5000)a1, a2, …, an (0 ≤ ai ≤ 1)output : Print one integer — the m
https://codeforces.com/contest/1525/problem/C시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n m (1 ≤ n ≤ 3⋅105; 2 ≤ m ≤ 108)x1, x2, …, xn (0 < xi <
https://codeforces.com/contest/1525/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 2000)n (3 ≤ n ≤ 50)n distinct integers from 1 to noutput : For ea
https://codeforces.com/contest/1525/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 100)k(1 ≤ k ≤ 100)output : For each test case, print the minimum n