Pagini recente » Cod sursa (job #2559661) | Cod sursa (job #2312007) | Cod sursa (job #578202) | Cod sursa (job #1529668) | Cod sursa (job #3194159)
#include <fstream>
using namespace std;
int mat[301][301], n, i, j, k, p, q, schimbari, s[100001];
int main()
{
ifstream cin("grozavesti.in");
ofstream cout("grozavesti.out");
cin >> n;
for(i = 1; i <= n; i ++)
{
for(j = 1; j <= n; j ++)
{
cin >> mat[i][j];
}
}
for(i = 1, j = 1; i < n, j < n; i ++, j ++)
{
for(p = i + 1, q = i + 1; p <= n, q <= n; p ++, q ++)
{
if(mat[i][j] > mat[p][q])
{
swap(mat[i][j], mat[p][q]);
k ++;
s[k] = i;
k ++;
s[k] = p;
schimbari ++;
}
}
}
cout << schimbari << '\n';
for(i = 1; i <= k; i += 2)
{
cout << 'L' << ' ' << s[i] << ' ' << s[i + 1] << '\n';
}
return 0;
}