Pagini recente » Cod sursa (job #3437) | Cod sursa (job #2934813) | algoritmiada-2012/runda-2/solutii/subarbore | Cod sursa (job #972950) | Cod sursa (job #2294401)
#include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
freopen("tije.in", "r", stdin);
freopen("tije.out", "w", stdout);
scanf("%d", &n);
for(int i = n - 1; i >= 1 ; --i){
for(int j = n; j >= 1 ; --j)
for(int k = 1; k <= i ; ++k)
printf("%d %d\n", j, j + 1);
for(int k = 1; k <= i ; ++k)
printf("%d %d\n", n + 1, 1);
}
return 0;
}