AT4517 [AGC032B] Balanced Neighbors
分
当
当
#include <bits/stdc++.h>
using namespace std;
int n, m, k, p, q, ans, sum;
inline int read()
{
register int x = 0, f = 1;
char ch = getchar();
while(!isdigit(ch))
{
if(ch == '-') f=-1;
ch = getchar();
}
while(isdigit(ch))
{
x=(x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
int main()
{
n = read();
int flag = n % 2 ? n: n + 1;
for(int i = 1; i < n; i++)
{
for(int j = i + 1; j <= n; j++)
{
if(i + j == flag)continue;
m++;
}
}
cout << m << endl;
for(int i = 1; i < n; i++)
{
for(int j = i + 1; j <= n; j++)
{
if(i + j == flag)continue;
cout << i << " " << j << endl;
}
}
return 0;
}