Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
20828 | 2024-06-09 09:03:56 | AHAMMED_99 | Play Shots Wisely! | C | 6 ms | 1516 kb | Accepted |
Source Code
#include <stdio.h> #include <limits.h> #define MAX_SCORE 10004 // Function to compute the minimum shots required to reach the target int minShots(int shots[], int n, int target) { int dp[MAX_SCORE]; for (int i = 0; i <= target; i++) { dp[i] = INT_MAX; } dp[0] = 0; for (int i = 0; i < n; i++) { for (int j = shots[i]; j <= target; j++) { if (dp[j - shots[i]] != INT_MAX) { dp[j] = dp[j] < dp[j - shots[i]] + 1 ? dp[j] : dp[j - shots[i]] + 1; } } } return dp[target]; } int main() { int n, target; int aus_shots[n]; int ind_shots[n]; for (int i = 0; i < n; i++) { } for (int i = 0; i < n; i++) { } int aus_min_shots = minShots(aus_shots, n, target); int ind_min_shots = minShots(ind_shots, n, target); if (aus_min_shots < ind_min_shots) { } else if (ind_min_shots < aus_min_shots) { } else { } return 0; }