Pagini recente » Cod sursa (job #1119640) | Cod sursa (job #1274887) | Cod sursa (job #1244531) | Cod sursa (job #138001) | Cod sursa (job #1292444)
#include <fstream>
using namespace std;
ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");
int i,j,k,n,x,v[1000],t,j2;
pair <int, int> C[1000],L[1000];
int main()
{
fin >> n;
for(i = 1; i <= n;i ++)
for(j = 1; j <= n; j ++)
fin >> x;
if(i == j)
fin >> v[i];
k = 0;
int min = 20000000;
for(i = 1; i <= n; i ++){
for(j = i; j <= n; j++)
if(v[j] <= min){
min = v[j];
j2 = j;
}
t = v[i];
v[i] = min;
v[j2] = t;
min = 20000000;
if(i != j2){
k ++;
L[k].first = i;
L[k].second = j2;
C[k].first = i;
C[k].second = j2;
}
}
fout << k << '\n';
for(i = 1; i <= k; i ++){
fout << "C"<< " " << C[i].first<< " " << C[i].second << '\n';
fout << "L"<< " " << L[i].first<< " " << L[i].second << '\n';
}
return 0;
}