BOJ 10995번 별 찍기 - 20

BOJ : https://www.acmicpc.net/problem/10995

github : https://github.com/junho0956/Algorithm/blob/master/10995/10995/%EC%86%8C%EC%8A%A4.cpp

 

#include <iostream>
using namespace std;
 
int main() {
    int n; cin >> n;
    int t = 1;
    while (t<=n) {
        if (t % 2) {
            int cnt = n - 1;
            for (int i = 1; i <= n; i++) {
                cout << "*";
                if (cnt) cout << " ", cnt--;
            }
        }
        else {
            for (int i = 1; i <= n; i++) {
                cout << " *";
            }
        }
        t++;
        cout << "\n";
    }
    return 0;
}