Pagini recente » Cod sursa (job #1897535) | Cod sursa (job #2202695) | Cod sursa (job #2719030) | Cod sursa (job #983524) | Cod sursa (job #1834435)
#include<iostream>
#include<fstream>
using namespace std;
int main(void) {
ifstream cin("lacate.in");
ofstream cout("lacate.out");
int n;
cin>>n;
cout<<(n*(n-1))/2<<" "<<n-1<<"\n";
int idx=1;
for (int i=1; i<=n; ++i) {
for (int j=1; j<=n; ++j)
if (i!=j) {
int first=min(i,j);
int last=max(i,j);
int idx=0;
for (int k=1; k<first; ++k) idx+=(n-k);
idx+=last-first;
cout<<idx<<" ";
}
cout<<"\n";
}
}