Pagini recente » Cod sursa (job #2785209) | Cod sursa (job #2883124) | Cod sursa (job #630950) | Cod sursa (job #342579) | Cod sursa (job #244629)
Cod sursa(job #244629)
#include <fstream>
using namespace std;
ifstream f ("fisier.in");
ofstream g ("fisier.out");
int v[100][100], n, m, aux;
void read()
{ f >> n >> m;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
f >> v[i][j];
}
void afis()
{ for (int i=1; i<=n; i++)
{ for (int j=1; j<=m; j++)
g << v[i][j] << " ";
g << endl;
}
}
void ordonare()
{ int ok;
do
{ ok=0;
for (int j=1; j<m; j++)
if (v[1][j]>v[1][j+1])
{ for (int i=1; i<=n; i++)
{ aux=v[i][j];
v[i][j]=v[i][j+1];
v[i][j+1]=aux;
ok=1;
}
}
}while (ok);
}
int main()
{ read();
ordonare();
afis();
f.close();
g.close();
return 0;
}