Pagini recente » Cod sursa (job #1363739) | Cod sursa (job #1063884) | Cod sursa (job #2245477) | Cod sursa (job #2659147) | Cod sursa (job #1087391)
#include <cstdio>
using namespace std;
int main()
{
FILE *in,*out;
in = fopen("lacate.in","r");
out = fopen("lacate.out","w");
int n,cheie = 1,i,j;
fscanf(in,"%d",&n);
fprintf(out,"%d %d\n",n*(n-1)/2,n-1);
for(i = 1;i <= n;i++)
{
for(j = 1;j < n;j++)
{
fprintf(out,"%d ", cheie);
cheie++;
if(cheie > n * (n-1) / 2)
cheie = 1;
}
fprintf(out,"\n");
}
return 0;
}
/*Metoda matrici
for(int i=1;i<=n;++i)
for(int j=i;j<n;++j)
a[i][j]=a[j+1][i]=++k;
printf("%d %d\n",((n-1)*n)>>1,n-1);
for(int i=1;i<=n;++i){
for(int j=1;j<n;++j)
printf("%d ",a[i][j]);
printf("\n");
}
*/