https://codeforces.com/contest/1520/problem/F1시간 1초, 메모리 256MBInteractionn t (1 ≤ n ≤ 2⋅105, t=1).k (1 ≤ k ≤ n). It is guaranteed that at the mom
https://codeforces.com/contest/1520/problem/E시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 2 \* 106)a string of length noutput : For each test
https://codeforces.com/contest/1520/problem/D시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 2 \* 105)a1 , a2, …, an (0 ≤ ai ≤ n)output : For ea
https://codeforces.com/contest/1520/problem/C시간 4초, 메모리 256MBinput :t (1 ≤ t ≤ 100)n (1 ≤ n ≤ 100)output : For each test case, output:\-1, if the
https://codeforces.com/contest/1520/problem/B시간 2초, 메모리 256MBinput :t (1 ≤ t ≤ 104)n (1 ≤ n ≤ 109)output : For each test case output the number o
https://codeforces.com/contest/1520/problem/A시간 1초, 메모리 256MBinput :t (1 ≤ t ≤ 1000)n (1 ≤ n ≤ 50)output : For each test case output:"YES", if th