Pagini recente » Cod sursa (job #1418774) | Cod sursa (job #2493955) | Cod sursa (job #2895388) | Cod sursa (job #250827) | Cod sursa (job #1785085)
#include <iostream>
#include <fstream>
using namespace std;
int main ()
{
ifstream cin("lacate.in");
ofstream cout("lacate.out");
int m[300][300],n,p,x=1;
cin>>n;
for(int i=1; i<=n; i++)
{
for(int j=i; j<n; j++)
{
m[i][j]=x;
m[j+1][i]=x;
x++;
}
}
p=(n*(n-1))/2;
cout<<p<<" "<<n-1<<"\n";
for(int i=1; i<=n; i++)
{
for(int j=1; j<n; j++)
{
cout<<m[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}