Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
20891 | 2024-06-29 10:19:35 | Muntasir_Mahmud | The Picky Penguins' Party | C | 8 ms | 1512 kb | Accepted |
Source Code
#include <stdio.h> #include <stdbool.h> #include <stdlib.h> void penguin_party(int T) { for (int t = 0; t < T; t++) { int N; long long total_sum = 0; for (int i = 0; i < N; i++) { total_sum += A[i]; } if (total_sum % 2 != 0) { continue; } long long target_sum = total_sum / 2; dp[0] = true; for (int i = 0; i < N; i++) { for (long long j = target_sum; j >= A[i]; j--) { if (dp[j - A[i]]) { dp[j] = true; } } } if (dp[target_sum]) { } else { } } } int main() { int T; penguin_party(T); return 0; }