Pagini recente » Cod sursa (job #229581) | Cod sursa (job #2815502) | Cod sursa (job #2496297) | Cod sursa (job #3263167) | Cod sursa (job #2213190)
#include <cstdio>
#include <vector>
using namespace std;
vector <int> l[270];
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
int n,k = 0;
scanf("%d",&n);
printf("%d %d \n",n*(n-1)/2,n-1);
for(int i = 1; i <= n ; i++)
{
for(int j = i + 1; j <= n ; j++)
{
k++;
l[i].push_back(k);
l[j].push_back(k);
}
}
for(int i = 1; i<= n ;i++)
{
for(vector<int> :: iterator it = l[i].begin(); it != l[i].end() ; it++)
printf("%d ",*it);
printf("\n");
}
return 0;
}