Salut!
Ai rezolvarea in C++ mai jos
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int n, m, a[51][51];
queue <int> Q;
//Citire matrice
cin >> n >> m;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= m; ++j)
{
cin >> a[i][j];
}
}
//Creare coada
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= m; ++j)
{
Q.push(a[i][j]);
}
}
//Afisare
while (!Q.empty())
{
cout << Q.front() << ' ';
Q.pop();
}
return 0;
}
