Pagini recente » Cod sursa (job #659655) | Cod sursa (job #1257600) | Istoria paginii utilizator/uaic_bucevschi_cojocaru_pescaru | Istoria paginii utilizator/yamasfurniture | Cod sursa (job #1427436)
#include <cstdio>
#include <algorithm>
#include <cstring>
#define Nmax 1002
using namespace std;
int n, i, j, l, p, q, nr;
bool a[Nmax][Nmax];
struct nod
{
int x;
int y;
}sol[Nmax];
int main()
{
freopen("dame.in", "r", stdin);
freopen("dame.out", "w", stdout);
scanf("%d", &n);
p = n / 2; q = n;
printf("%d\n", n);
for (i = 1; i <= n; ++i)
{
if (i % 2 == 1)
{
printf("%d %d\n", i, p);
--p;
} else
{
if (i % 4 == 0)
{ printf("%d %d\n", i, q); q -= 2;}
else
printf("%d %d\n", i, q - 1);
}
}
return 0;
}