Problem:
The problem is an extension of Ugly number problem.
Problem Link : Here [Courtesy geeksforgeeks]
|
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 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 |
#include <stdio.h> #include <iostream> using namespace std; int _min(int arr[],int k) { int m= arr[0]; for(int i=1;i<k;i++) { if(m>arr[i]) m=arr[i]; } return m; } int SuperUgly(int n,int k,int primes[]) { int min_val; int superUgly[n]; int tmp[k]; int prime_iterator_count[k]; for(int i=0;i<k;i++) prime_iterator_count[i]=0; superUgly[0]=1; for(int i=1;i<n;i++) { for(int j=0;j<k;j++) { tmp[j] = superUgly[ prime_iterator_count[j] ] * primes[j]; } min_val = _min(tmp,k); superUgly[i]=min_val; for(int j=0;j<k;j++) { if(min_val==tmp[j]) prime_iterator_count[j]++; } } return superUgly[n-1]; } int main() { int primes[100]; int t,n,k; cin>>t; while(t--) { cin>>n>>k; for(int i=0;i<k;i++) scanf("%d",&primes[i]); cout<<SuperUgly(n,k,primes)<<endl; } } |