Pagini recente » Cod sursa (job #3208642) | Cod sursa (job #37501) | Cod sursa (job #3158835) | Cod sursa (job #249707) | Cod sursa (job #2998887)
#include <iostream>
#include<math.h>
#include<fstream>
using namespace std;
ifstream f("barman.in");
ofstream g("barman.out");
int main()
{
int n,v[601],i,j,a[601][601],m,p,aux;
f>>n;
m=1;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j]){
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for(i=1;i<=n;i++)
for(p=1;p<=n;p++)
a[m][p]=v[i];
while(k<=n){
aux=v[1];
for(i=2;i<n;i++)
v[i]=v[i+1];
v[n]=aux;
for(i=1;i<=n;i++)
for(p=1;p<=n;p++)
a[m][p]=v[i];
k++;
}
return 0;
}