Educational Codeforces Round 65 (Rated for Div. 2) B. Lost Numbers

最新推荐文章于 2025-08-12 18:06:10 发布

weixin_34159110

最新推荐文章于 2025-08-12 18:06:10 发布

阅读量114

点赞数

CC 4.0 BY-SA版权

文章标签： python java

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

博客围绕一个交互题展开，题目中陪审团预设含6个特殊整数的数组，允许最多4次查询，每次查询返回两元素乘积。解题思路是获取1*2、2*3、3*4、4*5位置的值后直接枚举。还给出了Python和Java语言相关代码的转载链接。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题意：

This is an interactive problem. Remember to flush your output while communicating with the testing program. You may use fflush(stdout) in C++, system.out.flush() in Java, stdout.flush() in Python or flush(output) in Pascal to flush the output. If you use some other programming language, consult its documentation. You may also refer to the guide on interactive problems: https://codeforces.com/blog/entry/45307.

The jury guessed some array

You don't know anything about their order, but you are allowed to ask up to

Can you guess the array

The array

得到1*2 2*3 3*4 4*5位置的值，然后直接枚举。

代码：

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

int A[10] = {0, 4, 8, 15, 16, 23, 42};
const int sum = 108;
map<int, int> ma;
int B[10];

bool check()
{
    ma[4] = 1;
    ma[8] = 2;
    ma[15] = 3;
    ma[16] = 4;
    ma[23] = 5;
    ma[42] = 6;
    int tmp = 0;
    for (int i = 1;i <= 5;i++)
    {
        if (ma[B[i]] == 0)
            return false;
        tmp += B[i];
    }
    B[6] = sum - tmp;
    return true;
}

int main()
{

    int ab, bc, cd, de;
    cout << '?' << ' ' << 1 << ' ' << 2 << endl;
    fflush(stdout);
    scanf("%d", &ab);
    cout << '?' << ' ' << 2 << ' ' << 3 << endl;
    fflush(stdout);
    scanf("%d", &bc);
    cout << '?' << ' ' << 3 << ' ' << 4 << endl;
    fflush(stdout);
    scanf("%d", &cd);
    cout << '?' << ' ' << 4 << ' ' << 5 << endl;
    fflush(stdout);
    scanf("%d", &de);
    for (int i = 1;i <= 6;i++)
    {
        if (ab % A[i] != 0)
            continue;
        B[1] = A[i];
        B[2] = ab / B[1];
        if (bc % B[2] != 0)
            continue;
        B[3] = bc / B[2];
        if (cd % B[3] != 0)
            continue;
        B[4] = cd / B[3];
        if (de % B[4] != 0)
            continue;
        B[5] = de / B[4];
        if (check())
            break;
    }
    fflush(stdout);
    cout << '!' << ' ';
    for (int i = 1;i <= 6;i++)
        cout << B[i] << ' ' ;
    cout << endl;

    return 0;
}

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