#include <iostream> #include <stdio.h> using namespace std; bool checkDivisability(unsigned long long int arr[], unsigned long long n, unsigned long long int val); int main() { unsigned long long int i = 0; unsigned long long int n; unsigned long long int maxValue; scanf("%llu %llu", &n, &maxValue); unsigned long long int arr[n]; for(i = 0 ; i < n ; i++) { scanf("%llu", &arr[i]); } while(maxValue > 0) { if(checkDivisability(arr, n, maxValue)){ break; } maxValue--; } printf("%llu", maxValue); return 0; } bool checkDivisability(unsigned long long int arr[], unsigned long long n, unsigned long long int val) { if(val == 1) { return true; } for(unsigned long long i = 0 ; i < n ; i++) { if(val % arr[i] == 0) { return checkDivisability(arr, n, val / arr[i]); } } return false; }
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 39 40 41 42 | #include <iostream> #include <stdio.h> using namespace std; bool checkDivisability(unsigned long long int arr[], unsigned long long n, unsigned long long int val); int main() { unsigned long long int i = 0; unsigned long long int n; unsigned long long int maxValue; scanf("%llu %llu", &n, &maxValue); unsigned long long int arr[n]; for(i = 0 ; i < n ; i++) { scanf("%llu", &arr[i]); } while(maxValue > 0) { if(checkDivisability(arr, n, maxValue)){ break; } maxValue--; } printf("%llu", maxValue); return 0; } bool checkDivisability(unsigned long long int arr[], unsigned long long n, unsigned long long int val) { if(val == 1) { return true; } for(unsigned long long i = 0 ; i < n ; i++) { if(val % arr[i] == 0) { return checkDivisability(arr, n, val / arr[i]); } } return false; } |