QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#514979	#5465. Maximum GCD	Rahab	WA	25ms	4068kb	C++20	802b	2024-08-11 14:05:22	2024-08-11 14:05:22

Judging History

你现在查看的是最新测评结果

[2024-08-11 14:05:22]
评测

测评结果：WA
用时：25ms
内存：4068kb

查看

[2024-08-11 14:05:22]
提交

answer

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

const int NUM = 1e5 + 5;
int n;
int a[NUM];
int minn = INT_MAX;

int dfs(int x)
{
    bool tag = true;
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] != x)
        {
            if (a[i] % (a[i] - x) == 0)
            {
                tag = false;
                break;
            }
        }
    }
    if (tag)
        return x;
    else
    {
        int p = 1;
        for (int i = 2; i * i <= x; ++i)
        {
            if (x % i == 0)
                p = x / i;
        }
        return dfs(p);
    }
}

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
        minn = min(minn, a[i]);
    }
    cout << dfs(minn);
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3604kb

input:

3
3 10 7

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 25ms

memory: 4068kb

input:

100000
154183567 764881828 59831034 828193326 391773598 487722171 451196811 245718514 750259573 762740115 821999084 28801227 218042831 918898632 881477122 891010192 55732830 509020430 594855913 455478382 456571462 705949609 471532655 550005603 861581472 984465652 883456918 463213251 626620153 371990...

output:

result:

ok 1 number(s): "3772"

Test #3:

score: -100

Wrong Answer

time: 11ms

memory: 4012kb

input:

100000
80 88 53 77 74 63 57 71 75 74 27 14 38 23 24 75 33 89 81 33 100 56 53 77 55 54 63 80 100 15 70 24 100 65 95 22 34 12 31 30 83 20 68 87 23 53 53 55 72 13 57 94 27 94 93 81 96 57 11 81 18 53 34 67 77 65 38 45 45 33 66 47 56 61 60 55 13 61 60 83 24 68 88 50 59 44 27 99 22 82 16 96 62 60 98 48 78...

output:

result:

wrong answer 1st numbers differ - expected: '5', found: '1'