Pagini recente » Borderou de evaluare (job #2019439) | Cod sursa (job #198987) | Istoria paginii runda/becreative_1 | Cod sursa (job #214208) | Cod sursa (job #975660)
Cod sursa(job #975660)
#include<stdio.h>
int main ()
{
int i,n,j,k,aux,a[600];
scanf("%d",&n);
for(i=0;i<n;++i)
scanf("%d",&a[i]);
//for(k=0;k<n;++k)
// printf("%d ",a[k]);
printf("\n\n");
for(i=n-1;i>=0;--i)
{
for(j=n-1;j>=1;--j)
{
aux=a[j];
a[j]=a[j-1];
a[j-1]=aux;
for(k=0;k<n;++k)
printf("%d ",a[k]);
printf("\n\n");
}
//printf("\n\n");
}
return 0;
}