Submission

Score: 100

User: Phat12

Problemset: ออลสปาร์ค

Language: cpp

Time: 0.211 second

Submitted On: 2025-12-28 13:00:36

/*
TASK: 009_DE_Tri_triangle.cpp
LANG: Cpp
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
using namespace std;
int cnt,cnt2;
int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n=2,m;
    cin >> m;
    int nm = n*m;
    for (int i=0;i<nm;i++){
        cnt= 2*((m-(i)%m))-1;
        cnt2= 2*((i%m))+1;
        for (int j=0;j<nm-1;j++){
            if (cnt==0 && cnt2==0){
                cnt= 2*((m-(i)%m))-1;
                cnt2= 2*((i%m))+1;
            }
            if (nm-j > i+1) cout << "-";
            else if (cnt2>0) {
                cout << "*";
                cnt2--;
            }
            else if (cnt>0){
                cout << "+";
                cnt--;
            }
        }
        if ((i/m)%2==0) cout << "*";
        else cout << "+"; 
        cnt2= ((i%m));
        cnt = 2*((m-(i)%m))-1;
        if ((i/m)%2==1) cnt= ((m-(i)%m))-1;
        if ((i/m)%2==1) cnt2= 0;
        for (int j=0;j<nm-1;j++){
            if (cnt<=0 && cnt2<=0){
                cnt= 2*((m-(i)%m))-1;
                cnt2= 2*((i%m))+1;
            }
            if (i <= j) cout << "-";
            else if (cnt2>0) {
                cout << "*";
                cnt2--;
            }
            else if (cnt>0){
                cout << "+";
                cnt--;
            }
        }
        cout << '\n';
    }
    return 0;
}