Pagini recente » Cod sursa (job #2765505) | Cod sursa (job #1054172) | Cod sursa (job #1902452) | Cod sursa (job #332191) | Cod sursa (job #1771425)
#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-1; i++)
{
for(int j=i+1; j<=n; j++)
{
m[i][j]=x;
m[j-1][i]=x;
x++;
}
}
p=(n*(n-1))/2;
if(p%2==1)
cout<<p<<" "<<p/2+1<<"\n";
else
cout<<(n*(n-1))/2<<" "<<(n*(n-1))/4<<"\n";
for(int i=1; i<=n-1; i++)
{
for(int j=1; j<=n; j++)
{
cout<<m[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}