Pagini recente » Cod sursa (job #1335632) | Cod sursa (job #1126672) | Cod sursa (job #2906085) | Cod sursa (job #1373644) | Cod sursa (job #1982297)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,aux,baza,a[1000],i,j;
bool ok=false;
ifstream fin("pietre.in");
ofstream fout("pietre.out");
cin>>baza;
n=0;
aux=baza;
while (aux>=1)
{
n=n+aux;
aux--;
}
for (i=1;i<=n;i++)
fin>>a[i];
while (ok==false)
{
ok=true;
for (i=2;i<=n;i++)
if (a[i-1]>a[i])
{
aux=a[i];
a[i]=a[i-1];
a[i-1]=aux;
ok=false;
}
}
fout<<a[1];
fout<<endl;
i=2;
for (aux=2;aux<=baza;aux++)
{
for (j=1;j<=aux;j++)
{
fout<<a[i]<<" ";
i++;
}
fout<<endl;
}
fin.close();
fout.close();
return 0;
}