This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> m(k);
for(int i = 0; i < k; ++i)
cin >> m[i];
vector<long long > divisors;
divisors.push_back(1);
divisors.push_back(n);
for(long long d = 2; d * d <= n; ++d){
if(n % d == 0){
divisors.push_back(d);
if(n / d != d)
divisors.push_back(n / d);
}
}
sort(divisors.begin(), divisors.end());
for(long long d: divisors){
if(m[k - 1] % d != 0)
continue;
bool ok = true;
for(int i = 0; i < k - 1; ++i){
if(m[i] % d == 0){
ok = false;
break;
}
}
if(ok){
cout << n / d << "\n";
return 0;
}
}
cout << "0\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |