E. Cells Arrangement

合集 - 构造(16)

1.C. Ehab and Path-etic MEXs2024-03-172.Increase Subarray Sums2024-04-103.F. Alex's whims2024-04-124.C. Torn Lucky Ticket2024-04-27

5.E. Cells Arrangement2024-05-04

6.俄罗斯方块2024-05-147.B. Omkar and Heavenly Tree2024-05-168.C. Colorful Grid2024-06-169.C. Lexicographically Largest2024-06-1710.A. Bitwise Operation Wizard2024-06-1711.B. Neutral Tonality2024-06-1712.M. 渚千夏的串2024-06-1813.D. Nene and the Mex Operator2024-07-1114.C. Nezzar and Symmetric Array2024-07-1615.D. Buying Jewels2024-07-1916.G. A/B Matrix2024-07-20

收起

原题链接

题解

• 集合内元素最大不超过 $2n-1$ ，最小不小于 $1$

• 如果按对角线排列，则可以得到所有偶数，把其中一颗棋子往旁边移，可以得到所有奇数

code

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        for(int i=1;i<=n-2;i++) cout<<i<<" "<<i<<endl;
        printf("%d %d\n%d %d\n\n",n-1,n,n,n);
    }
    return 0;
}