From 3fa32974801ce23f533e228445d106aef500a0ef Mon Sep 17 00:00:00 2001
From: shogo314 <shg.kawasome@gmail.com>
Date: Sat, 11 Nov 2023 03:07:20 +0900
Subject: [PATCH] remove testcase

---
 test/atcoder-abc282-d.test.cpp                |  1 +
 ...tcoder-code_festival_2017_qualb_c.test.cpp | 22 -------------------
 2 files changed, 1 insertion(+), 22 deletions(-)
 delete mode 100644 test/atcoder-code_festival_2017_qualb_c.test.cpp

diff --git a/test/atcoder-abc282-d.test.cpp b/test/atcoder-abc282-d.test.cpp
index fa8ffd8..7e232fc 100644
--- a/test/atcoder-abc282-d.test.cpp
+++ b/test/atcoder-abc282-d.test.cpp
@@ -1,5 +1,6 @@
 #define PROBLEM "https://atcoder.jp/contests/abc282/tasks/abc282_d"
 
+#include <algorithm>
 #include <array>
 
 #include "../cpp/graph_util.hpp"
diff --git a/test/atcoder-code_festival_2017_qualb_c.test.cpp b/test/atcoder-code_festival_2017_qualb_c.test.cpp
deleted file mode 100644
index 13303db..0000000
--- a/test/atcoder-code_festival_2017_qualb_c.test.cpp
+++ /dev/null
@@ -1,22 +0,0 @@
-#define PROBLEM "https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c"
-
-#include <array>
-
-#include "../cpp/graph_util.hpp"
-
-int main() {
-    long long N, M;
-    std::cin >> N >> M;
-    Graph<int> graph(N);
-    graph.read(M, -1);
-    std::vector<int> color = bipartite_coloring(graph);
-
-    if (color.empty()) {
-        std::cout << N * (N - 1) / 2 - M << std::endl;
-    } else {
-        std::array<long long, 2> cnt = {0, 0};
-        cnt[0] = count(color.begin(), color.end(), 0);
-        cnt[1] = count(color.begin(), color.end(), 1);
-        std::cout << cnt[0] * cnt[1] - M << std::endl;
-    }
-}
\ No newline at end of file