Formación 1 - Me 题
#pragma warning (disable:4996)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#define inf 0X3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6 + 5;
const int M = 10;//状压
queue<char> letter;
char out[11][11];
int main()
{
for (char c = 'a'; c <= 'z'; c++)
letter.push(c);
for (int size = 3; size <= 10; size++)
{
memset(out, '\0', sizeof(out));
for (int j = 1; j <= size; j++)
{
if (j == 1 || j == size)
{
for (int i = 1; i <= size; i++)
{
out[i][j] = letter.front();
letter.push(letter.front());
letter.pop();
}
}
else
{
for (int i = 1; i <= size; i++)
if (i == size - j + 1)
{
out[i][j] = letter.front();
letter.push(letter.front());
letter.pop();
}
else
out[i][j] = ' ';
}
}
for (int i = 1; i <= size; i++)
{
for (int j = 1; j <= size; j++)
printf("%c", out[i][j]);
printf("\n");
}
}
return 0;
}
Ideas:
Salida de la violencia