Cod sursa(job #2714377)
| Utilizator | Data | 1 martie 2021 18:49:29 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.97 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char m[100][100];
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
m[i][i] = '!', m[i][n - i - 1] = '!';
for (int j = 0; j < n; j++)
{
if (i < n/2)
{
if (j > i && j < n - i - 1)
m[i][j] = 'a';
else if (j < i)
m[i][j] = 'm';
else if (j > n - i - 1)
m[i][j] = 'k';
}
else
{
if (j > n - i - 1 && j < i)
m[i][j] = 'b';
else if (j < n - i - 1)
m[i][j] = 'm';
else if (j > i)
m[i][j] = 'k';
}
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
cout << m[i][j] << " ";
cout << endl;
}
return 0;
}
