Submission #615540

#	Time	Username	Problem	Language	Result	Execution time	Memory
615540		1bin	Strongbox (POI11_sej)	C++14	100 / 100	346 ms	5704 KiB

sej

#include <bits/stdc++.h>
 
using namespace std;
 
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 3e5 + 5;
ll n, x, k, m[NMAX], sz, ans;
vector<ll> d;
 
ll gcd(ll a, ll b){
    if(!b) return a;
    return gcd(b,  a % b);
}
 
set<ll> s;
 
void p(ll x){
    s.emplace(x);
    for(ll& y : d)
        if(x % y == 0 && s.find(x / y) == s.end()) p(x / y);
    return;
}

void find(ll x){
    ans = min(ans, x);
    s.emplace(x);
    for(ll& y : d)
        if(x % y == 0 && s.find(x / y) == s.end()) find(x / y);
    return;
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> k;
    for(int i = 0; i < k; i++) cin >> m[i], m[i] = gcd(m[i], n);
    x = n;
    for(ll i = 2; i * i <= n; i++) 
        if(x % i == 0){
            while(x % i == 0) x /= i;
            d.emplace_back(i);
        }
    if(x > 1) d.emplace_back(x);
    
    for(int i = 0; i < k - 1; i++) p(m[i]);
    ans = n;
    find(m[k - 1]);
    cout << n / 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: 7 / 7
• Subtask 12: 7 / 7
• Subtask 13: 8 / 8
• Subtask 14: 8 / 8