Codeforces Round #564 (Div. 2) B. Nauuo and Chess

最新推荐文章于 2022-11-22 23:15:14 发布

weixin_34199335

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量88

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/YDDDD/p/10990876.html

本文探讨了Codeforces上一道有趣的棋盘游戏问题，目标是在最小的棋盘上放置n个棋子，遵循特定的规则。文章提供了一个构造性的解决方案，并通过代码实现，展示了如何在满足条件的情况下找到最小的棋盘尺寸。

链接：https://codeforces.com/contest/1173/problem/B

题意：

Nauuo is a girl who loves playing chess.

One day she invented a game by herself which needs

The game's goal is to place

However, Nauuo discovered that sometimes she couldn't find a solution because the chessboard was too small.

She wants to find the smallest chessboard on which she can put

She also wonders how to place the pieces on such a chessboard. Can you help her?

思路：

构造x*x的矩阵，左上角放1，右下角放n，

因为(n-x)=(n-x)

所以矩阵第一行填满1-x，最后一行从右到左填充n-(x+1)。

代码：

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const int MAXN = 1e3 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t;
int x, y;

int A[MAXN][MAXN];

int main()
{
    cin >> n;
    if (n == 1)
    {
        cout << 1 << endl;
        cout << 1 << ' ' << 1 << endl;
        return 0;
    }
    for (int i = 2;i <= n;i++)
        if ((i-1)*2 >= n-1)
        {
            x = y = i;
            break;
        }
    for (int i = 1;i <= x;i++)
        A[1][i] = i;
    for (int i = x, v = n;i >= 1 && v > x;i--,v--)
        A[x][i] = v;

    cout << x << endl;
    for (int i = 1;i <= x;i++)
        for (int j = 1;j <= y;j++)
            if (A[i][j] <= n && A[i][j] >= 1)
                cout << i << ' ' << j << endl;

    return 0;
}

转载于:https://www.cnblogs.com/YDDDD/p/10990876.html