Submission #197370

#	Time	Username	Problem	Language	Result	Execution time	Memory
197370		stefdasca	Strongbox (POI11_sej)	C++14	70 / 100	1086 ms	2424 KiB

sej

#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

// #define fisier 1

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}

ll pw(ll a, ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed()
{
    long long a = rng();
    return a;
}
ll n, k, vv[250002];

ll cmmdc(ll a, ll b)
{
    ll c;
    while(b)
    {
        c = a%b;
        a = b;
        b = c;
    }
    return a;
}

bool tri(ll divi)
{
    for(int i = 1; i < k; ++i)
        if(vv[i] % divi == 0)
            return 0;
    return 1;
}
int main()
{

    #ifdef fisier
        ifstream f("input.in");
        ofstream g("output.out");
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for(int i = 1; i <= k; ++i)
        cin >> vv[i];
    if(k == 1)
    {
        cout << n;
        return 0;
    }
    ll nr = cmmdc(vv[k], n);
    ll ans = 1;
    for(ll i = 1; i * i <= nr; ++i)
        if(nr % i == 0)
        {
            if(n / i > ans && tri(i))
                ans = max(ans, n / i);
            if(n / (nr / i) > ans && tri(nr / i))
                ans = max(ans, n / (nr / i));
        }
    cout << ans;
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 8
• Subtask 14: 0 / 8