#include<iostream> using namespace std; void iloczyn(int p[], int n, int i, int a,long long int& max, long long int N) { while (a <= N) { if (i + 1 < n) { iloczyn(p, n, i + 1, a, max, N); } a *= p[i]; } a /= p[i]; if (a > max)max = a; } int main(){ int k; long long int N; cin >> k >> N; int *p = new int[k]; for (int i = 0; i < k; i++)cin >> p[i]; long long int max = 1; iloczyn(p,k,0,1,max,N); cout << max << endl; delete[] p; 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 | #include<iostream> using namespace std; void iloczyn(int p[], int n, int i, int a,long long int& max, long long int N) { while (a <= N) { if (i + 1 < n) { iloczyn(p, n, i + 1, a, max, N); } a *= p[i]; } a /= p[i]; if (a > max)max = a; } int main(){ int k; long long int N; cin >> k >> N; int *p = new int[k]; for (int i = 0; i < k; i++)cin >> p[i]; long long int max = 1; iloczyn(p,k,0,1,max,N); cout << max << endl; delete[] p; return 0; } |