[SWEA] 3499 퍼펙트 셔플

출처: SWEA

 Input 

3

6

A B C D E F

4

JACK QUEEN KING ACE

5

ALAKIR ALEXSTRASZA DR-BOOM LORD-JARAXXUS AVIANA

 

 Output 

#1 A D B E C F

#2 JACK KING QUEEN ACE

#3 ALAKIR LORD-JARAXXUS ALEXSTRASZA AVIANA DR-BOOM

 

교대로 섞이는 규칙을 활용해서 수식을 세웁니다.

---

#include <iostream>
using namespace std;
 
char card[1001][81];
int main() {
    int testCase; cin >> testCase;
 
    for (int tc = 1; tc <= testCase; ++tc) {
        int N; cin >> N;
        for (int i = 0; i < N; i++)
            cin >> card[i];
 
        // 정답 출력
        cout << "#" << tc;
        for (int i = 0; i < N; i++) {
            if (i % 2 == 0) cout << " " << card[i/2];
            else if (N % 2 == 0) cout << " " << card[N/2 + i/2];
            else cout << " " << card[N / 2 + 1 + i / 2];
        }
        cout << endl;
    }
}