Codeforces Round #707 (Div. 2, based on Moscow Open Olympiad in Informatics) A. Alexey and Train 문제보기 단순 Bruteforce 문제 코드 보기/숨기기 #include #include using namespace std; int t, n; int a[150], b[150], tmm[150]; int main(void) { //freopen("input.txt", "r", stdin); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); cin >> t; while(t--) { b[0] = 0; int now = 0; cin >> n; for(int i = 1; i > ..