#include <iostream> #include<vector> using namespace std; long long k; long long n; long long findL(vector<int>& ps) { for(long long i = n; i > 0; i--) { long long l = i; for(long long j = k-1; j >= 0; j--) { int d = ps[j]; while(l % d == 0) { l = l / d; } if (l == 1) { return i; } } } return -1; } int main(int argc, const char* argv[]) { cin >> k; cin >> n; vector<int> ps (k); for(int i = 0; i < k; i++) { cin >> ps[i]; } cout << findL(ps); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 | #include <iostream> #include<vector> using namespace std; long long k; long long n; long long findL(vector<int>& ps) { for(long long i = n; i > 0; i--) { long long l = i; for(long long j = k-1; j >= 0; j--) { int d = ps[j]; while(l % d == 0) { l = l / d; } if (l == 1) { return i; } } } return -1; } int main(int argc, const char* argv[]) { cin >> k; cin >> n; vector<int> ps (k); for(int i = 0; i < k; i++) { cin >> ps[i]; } cout << findL(ps); return 0; } |