SWEA 3499 - 퍼펙트 셔플

문제 링크 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWGsRbk6AQIDFAVW

문제의 저작권은 SW Expert Academy에 있습니다.

#include <iostream>
 
using namespace std;
 
int main(void) {
    int T, N;
 
    cin >> T;
 
    for(int t_case=0; t_case<T; t_case++) {
        cin >> N;
 
        string cards[N];
 
        cout << "#" << t_case+1;
 
        for(int i=0; i<N; i++) {
            cin >> cards[i];
        }
 
        for(int i=0; i<N; i++) {
            if(i%2 == 0) {
                cout << " " << cards[i/2];
            } else if(N%2 == 0){
                cout << " " << cards[N/2 + i/2];
            } else {
                cout << " " << cards[N/2 + 1 + i/2];
            }
        }
 
        cout << "\n";
    }
 
    return 0;
}