백준알고리즘/입출력
2446번
풀스택 개발자
2020. 10. 2. 17:06
#include<iostream>
using namespace std;
int main()
{
int cnt;
int n = 0;
cin >> n;
cnt = (n * 2) - 1;
for (int i = 0; i < n-1; i++)
{
for (int j=0;j<i;j++)
{
cout << ' ';
}
for (int j = 0; j < cnt; j++)
{
cout << '*';
}
cnt = cnt - 2;
cout << '\n';
}
cnt = 1;
for (int i = 0; i < n; i++)
{
for (int j = n - 1; j > i; j--)
{
cout << ' ';
}
for (int j = 0; j < cnt; j++)
{
cout << '*';
}
cnt = cnt + 2;
cout << '\n';
}
}