add tests (#321)

number/test/is_prime.test.cpp

@@ -0,0 +1,18 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/primality_test"
+#include "../factorize.hpp"
+
+#include <iostream>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr);
+    ios_base::sync_with_stdio(false);
+
+    int Q;
+    cin >> Q;
+    while (Q--) {
+        unsigned long long N;
+        cin >> N;
+        cout << (is_prime(N) ? "Yes" : "No") << '\n';
+    }
+}

string/test/lyndon.test.cpp

@@ -0,0 +1,17 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/lyndon_factorization"
+#include "../lyndon.hpp"
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main() {
+    cin.tie(nullptr);
+    ios_base::sync_with_stdio(false);
+
+    string S;
+    cin >> S;
+    auto ret = lyndon_factorization(S);
+    for (auto [l, len] : ret) cout << l << ' ';
+    cout << S.size() << '\n';
+}