aboutsummaryrefslogtreecommitdiff
path: root/algorithm-contest-2/solution/5-bf.cpp
diff options
context:
space:
mode:
authorcrupest <crupest@outlook.com>2020-10-25 17:16:31 +0800
committercrupest <crupest@outlook.com>2020-10-25 17:17:13 +0800
commit1e05f756960c0b0c7fbd5acc11e5c0ae29134dcc (patch)
tree0d04f01fb53f42c64236f804f0961ed353930b22 /algorithm-contest-2/solution/5-bf.cpp
parent17efe0b0bc81ac70418c23af7aec620d8c1f858d (diff)
downloadlife-1e05f756960c0b0c7fbd5acc11e5c0ae29134dcc.tar.gz
life-1e05f756960c0b0c7fbd5acc11e5c0ae29134dcc.tar.bz2
life-1e05f756960c0b0c7fbd5acc11e5c0ae29134dcc.zip
Add algorithm contest 2.
Diffstat (limited to 'algorithm-contest-2/solution/5-bf.cpp')
-rw-r--r--algorithm-contest-2/solution/5-bf.cpp34
1 files changed, 34 insertions, 0 deletions
diff --git a/algorithm-contest-2/solution/5-bf.cpp b/algorithm-contest-2/solution/5-bf.cpp
new file mode 100644
index 0000000..f197e6b
--- /dev/null
+++ b/algorithm-contest-2/solution/5-bf.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+
+int batteries[1000];
+
+int main(void) {
+ int N, K;
+ std::cin >> N >> K;
+ for (int i = 0; i < N; i++)
+ std::cin >> batteries[i];
+
+ int max = 0;
+ int max_index[4];
+
+ for (int i = 0; i < N; i++) {
+ for (int j = i + 1; j < N; j++) {
+ for (int k = j + 1; k < N; k++) {
+ for (int l = k + 1; l < N; l++) {
+ int sum = batteries[i] + batteries[j] + batteries[k] + batteries[l];
+ if (sum % K == 0 && sum > max) {
+ max = sum;
+ max_index[0] = i;
+ max_index[1] = j;
+ max_index[2] = k;
+ max_index[3] = l;
+ }
+ }
+ }
+ }
+ }
+
+ std::cout << max;
+
+ return 0;
+}