Pagini recente » Cod sursa (job #3214460) | Cod sursa (job #1590107) | Cod sursa (job #1515668) | Cod sursa (job #1056358) | Cod sursa (job #2776917)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lacate.in");
ofstream fout("lacate.out");
const int NMAX = 260;
int a[NMAX][NMAX],n,cnt;
int main(){
fin >> n;
for(int i=1;i<n;i++){
a[i][i]=a[i+1][i]=++cnt;
for(int j=i+1;j<n;j++)
a[i][j]=a[j+1][i]=++cnt;
}
fout << cnt << ' ' << n-1 << '\n'; // (n-1)*n/2;
for(int i=1;i<=n;i++){
for(int j=1;j<n;j++){
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}