Pagini recente » Cod sursa (job #1718974) | Cod sursa (job #2870014) | Cod sursa (job #2004661) | Cod sursa (job #1979110) | Cod sursa (job #2070645)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("tije.in");
ofstream out("tije.out");
vector <pair <int, int> > sol;
int main()
{
int n;
in >> n;
int last = n + 1;
n--;
for(int i = n; i >= 1; i--)
{
for(int j = n + 1; j >= 1; j--)
for(int k = 1; k <= i; k++)
sol.push_back(make_pair(j, j + 1));
for(int j = 1; j <= i; j++)
sol.push_back(make_pair(1, last));
}
for(auto it : sol)
out << it.first << " " << it.second << "\n";
return 0;
}