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