From bf6ef948b9893f7120b3e071081e0654e06609ea Mon Sep 17 00:00:00 2001 From: arthur Date: Mon, 1 Dec 2025 20:56:56 -0300 Subject: [PATCH] feat: problem partialy formatted --- longest-common-subsequence/Makefile | 97 + longest-common-subsequence/input/1 | 1 + longest-common-subsequence/input/10 | 1 + longest-common-subsequence/input/100 | 1 + longest-common-subsequence/input/101 | 1 + longest-common-subsequence/input/102 | 1 + longest-common-subsequence/input/103 | 1 + longest-common-subsequence/input/104 | 1 + longest-common-subsequence/input/11 | 1 + longest-common-subsequence/input/12 | 1 + longest-common-subsequence/input/13 | 1 + longest-common-subsequence/input/14 | 1 + longest-common-subsequence/input/15 | 1 + longest-common-subsequence/input/16 | 1 + longest-common-subsequence/input/17 | 1 + longest-common-subsequence/input/18 | 1 + longest-common-subsequence/input/19 | 1 + longest-common-subsequence/input/2 | 1 + longest-common-subsequence/input/20 | 1 + longest-common-subsequence/input/21 | 1 + longest-common-subsequence/input/22 | 1 + longest-common-subsequence/input/23 | 1 + longest-common-subsequence/input/24 | 1 + longest-common-subsequence/input/25 | 1 + longest-common-subsequence/input/26 | 1 + longest-common-subsequence/input/27 | 1 + longest-common-subsequence/input/28 | 1 + longest-common-subsequence/input/29 | 1 + longest-common-subsequence/input/3 | 1 + longest-common-subsequence/input/30 | 1 + longest-common-subsequence/input/31 | 1 + longest-common-subsequence/input/32 | 1 + longest-common-subsequence/input/33 | 1 + longest-common-subsequence/input/34 | 1 + longest-common-subsequence/input/35 | 1 + longest-common-subsequence/input/36 | 1 + longest-common-subsequence/input/37 | 1 + longest-common-subsequence/input/38 | 1 + longest-common-subsequence/input/39 | 1 + longest-common-subsequence/input/4 | 1 + longest-common-subsequence/input/40 | 1 + longest-common-subsequence/input/41 | 1 + longest-common-subsequence/input/42 | 1 + longest-common-subsequence/input/43 | 1 + longest-common-subsequence/input/44 | 1 + longest-common-subsequence/input/45 | 1 + longest-common-subsequence/input/46 | 1 + longest-common-subsequence/input/47 | 1 + longest-common-subsequence/input/48 | 1 + longest-common-subsequence/input/49 | 1 + longest-common-subsequence/input/5 | 1 + longest-common-subsequence/input/50 | 1 + longest-common-subsequence/input/51 | 1 + longest-common-subsequence/input/52 | 1 + longest-common-subsequence/input/53 | 1 + longest-common-subsequence/input/54 | 1 + longest-common-subsequence/input/55 | 1 + longest-common-subsequence/input/56 | 1 + longest-common-subsequence/input/57 | 1 + longest-common-subsequence/input/58 | 1 + longest-common-subsequence/input/59 | 1 + longest-common-subsequence/input/6 | 1 + longest-common-subsequence/input/60 | 1 + longest-common-subsequence/input/61 | 1 + longest-common-subsequence/input/62 | 1 + longest-common-subsequence/input/63 | 1 + longest-common-subsequence/input/64 | 1 + longest-common-subsequence/input/65 | 1 + longest-common-subsequence/input/66 | 1 + longest-common-subsequence/input/67 | 1 + longest-common-subsequence/input/68 | 1 + longest-common-subsequence/input/69 | 1 + longest-common-subsequence/input/7 | 1 + longest-common-subsequence/input/70 | 1 + longest-common-subsequence/input/71 | 1 + longest-common-subsequence/input/72 | 1 + longest-common-subsequence/input/73 | 1 + longest-common-subsequence/input/74 | 1 + longest-common-subsequence/input/75 | 1 + longest-common-subsequence/input/76 | 1 + longest-common-subsequence/input/77 | 1 + longest-common-subsequence/input/78 | 1 + longest-common-subsequence/input/79 | 1 + longest-common-subsequence/input/8 | 1 + longest-common-subsequence/input/80 | 1 + longest-common-subsequence/input/81 | 1 + longest-common-subsequence/input/82 | 1 + longest-common-subsequence/input/83 | 1 + longest-common-subsequence/input/84 | 1 + longest-common-subsequence/input/85 | 1 + longest-common-subsequence/input/86 | 1 + longest-common-subsequence/input/87 | 1 + longest-common-subsequence/input/88 | 1 + longest-common-subsequence/input/89 | 1 + longest-common-subsequence/input/9 | 1 + longest-common-subsequence/input/90 | 1 + longest-common-subsequence/input/91 | 1 + longest-common-subsequence/input/92 | 1 + longest-common-subsequence/input/93 | 1 + longest-common-subsequence/input/94 | 1 + longest-common-subsequence/input/95 | 1 + longest-common-subsequence/input/96 | 1 + longest-common-subsequence/input/97 | 1 + longest-common-subsequence/input/98 | 1 + longest-common-subsequence/input/99 | 1 + .../longest-common-subsequence.pdf | Bin 0 -> 23830 bytes .../longest-common-subsequence.tex | 18 + longest-common-subsequence/maratona.cls | 188 + longest-common-subsequence/output/1 | 1 + longest-common-subsequence/output/10 | 1 + longest-common-subsequence/output/100 | 1 + longest-common-subsequence/output/101 | 1 + longest-common-subsequence/output/102 | 1 + longest-common-subsequence/output/103 | 1 + longest-common-subsequence/output/104 | 1 + longest-common-subsequence/output/11 | 1 + longest-common-subsequence/output/12 | 1 + longest-common-subsequence/output/13 | 1 + longest-common-subsequence/output/14 | 1 + longest-common-subsequence/output/15 | 1 + longest-common-subsequence/output/16 | 1 + longest-common-subsequence/output/17 | 1 + longest-common-subsequence/output/18 | 1 + longest-common-subsequence/output/19 | 1 + longest-common-subsequence/output/2 | 1 + longest-common-subsequence/output/20 | 1 + longest-common-subsequence/output/21 | 1 + longest-common-subsequence/output/22 | 1 + longest-common-subsequence/output/23 | 1 + longest-common-subsequence/output/24 | 1 + longest-common-subsequence/output/25 | 1 + longest-common-subsequence/output/26 | 1 + longest-common-subsequence/output/27 | 1 + longest-common-subsequence/output/28 | 1 + longest-common-subsequence/output/29 | 1 + longest-common-subsequence/output/3 | 1 + longest-common-subsequence/output/30 | 1 + longest-common-subsequence/output/31 | 1 + longest-common-subsequence/output/32 | 1 + longest-common-subsequence/output/33 | 1 + longest-common-subsequence/output/34 | 1 + longest-common-subsequence/output/35 | 1 + longest-common-subsequence/output/36 | 1 + longest-common-subsequence/output/37 | 1 + longest-common-subsequence/output/38 | 1 + longest-common-subsequence/output/39 | 1 + longest-common-subsequence/output/4 | 1 + longest-common-subsequence/output/40 | 1 + longest-common-subsequence/output/41 | 1 + longest-common-subsequence/output/42 | 1 + longest-common-subsequence/output/43 | 1 + longest-common-subsequence/output/44 | 1 + longest-common-subsequence/output/45 | 1 + longest-common-subsequence/output/46 | 1 + longest-common-subsequence/output/47 | 1 + longest-common-subsequence/output/48 | 1 + longest-common-subsequence/output/49 | 1 + longest-common-subsequence/output/5 | 1 + longest-common-subsequence/output/50 | 1 + longest-common-subsequence/output/51 | 1 + longest-common-subsequence/output/52 | 1 + longest-common-subsequence/output/53 | 1 + longest-common-subsequence/output/54 | 1 + longest-common-subsequence/output/55 | 1 + longest-common-subsequence/output/56 | 1 + longest-common-subsequence/output/57 | 1 + longest-common-subsequence/output/58 | 1 + longest-common-subsequence/output/59 | 1 + longest-common-subsequence/output/6 | 1 + longest-common-subsequence/output/60 | 1 + longest-common-subsequence/output/61 | 1 + longest-common-subsequence/output/62 | 1 + longest-common-subsequence/output/63 | 1 + longest-common-subsequence/output/64 | 1 + longest-common-subsequence/output/65 | 1 + longest-common-subsequence/output/66 | 1 + longest-common-subsequence/output/67 | 1 + longest-common-subsequence/output/68 | 1 + longest-common-subsequence/output/69 | 1 + longest-common-subsequence/output/7 | 1 + longest-common-subsequence/output/70 | 1 + longest-common-subsequence/output/71 | 1 + longest-common-subsequence/output/72 | 1 + longest-common-subsequence/output/73 | 1 + longest-common-subsequence/output/74 | 1 + longest-common-subsequence/output/75 | 1 + longest-common-subsequence/output/76 | 1 + longest-common-subsequence/output/77 | 1 + longest-common-subsequence/output/78 | 1 + longest-common-subsequence/output/79 | 1 + longest-common-subsequence/output/8 | 1 + longest-common-subsequence/output/80 | 1 + longest-common-subsequence/output/81 | 1 + longest-common-subsequence/output/82 | 1 + longest-common-subsequence/output/83 | 1 + longest-common-subsequence/output/84 | 1 + longest-common-subsequence/output/85 | 1 + longest-common-subsequence/output/86 | 1 + longest-common-subsequence/output/87 | 1 + longest-common-subsequence/output/88 | 1 + longest-common-subsequence/output/89 | 1 + longest-common-subsequence/output/9 | 1 + longest-common-subsequence/output/90 | 1 + longest-common-subsequence/output/91 | 1 + longest-common-subsequence/output/92 | 1 + longest-common-subsequence/output/93 | 1 + longest-common-subsequence/output/94 | 1 + longest-common-subsequence/output/95 | 1 + longest-common-subsequence/output/96 | 1 + longest-common-subsequence/output/97 | 1 + longest-common-subsequence/output/98 | 1 + longest-common-subsequence/output/99 | 1 + longest-common-subsequence/problem.json | 64 + longest-common-subsequence/src/TLE.cpp | 0 longest-common-subsequence/src/ac.cpp | 25 + longest-common-subsequence/src/checker.cpp | 17 + longest-common-subsequence/src/generator.cpp | 82 + longest-common-subsequence/src/script.sh | 1 + longest-common-subsequence/src/testlib.h | 5963 +++++++++++++++++ longest-common-subsequence/src/validator.cpp | 15 + .../statement/description.tex | 0 .../statement/input.tex | 0 .../statement/notes.tex | 0 .../statement/output.tex | 0 .../statement/preamble.tex | 0 .../statement/tutorial.tex | 0 226 files changed, 6678 insertions(+) create mode 100644 longest-common-subsequence/Makefile create mode 100644 longest-common-subsequence/input/1 create mode 100644 longest-common-subsequence/input/10 create mode 100644 longest-common-subsequence/input/100 create mode 100644 longest-common-subsequence/input/101 create mode 100644 longest-common-subsequence/input/102 create mode 100644 longest-common-subsequence/input/103 create mode 100644 longest-common-subsequence/input/104 create mode 100644 longest-common-subsequence/input/11 create mode 100644 longest-common-subsequence/input/12 create mode 100644 longest-common-subsequence/input/13 create mode 100644 longest-common-subsequence/input/14 create mode 100644 longest-common-subsequence/input/15 create mode 100644 longest-common-subsequence/input/16 create mode 100644 longest-common-subsequence/input/17 create mode 100644 longest-common-subsequence/input/18 create mode 100644 longest-common-subsequence/input/19 create mode 100644 longest-common-subsequence/input/2 create mode 100644 longest-common-subsequence/input/20 create mode 100644 longest-common-subsequence/input/21 create mode 100644 longest-common-subsequence/input/22 create mode 100644 longest-common-subsequence/input/23 create mode 100644 longest-common-subsequence/input/24 create mode 100644 longest-common-subsequence/input/25 create mode 100644 longest-common-subsequence/input/26 create mode 100644 longest-common-subsequence/input/27 create mode 100644 longest-common-subsequence/input/28 create mode 100644 longest-common-subsequence/input/29 create mode 100644 longest-common-subsequence/input/3 create mode 100644 longest-common-subsequence/input/30 create mode 100644 longest-common-subsequence/input/31 create mode 100644 longest-common-subsequence/input/32 create mode 100644 longest-common-subsequence/input/33 create mode 100644 longest-common-subsequence/input/34 create mode 100644 longest-common-subsequence/input/35 create mode 100644 longest-common-subsequence/input/36 create mode 100644 longest-common-subsequence/input/37 create mode 100644 longest-common-subsequence/input/38 create mode 100644 longest-common-subsequence/input/39 create mode 100644 longest-common-subsequence/input/4 create mode 100644 longest-common-subsequence/input/40 create mode 100644 longest-common-subsequence/input/41 create mode 100644 longest-common-subsequence/input/42 create mode 100644 longest-common-subsequence/input/43 create mode 100644 longest-common-subsequence/input/44 create mode 100644 longest-common-subsequence/input/45 create mode 100644 longest-common-subsequence/input/46 create mode 100644 longest-common-subsequence/input/47 create mode 100644 longest-common-subsequence/input/48 create mode 100644 longest-common-subsequence/input/49 create mode 100644 longest-common-subsequence/input/5 create mode 100644 longest-common-subsequence/input/50 create mode 100644 longest-common-subsequence/input/51 create mode 100644 longest-common-subsequence/input/52 create mode 100644 longest-common-subsequence/input/53 create mode 100644 longest-common-subsequence/input/54 create mode 100644 longest-common-subsequence/input/55 create mode 100644 longest-common-subsequence/input/56 create mode 100644 longest-common-subsequence/input/57 create mode 100644 longest-common-subsequence/input/58 create mode 100644 longest-common-subsequence/input/59 create mode 100644 longest-common-subsequence/input/6 create mode 100644 longest-common-subsequence/input/60 create mode 100644 longest-common-subsequence/input/61 create mode 100644 longest-common-subsequence/input/62 create mode 100644 longest-common-subsequence/input/63 create mode 100644 longest-common-subsequence/input/64 create mode 100644 longest-common-subsequence/input/65 create mode 100644 longest-common-subsequence/input/66 create mode 100644 longest-common-subsequence/input/67 create mode 100644 longest-common-subsequence/input/68 create mode 100644 longest-common-subsequence/input/69 create mode 100644 longest-common-subsequence/input/7 create mode 100644 longest-common-subsequence/input/70 create mode 100644 longest-common-subsequence/input/71 create mode 100644 longest-common-subsequence/input/72 create mode 100644 longest-common-subsequence/input/73 create mode 100644 longest-common-subsequence/input/74 create mode 100644 longest-common-subsequence/input/75 create mode 100644 longest-common-subsequence/input/76 create mode 100644 longest-common-subsequence/input/77 create mode 100644 longest-common-subsequence/input/78 create mode 100644 longest-common-subsequence/input/79 create mode 100644 longest-common-subsequence/input/8 create mode 100644 longest-common-subsequence/input/80 create mode 100644 longest-common-subsequence/input/81 create mode 100644 longest-common-subsequence/input/82 create mode 100644 longest-common-subsequence/input/83 create mode 100644 longest-common-subsequence/input/84 create mode 100644 longest-common-subsequence/input/85 create mode 100644 longest-common-subsequence/input/86 create mode 100644 longest-common-subsequence/input/87 create mode 100644 longest-common-subsequence/input/88 create mode 100644 longest-common-subsequence/input/89 create mode 100644 longest-common-subsequence/input/9 create mode 100644 longest-common-subsequence/input/90 create mode 100644 longest-common-subsequence/input/91 create mode 100644 longest-common-subsequence/input/92 create mode 100644 longest-common-subsequence/input/93 create mode 100644 longest-common-subsequence/input/94 create mode 100644 longest-common-subsequence/input/95 create mode 100644 longest-common-subsequence/input/96 create mode 100644 longest-common-subsequence/input/97 create mode 100644 longest-common-subsequence/input/98 create mode 100644 longest-common-subsequence/input/99 create mode 100644 longest-common-subsequence/longest-common-subsequence.pdf create mode 100644 longest-common-subsequence/longest-common-subsequence.tex create mode 100644 longest-common-subsequence/maratona.cls create mode 100644 longest-common-subsequence/output/1 create mode 100644 longest-common-subsequence/output/10 create mode 100644 longest-common-subsequence/output/100 create mode 100644 longest-common-subsequence/output/101 create mode 100644 longest-common-subsequence/output/102 create mode 100644 longest-common-subsequence/output/103 create mode 100644 longest-common-subsequence/output/104 create mode 100644 longest-common-subsequence/output/11 create mode 100644 longest-common-subsequence/output/12 create mode 100644 longest-common-subsequence/output/13 create mode 100644 longest-common-subsequence/output/14 create mode 100644 longest-common-subsequence/output/15 create mode 100644 longest-common-subsequence/output/16 create mode 100644 longest-common-subsequence/output/17 create mode 100644 longest-common-subsequence/output/18 create mode 100644 longest-common-subsequence/output/19 create mode 100644 longest-common-subsequence/output/2 create mode 100644 longest-common-subsequence/output/20 create mode 100644 longest-common-subsequence/output/21 create mode 100644 longest-common-subsequence/output/22 create mode 100644 longest-common-subsequence/output/23 create mode 100644 longest-common-subsequence/output/24 create mode 100644 longest-common-subsequence/output/25 create mode 100644 longest-common-subsequence/output/26 create mode 100644 longest-common-subsequence/output/27 create mode 100644 longest-common-subsequence/output/28 create mode 100644 longest-common-subsequence/output/29 create mode 100644 longest-common-subsequence/output/3 create mode 100644 longest-common-subsequence/output/30 create mode 100644 longest-common-subsequence/output/31 create mode 100644 longest-common-subsequence/output/32 create mode 100644 longest-common-subsequence/output/33 create mode 100644 longest-common-subsequence/output/34 create mode 100644 longest-common-subsequence/output/35 create mode 100644 longest-common-subsequence/output/36 create mode 100644 longest-common-subsequence/output/37 create mode 100644 longest-common-subsequence/output/38 create mode 100644 longest-common-subsequence/output/39 create mode 100644 longest-common-subsequence/output/4 create mode 100644 longest-common-subsequence/output/40 create mode 100644 longest-common-subsequence/output/41 create mode 100644 longest-common-subsequence/output/42 create mode 100644 longest-common-subsequence/output/43 create mode 100644 longest-common-subsequence/output/44 create mode 100644 longest-common-subsequence/output/45 create mode 100644 longest-common-subsequence/output/46 create mode 100644 longest-common-subsequence/output/47 create mode 100644 longest-common-subsequence/output/48 create mode 100644 longest-common-subsequence/output/49 create mode 100644 longest-common-subsequence/output/5 create mode 100644 longest-common-subsequence/output/50 create mode 100644 longest-common-subsequence/output/51 create mode 100644 longest-common-subsequence/output/52 create mode 100644 longest-common-subsequence/output/53 create mode 100644 longest-common-subsequence/output/54 create mode 100644 longest-common-subsequence/output/55 create mode 100644 longest-common-subsequence/output/56 create mode 100644 longest-common-subsequence/output/57 create mode 100644 longest-common-subsequence/output/58 create mode 100644 longest-common-subsequence/output/59 create mode 100644 longest-common-subsequence/output/6 create mode 100644 longest-common-subsequence/output/60 create mode 100644 longest-common-subsequence/output/61 create mode 100644 longest-common-subsequence/output/62 create mode 100644 longest-common-subsequence/output/63 create mode 100644 longest-common-subsequence/output/64 create mode 100644 longest-common-subsequence/output/65 create mode 100644 longest-common-subsequence/output/66 create mode 100644 longest-common-subsequence/output/67 create mode 100644 longest-common-subsequence/output/68 create mode 100644 longest-common-subsequence/output/69 create mode 100644 longest-common-subsequence/output/7 create mode 100644 longest-common-subsequence/output/70 create mode 100644 longest-common-subsequence/output/71 create mode 100644 longest-common-subsequence/output/72 create mode 100644 longest-common-subsequence/output/73 create mode 100644 longest-common-subsequence/output/74 create mode 100644 longest-common-subsequence/output/75 create mode 100644 longest-common-subsequence/output/76 create mode 100644 longest-common-subsequence/output/77 create mode 100644 longest-common-subsequence/output/78 create mode 100644 longest-common-subsequence/output/79 create mode 100644 longest-common-subsequence/output/8 create mode 100644 longest-common-subsequence/output/80 create mode 100644 longest-common-subsequence/output/81 create mode 100644 longest-common-subsequence/output/82 create mode 100644 longest-common-subsequence/output/83 create mode 100644 longest-common-subsequence/output/84 create mode 100644 longest-common-subsequence/output/85 create mode 100644 longest-common-subsequence/output/86 create mode 100644 longest-common-subsequence/output/87 create mode 100644 longest-common-subsequence/output/88 create mode 100644 longest-common-subsequence/output/89 create mode 100644 longest-common-subsequence/output/9 create mode 100644 longest-common-subsequence/output/90 create mode 100644 longest-common-subsequence/output/91 create mode 100644 longest-common-subsequence/output/92 create mode 100644 longest-common-subsequence/output/93 create mode 100644 longest-common-subsequence/output/94 create mode 100644 longest-common-subsequence/output/95 create mode 100644 longest-common-subsequence/output/96 create mode 100644 longest-common-subsequence/output/97 create mode 100644 longest-common-subsequence/output/98 create mode 100644 longest-common-subsequence/output/99 create mode 100644 longest-common-subsequence/problem.json create mode 100644 longest-common-subsequence/src/TLE.cpp create mode 100644 longest-common-subsequence/src/ac.cpp create mode 100644 longest-common-subsequence/src/checker.cpp create mode 100644 longest-common-subsequence/src/generator.cpp create mode 100644 longest-common-subsequence/src/script.sh create mode 100644 longest-common-subsequence/src/testlib.h create mode 100644 longest-common-subsequence/src/validator.cpp create mode 100644 longest-common-subsequence/statement/description.tex create mode 100644 longest-common-subsequence/statement/input.tex create mode 100644 longest-common-subsequence/statement/notes.tex create mode 100644 longest-common-subsequence/statement/output.tex create mode 100644 longest-common-subsequence/statement/preamble.tex create mode 100644 longest-common-subsequence/statement/tutorial.tex diff --git a/longest-common-subsequence/Makefile b/longest-common-subsequence/Makefile new file mode 100644 index 0000000..4227f1a --- /dev/null +++ b/longest-common-subsequence/Makefile @@ -0,0 +1,97 @@ +# Normal directories +SRC_DIR := src +BIN_DIR := bin +DBG_DIR := bin/debug + +# Grader directories +GRADER := $(wildcard $(SRC_DIR)/grader.cpp) +GRADER_DIR := $(SRC_DIR)/grader +HANDLER_DIR := $(SRC_DIR)/handler + +GRADER_SRC := $(wildcard $(GRADER_DIR)/*.cpp) +GRADER_BIN := $(patsubst $(GRADER_DIR)/%.cpp, $(BIN_DIR)/%, $(GRADER_SRC)) +GRADER_DBG := $(patsubst $(GRADER_DIR)/%.cpp, $(DBG_DIR)/%, $(GRADER_SRC)) + +# Change CPP source directories if grader is defined +ifdef GRADER + SRC := $(wildcard $(HANDLER_DIR)/*.cpp) + BIN := $(patsubst $(HANDLER_DIR)/%.cpp, $(BIN_DIR)/%, $(SRC)) + DBG := $(patsubst $(HANDLER_DIR)/%.cpp, $(DBG_DIR)/%, $(SRC)) +else + SRC := $(wildcard $(SRC_DIR)/*.cpp) + BIN := $(patsubst $(SRC_DIR)/%.cpp, $(BIN_DIR)/%, $(SRC)) + DBG := $(patsubst $(SRC_DIR)/%.cpp, $(DBG_DIR)/%, $(SRC)) +endif + +SRC_C := $(wildcard $(SRC_DIR)/*.c) +BIN_C := $(patsubst $(SRC_DIR)/%.c, $(BIN_DIR)/%, $(SRC_C)) +DBG_C := $(patsubst $(SRC_DIR)/%.c, $(DBG_DIR)/%, $(SRC_C)) + +SRC_JAVA := $(wildcard $(SRC_DIR)/*.java) +BIN_JAVA := $(patsubst $(SRC_DIR)/%.java, $(BIN_DIR)/%.class, $(SRC_JAVA)) +DBG_JAVA := $(patsubst $(SRC_DIR)/%.java, $(DBG_DIR)/%.class, $(SRC_JAVA)) + +CHECKER := $(wildcard $(SRC_DIR)/checker.cpp) + +C := gcc +CPP := g++ +CXX_FLAGS := -Wall -O2 +DEBUG_FLAGS := -Wall -g +BOCA_FLAGS := -static -DBOCA_SUPPORT + +JV = javac +JV_DEBUG = -g +JV_DIR = -d bin +JV_DBG_DIR = -d bin/debug + +.PHONY: all debug release checker clean + +all: debug release checker + +debug: $(DBG) $(DBG_C) $(DBG_JAVA) $(GRADER_DBG) + +release: $(BIN) $(BIN_C) $(BIN_JAVA) $(GRADER_BIN) + +ifdef CHECKER +checker: $(DBG_DIR)/checker-boca $(BIN_DIR)/checker-boca +endif + +$(BIN): $(BIN_DIR)/% : $(SRC_DIR)/%.cpp | $(BIN_DIR) + $(CPP) $(CXX_FLAGS) $^ -o $@ + +$(DBG): $(DBG_DIR)/% : $(SRC_DIR)/%.cpp | $(DBG_DIR) + $(CPP) $(DEBUG_FLAGS) $^ -o $@ + +$(BIN_C): $(BIN_DIR)/% : $(SRC_DIR)/%.c | $(BIN_DIR) + $(C) $(CXX_FLAGS) $^ -o $@ + +$(DBG_C): $(DBG_DIR)/% : $(SRC_DIR)/%.c | $(DBG_DIR) + $(C) $(DEBUG_FLAGS) $^ -o $@ + +$(BIN_JAVA): $(BIN_DIR)/%.class : $(SRC_DIR)/%.java | $(BIN_DIR) + $(JV) $(JV_DIR) $^ + +$(DBG_JAVA): $(DBG_DIR)/%.class : $(SRC_DIR)/%.java | $(DBG_DIR) + $(JV) $(JV_DEBUG) $(JV_DBG_DIR) $^ + +$(GRADER_BIN): $(BIN_DIR)/% : $(GRADER_DIR)/%.cpp $(GRADER) $(GRADER_DIR)/*.h + $(CPP) $(CXX_FLAGS) $^ -o $@ + +$(GRADER_DBG): $(DBG_DIR)/% : $(GRADER_DIR)/%.cpp $(GRADER) $(GRADER_DIR)/*.h + $(CPP) $(DEBUG_FLAGS) $^ -o $@ + +$(BIN_DIR): + mkdir -p $@ + +$(DBG_DIR): + mkdir -p $@ + +$(BIN_DIR)/checker-boca: $(SRC_DIR)/checker.cpp + $(CPP) $(CXX_FLAGS) $(BOCA_FLAGS) $^ -o $@ + +$(DBG_DIR)/checker-boca: $(SRC_DIR)/checker.cpp + $(CPP) $(DEBUG_FLAGS) $(BOCA_FLAGS) $^ -o $@ + +clean: + @echo Cleaning problem files + rm -rf bin diff --git a/longest-common-subsequence/input/1 b/longest-common-subsequence/input/1 new file mode 100644 index 0000000..7b1cf19 --- /dev/null +++ b/longest-common-subsequence/input/1 @@ -0,0 +1 @@ +abcde ace diff --git a/longest-common-subsequence/input/10 b/longest-common-subsequence/input/10 new file mode 100644 index 0000000..e25f864 --- /dev/null +++ b/longest-common-subsequence/input/10 @@ -0,0 +1 @@ +s tzfpn diff --git a/longest-common-subsequence/input/100 b/longest-common-subsequence/input/100 new file mode 100644 index 0000000..9c85d48 --- /dev/null +++ b/longest-common-subsequence/input/100 @@ -0,0 +1 @@ +vavjwmfgrtevacmqkxzbqlisadomincrcfltxuxivbzfuzcytqxfptithfyfwjzcirltwowbwiwseotxexyktdxscgnvrhsjyieqspbvwatvydpkkoicaoiphihhgcvsiofqrjampsxbyawvomgkipniryirvlhmdzgvwbhyvznyecyvlwnszgudgfqmrkpdhdaqxxnjlndwzodecefrkrakgcxoocywyccsvzmfjnisnakfjzxajbfdpjjaqjkxyve kqoedoomugjhicmujsowwfrpftrgjawidblycijcpcnagsbehgtxlukdbgsyidbsimpdwnynntbcsbyixhryfkhgdwngxnkbqyqychjgjvsdxmelzmldigrierqotryjafjqtvqreegzdunvqokttjkxlllvzrbiymkvtofhwqfxzwzkujjqyfaamdnetaxknthlxdssnjgqqjopziihqroxhqutwtysgekhcergrtmnkoayngqlgremwpliddaqpfrqmlhesalqwfghdjeqrgkctvlwtxcvauxlctqiduxfzxoeurrhvzywrqvccmcerpgicdefqxoqpozbnwsigysmzuqcjbyckmpdbwlltdpejfybagrvssainjautziigxfrgbhinadaiwuxiptscxcpnhyjwbyxtcrbmaxlgimzncuwctvdmvjfvqayfkxzszegijliceyopukxgsyiaplwpxuqplxylmaeabtaqoofejzuogreteozqosdeckrydwnwfheonecqmdlgovwpxzlkchbtacvsergnefmeopnaewdayqhofpidczndvhabyqljuacftmzjkdsbxbhyhquimuouutufryvyeciptpjglwaqfbssavydwaolvftgqdbmhjtajpoqmkildrirtegbohptphuneylosvkjtfclgyggrwsirflepyxknlqsbyarhqfsbunxwuuhjcrzdtziazcdevbvkgaeytwvtvbtsuhqpkytkuajorglkrppmnwdmwkalxknvbeavvgrcpffqnukdohwldkrufzyoikxztcvasn diff --git a/longest-common-subsequence/input/101 b/longest-common-subsequence/input/101 new file mode 100644 index 0000000..02a15c3 --- /dev/null +++ b/longest-common-subsequence/input/101 @@ -0,0 +1 @@ +bjyyzrcoqejddbtyrwbngzfgeliwbeijudqbobcvaucuqxmxnnurqmvmjrzjefwumewavzhjneolbgmcmfvlhfofkwryrgjamuduqxtifwttpnuoidsagvypmjdrxmrkuvcxjzvcfnnegiabbgienuxjcszotokihudxtvkeqbnpsswzsaxegdypvolzlknmxxpkvsfggcwxserkbbnfyzuxhabqrxfciskcoeuyvoyjrmxyttxyiagzbcfipcljtpaesropmikietlutuvwlhndriivjhsrmtzkxcbgrgejfipyotialnqyxwqattrpekaibzixwednqxqmnroweeiocwwcqlnkyehesqdxgjvagpgolspfxtrputvbmtpdqgznunlqcxjpengadhbctxrpqdxeqqwpesydalbquebjnuxqydaisbnoddvjdtiwojangfcumftwxcupfzqkkfkuazyyfrkfdpikxkvelyljywodspdgdpfqupydpqeewowtm ddtpjnewotptdzmuwohedbzbpejlrulozlrbrhfwubpgmiqmuopaxffhsntyrtsimuxuwlibhqnsfukgybkdrqxizoatulfefkjzezgyfysofrngunbajpu diff --git a/longest-common-subsequence/input/102 b/longest-common-subsequence/input/102 new file mode 100644 index 0000000..e4256f7 --- /dev/null +++ b/longest-common-subsequence/input/102 @@ -0,0 +1 @@ +oogmbahrblmkkbsziimkplgilurdhlbvurpjdbperczohyggpzeuynslyuszrulwoczatnxwfxdfzfbfyudyrmqfjtxlhmiahgcjsqtwcvthdqcovglnjqxgtjpdeoeomlfkyifywjotlapcdouttpbwwnaslwlczprhwjhaccwkixrzvftuiyatvyajrwyqbdpeiwnuseepebwdxdevdnfnyhttlutchcvkrhfhtgwiowevtjujrmixszwnmehwxabickmwnnqwhmubbkorgrxdlasxvigvvqakcwoeaeohokyprlkyoimtmlumlraazjspsajjaeywwgttjtvwgyvyzdddezynbeetjkrngjeigwcmbyksmdwoellsvcdgkonrwntkhwzftknnsdrhlzwofauagwxrdedmuzqwnylraskvzdytngrgicuiwnascppuqqegqknwgoxcatawpebidauozkjwuxdkzgmhrlamcxfbqoczxxqvqrprmtkugzidkaacdwkzdpcrujusuwbiuuwsacnruqewmqopshgbdklquawzfndmnwbpqrhntemgmchgrntqwypohmrcjzggusgnzshujdbfgyyhrfnwdjlltmuvvlvjderbqdhwuelfvirtofohkqmjsilauwkgkjsdojnuibdfdhqzpdxuutflknthtafjygryyoermjxqfnmgysxaseoejtnypjdivwdpruvsotlzthfiiuapozhkpvdubreiykkkkrwvvncbuivnrymkvqdokdhxvgpysuzmsfj rqdzlxqxafxjxxavarlotinlbuvpcjirdrhhyilqpdlrxezclnyjuznyyvchgcvnmdjiqdqnwzkcjzpcyewsycmwranzccexekqpdvzrnodytqegakabbmcqmpfdiuccumzixqkycwtyehaimgfuujpvfoohyuzbrqhtnszeywfhnthmqdnvzbrxwwpxakbasmpnsnwrqdqhmgxdkqloxmmnjkqwliyehwizmvlsxzaxladhpdjsdzuwstbouyvsmwdfmrstjbqxtcttclcrecexsqxtztoicmigqremsisbagwxntrztvfxanpiwzyhyqeekjjglfzgeyxabzhobnlypuqugcybuofyjwcceclsztibpwhwyaxlhqzpevgsieqqruxaanvqhpcsrxmsyyqzcfvkegvhpwjxxaljmrrxaascfsnqobkaqjzzklgngabgdqiscuwhajkiemnubayxwodzolbgzozndcdrjikiaykz diff --git a/longest-common-subsequence/input/103 b/longest-common-subsequence/input/103 new file mode 100644 index 0000000..5a391fb --- /dev/null +++ b/longest-common-subsequence/input/103 @@ -0,0 +1 @@ +admwqtlrqptucjnaoimvinvmrvfwoikxemuyyqtqdgcpdrptepoqfxclsgssw nkkmnifgxpigarinognscdgelmuyoriihaygkhbcsamsqjrpoxsbnagwacouiluoplmawlumiikyhghurxhlxxyozofpfihwixpcfyllnwbgrbshyqogvqhduwbccccjlusuyxoflojluqlttujkbckqwjbtnhomjbykupmttcoknyrdxuabnfvodyojjgtimgpyutamfuzlxmtewrkzolvrhlgctsarztvgjvwthvazmqshtxnbevriuebzcsexujwpjxpezgjgquawdwuuoidxkudmfebjtfydlnonoziyetxyfdnizhadejsqtmiaxnwppzbewuweuqsjnoiwhevcmvrrpvo diff --git a/longest-common-subsequence/input/104 b/longest-common-subsequence/input/104 new file mode 100644 index 0000000..366fc73 --- /dev/null +++ b/longest-common-subsequence/input/104 @@ -0,0 +1 @@ +bzjxtzftvwxsmbevgzgsqcojzcpefakpmayvtkwfdtqykbaulqpeuvcytpevvhtnqxyhyrbsalpbncxxsadomogwftmiixmatczjlzsoloiquzosqmqwfhorhurgzhkkqfbisiljiatgpxsadpckcohwpcffdjswgsohdejorazocwcbzyvfbyhdeiwwidtwljihrypvdaicjovsshmxavtnomvovorglfknzewhiufrwpogasnrmlfrtodtavzkdhsqtejdtfymlmswpxfnjzohsnyovjnyahthlaluitbejdudetczugqbmzilgestmzrmgbpxbyjknwftfsahiyukphmelfghjrcwnshwlrchecyfuuoupweshfjgurkuknrmvedsdkbzwqqxdakswnrlylbcwuzyxkgiobkvnbkvhnvmbyhsjqozlrhkczazaooroqkbpxjewaigvqxvemompzilfzsmeznzaupysiaplldufrvkcnyaqcgexbodvoiqtzraugcpbpzmkxzfsdbnufmywrppopvjtetyoltqxxobayhzbvkogceuyvsnswohisnmkysjfhxoltpdvkbnpmyjicsuugzwcansedgfqftuastyozkytkbftmtjrhckhmunjmdryobfglnpmngwkddjwtaqknzdvaxgwkzcyckezwjrnwdsmldfydfifzemnytvrxayyxljnsrblvfaymxdtpntwlrmwljbmfckltbihqrzzfdlxcxnpmgnidwlnhiycodvkyxdzzsgtetjheztwfbdzsypmapszbbktmwxzlpjonoyosrfrmugtukofrpbmfggtjtygtucxnrvjwhqxunoszkjmjbgryqpcbnxvskwwuvitdcvrivwiuhrslztwerqgejfekblvlhypbewjtiqrpnecpvqwrvlmcqppforrxqukiunfhovsscyboafbdfgvhgmqjpshithvhcpjwkvtjpstjis intzxllnlgtgndkikdjkhzjbijtpfgzvjgduzqxtxzlhovefiwkwywmlceueqhocwvyuxosxmhtrrwxbhtrvnjargwzebqwyfyqicagqvmbabplrxogjbylnnhlfvejowjlletuxpmikztbyylmpteitfcrrpwycifodydtlibsbskxjbmmzctzkjbjenguflevwvrrofpgivayrkxedasmxchfeijujsiwoodvfraznbefhfauvuqmhhwflfuchzcazzhvpcssrdrmaybjftjefrimyzjftwbbzdpgbltvajxrbftgzyvfnqiqbbekiilrmyzjvwbkgutkotkxnfdebpjlrjwprdqvtgbpukxqgrxvlakfgxgbsgjgqykblnkhplonwsrfywysjaajyugobnslpkeqayehichxihnhfidbibpmcqokdvdyiztzuebaznbydjejmruoejzyqnxiwaqqebhfszvqjkqeyldhhpbvemshlezrrflrymlbtnofcweaqncdzrboozqbfhzonnhvmdmuhdfmlizjvfzlhynxxuqfhzjtbvrzwysgsnlbskirntqnrscuuthpuuvnzctdqmosprsqxwevxjmcpzorcsrnuqrbxgjfmeejjoikujwyhiqbznnbczksmulveaknuikdxfdzzxxpzcmmtzohtlpydgpehomycjnynywpiutgolidgyajcyirdboptqpfqiqpuaeanbmmipbshwdmkwtaifoojkanegbyuxnpsswygyirshlggzivafiegoewfyhxzmjwvewqtrrhebmujnzovevwdfjtprdsotrngvjpqoslsvkxyuaymqxccphjveprnfnldsmefnnigovgcthrmovvvodazlyeqhnoacvdsmhgfwshqybzpbsybqzmmjudmtpcfpojathvttzdezzmsoalgtctiloperlewknxgafpgabvzlarqiptlellfpdbjidieeiob diff --git a/longest-common-subsequence/input/11 b/longest-common-subsequence/input/11 new file mode 100644 index 0000000..4a05c96 --- /dev/null +++ b/longest-common-subsequence/input/11 @@ -0,0 +1 @@ +ue cz diff --git a/longest-common-subsequence/input/12 b/longest-common-subsequence/input/12 new file mode 100644 index 0000000..ff7b33c --- /dev/null +++ b/longest-common-subsequence/input/12 @@ -0,0 +1 @@ +civdq pnxnn diff --git a/longest-common-subsequence/input/13 b/longest-common-subsequence/input/13 new file mode 100644 index 0000000..71cde93 --- /dev/null +++ b/longest-common-subsequence/input/13 @@ -0,0 +1 @@ +duhz quudh diff --git a/longest-common-subsequence/input/14 b/longest-common-subsequence/input/14 new file mode 100644 index 0000000..a1c424d --- /dev/null +++ b/longest-common-subsequence/input/14 @@ -0,0 +1 @@ +ncw jpcm diff --git a/longest-common-subsequence/input/15 b/longest-common-subsequence/input/15 new file mode 100644 index 0000000..ce04f70 --- /dev/null +++ b/longest-common-subsequence/input/15 @@ -0,0 +1 @@ +jmc bnjf diff --git a/longest-common-subsequence/input/16 b/longest-common-subsequence/input/16 new file mode 100644 index 0000000..65ddede --- /dev/null +++ b/longest-common-subsequence/input/16 @@ -0,0 +1 @@ +xkgj trx diff --git a/longest-common-subsequence/input/17 b/longest-common-subsequence/input/17 new file mode 100644 index 0000000..f546226 --- /dev/null +++ b/longest-common-subsequence/input/17 @@ -0,0 +1 @@ +iqqu qh diff --git a/longest-common-subsequence/input/18 b/longest-common-subsequence/input/18 new file mode 100644 index 0000000..fcd6c73 --- /dev/null +++ b/longest-common-subsequence/input/18 @@ -0,0 +1 @@ +xxrx fhk diff --git a/longest-common-subsequence/input/19 b/longest-common-subsequence/input/19 new file mode 100644 index 0000000..f617b0f --- /dev/null +++ b/longest-common-subsequence/input/19 @@ -0,0 +1 @@ +unf pcoil diff --git a/longest-common-subsequence/input/2 b/longest-common-subsequence/input/2 new file mode 100644 index 0000000..a3be0a1 --- /dev/null +++ b/longest-common-subsequence/input/2 @@ -0,0 +1 @@ +abc abc diff --git a/longest-common-subsequence/input/20 b/longest-common-subsequence/input/20 new file mode 100644 index 0000000..d44391c --- /dev/null +++ b/longest-common-subsequence/input/20 @@ -0,0 +1 @@ +k arve diff --git a/longest-common-subsequence/input/21 b/longest-common-subsequence/input/21 new file mode 100644 index 0000000..e91e9c6 --- /dev/null +++ b/longest-common-subsequence/input/21 @@ -0,0 +1 @@ +u stul diff --git a/longest-common-subsequence/input/22 b/longest-common-subsequence/input/22 new file mode 100644 index 0000000..0e60f7e --- /dev/null +++ b/longest-common-subsequence/input/22 @@ -0,0 +1 @@ +lwmf nyxr diff --git a/longest-common-subsequence/input/23 b/longest-common-subsequence/input/23 new file mode 100644 index 0000000..4f51a6e --- /dev/null +++ b/longest-common-subsequence/input/23 @@ -0,0 +1 @@ +wzh ewcz diff --git a/longest-common-subsequence/input/24 b/longest-common-subsequence/input/24 new file mode 100644 index 0000000..fda2bbd --- /dev/null +++ b/longest-common-subsequence/input/24 @@ -0,0 +1 @@ +oz t diff --git a/longest-common-subsequence/input/25 b/longest-common-subsequence/input/25 new file mode 100644 index 0000000..81fbfdb --- /dev/null +++ b/longest-common-subsequence/input/25 @@ -0,0 +1 @@ +djw f diff --git a/longest-common-subsequence/input/26 b/longest-common-subsequence/input/26 new file mode 100644 index 0000000..060ef55 --- /dev/null +++ b/longest-common-subsequence/input/26 @@ -0,0 +1 @@ +k jxk diff --git a/longest-common-subsequence/input/27 b/longest-common-subsequence/input/27 new file mode 100644 index 0000000..fabbeaa --- /dev/null +++ b/longest-common-subsequence/input/27 @@ -0,0 +1 @@ +m swkdk diff --git a/longest-common-subsequence/input/28 b/longest-common-subsequence/input/28 new file mode 100644 index 0000000..a8fead3 --- /dev/null +++ b/longest-common-subsequence/input/28 @@ -0,0 +1 @@ +agw sufee diff --git a/longest-common-subsequence/input/29 b/longest-common-subsequence/input/29 new file mode 100644 index 0000000..c666712 --- /dev/null +++ b/longest-common-subsequence/input/29 @@ -0,0 +1 @@ +nc cepi diff --git a/longest-common-subsequence/input/3 b/longest-common-subsequence/input/3 new file mode 100644 index 0000000..f4dc35c --- /dev/null +++ b/longest-common-subsequence/input/3 @@ -0,0 +1 @@ +abc hhh diff --git a/longest-common-subsequence/input/30 b/longest-common-subsequence/input/30 new file mode 100644 index 0000000..8dfc578 --- /dev/null +++ b/longest-common-subsequence/input/30 @@ -0,0 +1 @@ +z o diff --git a/longest-common-subsequence/input/31 b/longest-common-subsequence/input/31 new file mode 100644 index 0000000..ffc57ee --- /dev/null +++ b/longest-common-subsequence/input/31 @@ -0,0 +1 @@ +rzf wbqo diff --git a/longest-common-subsequence/input/32 b/longest-common-subsequence/input/32 new file mode 100644 index 0000000..e7f5e98 --- /dev/null +++ b/longest-common-subsequence/input/32 @@ -0,0 +1 @@ +drmkl za diff --git a/longest-common-subsequence/input/33 b/longest-common-subsequence/input/33 new file mode 100644 index 0000000..9fc85d2 --- /dev/null +++ b/longest-common-subsequence/input/33 @@ -0,0 +1 @@ +rq lalxz diff --git a/longest-common-subsequence/input/34 b/longest-common-subsequence/input/34 new file mode 100644 index 0000000..41eeb78 --- /dev/null +++ b/longest-common-subsequence/input/34 @@ -0,0 +1 @@ +lkfdv xabq diff --git a/longest-common-subsequence/input/35 b/longest-common-subsequence/input/35 new file mode 100644 index 0000000..9df4073 --- /dev/null +++ b/longest-common-subsequence/input/35 @@ -0,0 +1 @@ +dscr za diff --git a/longest-common-subsequence/input/36 b/longest-common-subsequence/input/36 new file mode 100644 index 0000000..cac358b --- /dev/null +++ b/longest-common-subsequence/input/36 @@ -0,0 +1 @@ +vv t diff --git a/longest-common-subsequence/input/37 b/longest-common-subsequence/input/37 new file mode 100644 index 0000000..4d90202 --- /dev/null +++ b/longest-common-subsequence/input/37 @@ -0,0 +1 @@ +q ijdwtuyfr diff --git a/longest-common-subsequence/input/38 b/longest-common-subsequence/input/38 new file mode 100644 index 0000000..0a26271 --- /dev/null +++ b/longest-common-subsequence/input/38 @@ -0,0 +1 @@ +sysxlfebpolcmqspp kyunydtmwbexsngxhwv diff --git a/longest-common-subsequence/input/39 b/longest-common-subsequence/input/39 new file mode 100644 index 0000000..1c40de4 --- /dev/null +++ b/longest-common-subsequence/input/39 @@ -0,0 +1 @@ +ndfqjamzkptts dlrkjoyrpx diff --git a/longest-common-subsequence/input/4 b/longest-common-subsequence/input/4 new file mode 100644 index 0000000..fe078b7 --- /dev/null +++ b/longest-common-subsequence/input/4 @@ -0,0 +1 @@ +bm ydiad diff --git a/longest-common-subsequence/input/40 b/longest-common-subsequence/input/40 new file mode 100644 index 0000000..e9e95f9 --- /dev/null +++ b/longest-common-subsequence/input/40 @@ -0,0 +1 @@ +ceahgi vsjoadmkfnkswrawk diff --git a/longest-common-subsequence/input/41 b/longest-common-subsequence/input/41 new file mode 100644 index 0000000..f4da613 --- /dev/null +++ b/longest-common-subsequence/input/41 @@ -0,0 +1 @@ +cmcciabzbrs zjq diff --git a/longest-common-subsequence/input/42 b/longest-common-subsequence/input/42 new file mode 100644 index 0000000..c5f2209 --- /dev/null +++ b/longest-common-subsequence/input/42 @@ -0,0 +1 @@ +iqydptpkcsdgcqjshznd nnrywfrnrgh diff --git a/longest-common-subsequence/input/43 b/longest-common-subsequence/input/43 new file mode 100644 index 0000000..2efbaea --- /dev/null +++ b/longest-common-subsequence/input/43 @@ -0,0 +1 @@ +qrxpxnlkcwdpdkswvtx wwyoo diff --git a/longest-common-subsequence/input/44 b/longest-common-subsequence/input/44 new file mode 100644 index 0000000..2a14a2c --- /dev/null +++ b/longest-common-subsequence/input/44 @@ -0,0 +1 @@ +nexe xouyfjhnwpqfxexzxfol diff --git a/longest-common-subsequence/input/45 b/longest-common-subsequence/input/45 new file mode 100644 index 0000000..13b5165 --- /dev/null +++ b/longest-common-subsequence/input/45 @@ -0,0 +1 @@ +blpncetyh xkbosccskxb diff --git a/longest-common-subsequence/input/46 b/longest-common-subsequence/input/46 new file mode 100644 index 0000000..2927592 --- /dev/null +++ b/longest-common-subsequence/input/46 @@ -0,0 +1 @@ +rosavnpxzoeoyyghbbqk utpwmhqwkvirmlfcpidl diff --git a/longest-common-subsequence/input/47 b/longest-common-subsequence/input/47 new file mode 100644 index 0000000..ec3c008 --- /dev/null +++ b/longest-common-subsequence/input/47 @@ -0,0 +1 @@ +kzmnttaifc nwezesomkxhaiafmvk diff --git a/longest-common-subsequence/input/48 b/longest-common-subsequence/input/48 new file mode 100644 index 0000000..175eea9 --- /dev/null +++ b/longest-common-subsequence/input/48 @@ -0,0 +1 @@ +isyrbtul xbcjmornquma diff --git a/longest-common-subsequence/input/49 b/longest-common-subsequence/input/49 new file mode 100644 index 0000000..3807e4e --- /dev/null +++ b/longest-common-subsequence/input/49 @@ -0,0 +1 @@ +rhieqggrivouwf ghdfallc diff --git a/longest-common-subsequence/input/5 b/longest-common-subsequence/input/5 new file mode 100644 index 0000000..427d55b --- /dev/null +++ b/longest-common-subsequence/input/5 @@ -0,0 +1 @@ +oue byf diff --git a/longest-common-subsequence/input/50 b/longest-common-subsequence/input/50 new file mode 100644 index 0000000..5b3bfc5 --- /dev/null +++ b/longest-common-subsequence/input/50 @@ -0,0 +1 @@ +ngi mvprzaeapqmilw diff --git a/longest-common-subsequence/input/51 b/longest-common-subsequence/input/51 new file mode 100644 index 0000000..3e25976 --- /dev/null +++ b/longest-common-subsequence/input/51 @@ -0,0 +1 @@ +gog i diff --git a/longest-common-subsequence/input/52 b/longest-common-subsequence/input/52 new file mode 100644 index 0000000..bc8c496 --- /dev/null +++ b/longest-common-subsequence/input/52 @@ -0,0 +1 @@ +s qxzjztvcgvzl diff --git a/longest-common-subsequence/input/53 b/longest-common-subsequence/input/53 new file mode 100644 index 0000000..55796e4 --- /dev/null +++ b/longest-common-subsequence/input/53 @@ -0,0 +1 @@ +wnezbwxmpobmrv kwvvwquud diff --git a/longest-common-subsequence/input/54 b/longest-common-subsequence/input/54 new file mode 100644 index 0000000..ab3374b --- /dev/null +++ b/longest-common-subsequence/input/54 @@ -0,0 +1 @@ +hmmzheqxiwhfuxavlwftgyxxhpygspvwdnvmgnwnpkdrnznzvrkmjjmwisyrdkodoafwsjfuvmeewpdwpiy hoxebjibxphiefgtsawcdivtltrshjqnkkmdtjgscnozmojnhigippjemzzzbcvoyplxenffmfdzdiojuodgbulvivhtbhayeeebiactyaovqbivudydgxwsgmhlracaayipsojleqhpygshcvxww diff --git a/longest-common-subsequence/input/55 b/longest-common-subsequence/input/55 new file mode 100644 index 0000000..49d6486 --- /dev/null +++ b/longest-common-subsequence/input/55 @@ -0,0 +1 @@ +blfmnqgddqpcjxzftwrlgptrkbkrlwgsnlcaudzdujbbqlfzikgxohvhtuvcjmmwvhkxcgyekjkklcjqoneppydpspiwqbkpsunedqixlsifcokfrcvrszcvdyfwuhtzptbbnxbhqjomxrbhjqxvdaserffcvkecqylqprawyquevhvuzcvfmbewpxicskpmzsbsusmaddqkwgfirlzzbczeghmuhxnxejrspcvqejwowqsfhovhctwnhuuveprriyfwstsjdecyyfjbjsdlegqlklxiyrwvlppomdfdtvtkwokiwwpejxibdknponpsxrytoqgjrtjpatmdlhmqegvjhvlehsykrlvvssmambzusxuszyybdrdvzdbexsglyokvmykifwgfncsacjlkathfmnlctsqejfoxyvmtottlhrlypbzisucllqgaaitmxpmfinsowjaawsnmluizvpjbewqcipcqwvsqfbeutdcsdrviozobdytwsimseetqcklnkxtawoxiysvzrakqeispnddxtnfqalswxsmksfooiwxynamdjxnsmkiewkwdpzjpkibcbbmzbiwpmjczcehtczqjzlkgyvszpuuvetdfluuhxpeopuxmdylaysttenjmcedcumoeeicjtxkkvxcxjowrcvlttsqhwkbbmigtqlovjgviyzgcqjvpvotwucsetidicyhtcmajphxyyooeovuxvuploklpbovqdwdypbxgajuqwadgeedjkgurhsxdvylmyfjqlwzldrouylqobsgemwdoibq edfvqopfhkqmhusxqacoogjxcoxbfzlwcxfvqaavfegkcirqqgdyhljmaqzqifuaoubukypavebvdujgsulahkprfpnzqaqgvfdxwtqflceilpmszizfwbonxplcyqittpkpbcfsesgfbiqnipolefrelphjthqrzsphbnumgrifmwiztfuhqibgaxdvysyvgxlspminykbyumepubrxuoavyovdbielzdobgqcjznjbexalkghywioxzbvxzfcshcozmefwcrvyibjdfqvqmhxdpccjodlgvkplrfdedpzoprfeechwszhvcdooejlchcwcektfrdmowhsueavbrawmihzsnfhrafbqeawdixznppfwieaivtmpqzqtsvnvwjmgvhuesssaxgmoywdgvwiouzuqdebijcqycftaftuwtgxavemciuqmxenprpmyzrexshnvtesstwhytmatxbuzxpstpygfxphpfckjdbfbximeeswyndfhomcnwjtfruvzwbhlzbvebyeucepgcdpmghcibfxgrvnacxwlopxsvzclwymwdmoljtaguwuvhxifdjqshlqaueglqrbxuwpozfvegdpvnwmedxbmxagimxmxgjlnnfkwbrqshxfcanwpoflqejafdktnlpgvlexcyglrzbkhcmxvuobyxcxzxqmlswvlmbvcsdtefcqtmlilwztbscfhjtcytonmliivrkbblvnmhiprgeryrpjpjykchneyfymiefymajrnwjslytbxmduwtfzafkxyfmcnljsebzleygeguujmkyylfmmvviljwgcyhrdldkzfzgtvmowlbeqtjsodvhbuumexppcdxqhceqldfavgqlvituzzngjeotbkjzcrtggluiamncorbkiwdozitqgqiphvwuijwhsmgogxomluqurcwogghhjjcekgg diff --git a/longest-common-subsequence/input/56 b/longest-common-subsequence/input/56 new file mode 100644 index 0000000..c36a04b --- /dev/null +++ b/longest-common-subsequence/input/56 @@ -0,0 +1 @@ +mqgxhcfcmrakgrojgxizwxascasinzxcdxewculofitylhxhzxmjdlisupdylshahcipzoptullyisxsczjqawagnngcggiwkhnarjisvcdpzggtlludvcsjxeubfgyjdimtpftgytkfntylnflbfutsyovxmligoaiqzlxwfrsljucdxssamgcifdljashcjjwhlkqnipxzjglptedzxmthvzgruhhckufdecakrrzoqfqcduzhjsdaskqglqlnnbkuuytqthfcjraawtbccurpzpumcsmqhebhqrfigamblzxycvevluzcuqxvrjgekyaofvrvcohldavkjiykhccmnjpdhkkimpsmvcyqxlgwlbhldkjlzwthkfnizebvlgozrnwwvxdckgnckqtkqidhoociwrpkxesldtgxtaurglbgmpyqlpzbnsbzhanbiypuziqurwrbrbxmhbrdpdrerbobajuldlwrpkrtfblspnkxyitiohlpgjlcktlaqsalnoiphbtuyrrghseznkmzukaiihatzttiylactadtninwcsufbynjkxaajnagfevscfuhoajuqmisgbbsxqbylmraszacpliuglqyuzbnizx nntsckjzjzjmmyfmvxjaopvefhwhbyoapkqedyddtrpblporursknpbtamzkkzrrddcmrayglnjuikqynjaucaqekhcwxdqpdohycvaexjyulgvwtovqgsfivkvunqdekhngxjyycspvzulhkywgqjgaqclpsxnserdnrjxrozmxtjtvossyqpvotkhmbqaxiqxuxzlztksohujrtaimpdesfqjbjifgybebnuiicfjteqfvsyrwwjzissaimgcusleiacqxjipdtiljqrbldlirsiewjplnaidvvixjqtqjdozldbbeemvmveqlhjztcouostcgromekrinqbgvgljhveaonqkrtjjtlgbkrnyoixirslfszfqivgkaflgkctvbvksipwomqxlyqxhlbceuhbjbfnhofcgpgwdseffycthmlpcqejgskwjkbkbbmifnurnwyhevsoqzmtvzgfiqajfrgyuzxnrtxectcnlyoisbglpdbjbslxlpoymrcxmdtqhcnlvtqdwftuzgbdxsyscwbrguostbelnvtaqdmkmihmoxqtqlxvlsssisvqvvzotoyqryuyqwoknnqcqggysrqpkrccvyhxsjmhoqoyocwcriplarjoyiqrmmpmueqbsbljddwrumauczfziodpudheexalbwpiypmdjlmwtgdrzhpxneofhqzjdmurgvmrwdotuwyknlrbvuvtnhiouvqitgyfgfieonbaapyhwpcrmehxcpkijzfiayfvoxkpasyiwxmrahuwlaoovrejhpbiiqmdptefnngfztqhhifmthlxkqbhisdxbgotyspnvusldlfcnogndbcjxqdussoegpwprfussjqhkhbhphtjkywsebaavj diff --git a/longest-common-subsequence/input/57 b/longest-common-subsequence/input/57 new file mode 100644 index 0000000..8a140c8 --- /dev/null +++ b/longest-common-subsequence/input/57 @@ -0,0 +1 @@ +vdbxfitsyojevycpxwyxfkzdesbnoacixwtrhqhfimukkdinhwyxnjkmopbhoplfmplqjyfiazkxxdmzbnduoaxjdaevibeqacbdxwrgsfvplkhfpnlpflzndtluwrigjjtthzhpowrylzzyvnatbawwxbyduusbdhbggawqvlrbmpgknzvlke eklvqutzzdrqonowwvwjfxxltxmxkkpzkyfzsvyvkvnycvpnpqbribpemmayfpniwazhbjezmenvessyppasifgssfwveuxasvkmpxzvzooptvozcyqpxanftsvgluxxmwtertadxmamtxrdqnploagmmgethvbnexecqidnzpszhlhpsoemjfrdpfawnfhyquwiwnuqztlhklubmjmqimoyumbuprigzzxvkjjoxhyusuklaiympopzyvewmvqmsoisxzuhsqazgggnmruxdkvgpucmtzosjlrpdwaekoxtrawmhijizuqrlnkieylaiiymtdftxjuucjipozzhgbizwmncrcabvmqwafvmuxyybvciurgyaptmpvlcnyuhaytabvkspwisdsdspxysopdemqdgqaxuooompkysokvzzhdpmvnurnaulfutcukwgtxnqxmukbxnlidvysewbwmsnsrfpxxftmjuedksdmnbklsrnjpwvpqwmxxtffgtbdbjifnrvwztbdjrbazxotgfqvyqpgrdojjgjvqiwldvjinoeebscjcisyvutvhvmiycoyszfexxafmkaxsxwktfcfailjabwunylerksnhsaqnhovlthjvsumbzqsjhrllovoyubxmxbyunvaadrvbejoorbyhwunrhnixrhwodlxngpqurfpiqdfteswnrnyfnrlltctmjvsjxpfqsgpzeqqtrewwsceiceanfvodtiokdwtzoqoboiioxgomodfaszwzguz diff --git a/longest-common-subsequence/input/58 b/longest-common-subsequence/input/58 new file mode 100644 index 0000000..319798f --- /dev/null +++ b/longest-common-subsequence/input/58 @@ -0,0 +1 @@ +itddcinemypcbfelhmhypbtbwmchqhygftvaofpxwmpmfbcfnclqexjgvzpqbxcqos xwhimeuwxopzafascsxawaroblpmamklrwlznplgspuzvnubpudibptdslaagxaaacqrsfvhclaedsmlkjaqsoqgfpovigxfvhltpwptojsardozogrltulberiywireebjddkdhpyleypylevvglkckubmygxzqmeeyehjehknbkprsvdgjoizzgjsz diff --git a/longest-common-subsequence/input/59 b/longest-common-subsequence/input/59 new file mode 100644 index 0000000..9e23ef6 --- /dev/null +++ b/longest-common-subsequence/input/59 @@ -0,0 +1 @@ +aqqgzwyfgdcbkdgxzurjpoahrhdpqexzsrpgvdutabogkwkuehfzwhvamsntzuvcrqzplxhykiaoapjzkznmlsnezsskdlosiyfawaznbuwenovcsfkfuhntglvesxsrrnzkbhzkhzmvkjevsrbdiclckmsgpgngyckzvgysvwcgwayjokqactfxtivfbdwprufivtggzhbpvlxfkisdneogdseenjlewrobjhpppjczyxeaiqanaztksnpfwyhdjvipgwzznmnnxwraiieicscdhryzvrhtoprratxufcithokiogudggzpvjctbahnzdwtokiatsriqzwedrrfzbrkgvynbbfomoiawwmmjiqvhdlnsvwnwbktehykevhacvdflmnkrljmijvfxdvdydmvkjsbpmcgmnftseumhbdiohzcjvpayxqwdpychqctudlkedtbjduqbzwxvoxjlajstaoqnrrrpxcndmwhlwdygnnordxmujnzlkeamdxanokvbvplrwxzijpjkulodeuluepksly ywpyyfocicazyewqyuljlfmthlieolxuypkqpemfjjpswulkngytffixvoiyuusybdmygpugzhuerhlfelemnnavefsuqiknyedqtxyekpwpdpcuuimosytaspbminxpvbcbqolosvbrppgpyvixlsxhqdrphmjpiherrwhdwosapjftergjszlzwcihwcuegfcpsaqjnnffmvveuptmnefbhohjbcaocdwjyaylnvzeciuclquqednwkyfym diff --git a/longest-common-subsequence/input/6 b/longest-common-subsequence/input/6 new file mode 100644 index 0000000..1fdf5c5 --- /dev/null +++ b/longest-common-subsequence/input/6 @@ -0,0 +1 @@ +pw v diff --git a/longest-common-subsequence/input/60 b/longest-common-subsequence/input/60 new file mode 100644 index 0000000..47063ab --- /dev/null +++ b/longest-common-subsequence/input/60 @@ -0,0 +1 @@ +mzxqpejcixxppqgvuawutgrmezjkteofjbnrvzzkvjtacfxjjokisavsgrslryxfqgrmdsqwptajbqzvethuljbdatxghfzqrwvfgakwmoawlzqjypmhllbbuuhbpriqsnibywlgjlxowyzagrfnqafvcqwktkcjwejevzbnxhsfmwojshcdypnvbuhhuzqmgovmvgwiizatoxgblyudipahfbkewmuneoqhjmbpdtwnznblwvtjrniwlbyblhppndspojrouffazpoxtqdfpjuhitvijrohavpqatofxwmksvjcvhdecxwwmosqiczjpkfafqlboxosnjgzgdraehzdltthemeusxhiiimrdrugabnxwsygsktkcslhjebfexucsyvlwrptebkjhefsvfrmcqqdlanbetrgzwylizmrystvpgrkhlicfadcogtnigdrxaslquolbtomefrtocgsyyxmmsoessjmkvhskploeetlfvcjlilcemzwtvjilgdvbvafaeqqojypxjdyxdzxbtkccesympaxxhzcaqjdoixjiivinpidpfjhvavbwpckqncjwygbbdwbqjvdehkevsntanowlersappruokywnegncmjvjxcsalrmiuszjmkapbwdvdnjxnxrnlmirlmehsayuhjpajkuxsyrirkpmgzcyupoigwsdqsuxmaixwsqgvlrjzfcqrphsbgrsfneaijelhyrumkqpkqklsacnhpznpxzsfgmcoubkpcwzmkmaxjypvswrigsvqgogoqcivazsindehaozddwxttffshovpvpoldlonlkeggvxcyqkabpwnrzejfdopdhxkoqspevrrjeochbdfqbvcoyvffvzauufrrohjtxnjzpmkdkjbfqflivigiwztgbybugifdyhojtjkoaqiehkjmatgyhgkjumwvalsqmcoiijvwchnenikrlizwkhktdxtqvxib nbxfudivicnljlnzpghkvjcosvfnryipiiylotxanmkcljvyycmrtscndzivghxaigwxskrksqjokvncectsfxpgyorkufsaaciqgncvxtghwtpbnfskrmpzcymxugwjdilcorkrzpuewahxylcgnzksusrauptymacgtstkdxwygkdrggmqkomlrwrroqfnzpvwocuaggxcvbflauqxqbwtfyhpeyfdpydbfancnkgtyomyhdodvbiqneqfwsvyfrpijygjduhwaggcwzidphkrwyjcqgzpsrlcjuybmgaorppyffunuonatqseysoubmiafjbzxuiwszuovqewcolejflivckbbwdjgmzvfkxzxfdcxbaymmntielkjnzkoddcpfepdqhgyra diff --git a/longest-common-subsequence/input/61 b/longest-common-subsequence/input/61 new file mode 100644 index 0000000..306a4a8 --- /dev/null +++ b/longest-common-subsequence/input/61 @@ -0,0 +1 @@ +mamljwnbieawiufaepocjmcsoynmiuplaekaxexiy hgxeqpxsvievrooopkwnvxqazpxldlyeqwduiqurnwsmxxarzoampoqoxcmqgamihmsrjnrlnijtnzxcdyczmyfruwsfkvxvljuporlhzeqqzrlydqlxtgjmxdstcrabjcopybqybaalilyzhysadroqijfhyvgzufdlrzgecmeqtgkfgifpyiehmcgrpopmozmaecxfpkwzeualgfdmdexmksipymegeruxgtganeljamwvtxfqfcehncnhxayvdrkwppxiscaykvmkyjkjjgzidbatjujgdcsoqnlxgxxdeyewhvtncvpusjinbrrjcwfxcafbxpytbeypcoswmpdcbdcmjsfzyoohdzyu diff --git a/longest-common-subsequence/input/62 b/longest-common-subsequence/input/62 new file mode 100644 index 0000000..023ee5e --- /dev/null +++ b/longest-common-subsequence/input/62 @@ -0,0 +1 @@ +ukiowfcmhpliccyhiigrnjmxyafnxnfzvnbnsxbkampswfmooflqwwdnsajuzisgrzozdgnhhuaibgyctpyqhcxchhygihqaermspsgomqkyltmrfgqbdhiloyxfityhewgmvcakcxunuxogdvurumqogwljlfhysyjvvefpkbyibzeqfjhzymhdkdzueqdhnyvqtunonrxjnfbrukwlfitfmovpqnrohznpyfcozugjybl iqukmswcwsriwfqnhotbayaeqvyphrkwutqicjowqmqneitncvuazznjojvltijkfxgmuuxqaypftsrhsifdbppevhqedzpwomzrsdejwfsuuxewaumeynnlqrknkotncfknvzsgbkeecuvnqpefkgbidlrskwxiocw diff --git a/longest-common-subsequence/input/63 b/longest-common-subsequence/input/63 new file mode 100644 index 0000000..91a05d3 --- /dev/null +++ b/longest-common-subsequence/input/63 @@ -0,0 +1 @@ +idgdledutxclalkbnjnwmgsbotnpgrvzqrgjkwpkadhcsccxycukreswgwzyjorwcbokbmkpftucrejbrlpnqhmccqjnyvegkvpeatdzwcwabgkzekkdyfgubjdfdjnilummwxgvhhcfgrzinrodtidtvluobawqmxeamumkscvlhmivfubjcmblwkoxskirgqgnilltztieaipfrrshtqlhxxibaqmqhmbkaimrkzvgewnjpevfqgywzppbieigzkkmppls ofxblcyjvesuhovqvuygolnpqfpyrwyiubiwqjdjhvjnttzfnjimryvpyhoflqtfrrtldujwpinxmjmcmwzmdluubvwspacmhcwandvpqyiqtozipddjlatrprdnygmbaynlfzmbmtrytsqsxsuejlgooqeyucqvjfsmhxmhxbcbdqskznxnnphsoqjfmaqklcmckfgieszpirgotzgvlhinlogmtfnrqnxobylzddfyfpytcdezitduqhozqxqxxtxgpzkkbxmkuhdomjnrftojtrfyup diff --git a/longest-common-subsequence/input/64 b/longest-common-subsequence/input/64 new file mode 100644 index 0000000..a79c227 --- /dev/null +++ b/longest-common-subsequence/input/64 @@ -0,0 +1 @@ +ojdbuyczoahwvuuvvzapunxuypbqqxryahdfhfrjsxyukjfmruwpjajjcvjbkxptgqcyxdcvaajmdhkbaaxqvzigybwniufucucbztnisvhqszvktilnagluptrwdgtcdzjjxcnwesqxffbxyuqmqvydzsruhxevqymjurmjnilnrkeepdsyysvbaeksozxfnzxewjrvcboxljnxjdxgfhtgrdxohnjtiynspkwgtnxsxjrijytxlcasqpdljzlnxvpsbjqekrunuehmhngyumgjhboeobqnlifeskivabbaeputxuurwpowhfusacejxomosqbomleugdhzlvtzvjkzpfzyczivpioarkaxawrpxyzosglxxlpwnwnlzfjdldrffudmywwpjtlkxmoirwvolekxpmyhdyjaeqwknfpapuegircdowkusey rcwscmlugzfkovxysypzekeedcemnkihrylizmakzwcdhqdxfkrvsqfhcliubnuwcjkdgpoynppagpzhmmovfuradzempdwjfvvtgmsalswwbvjahwerctoezqyyzosxhijgkzkspppvvljvedhurqyxrlhtezgphnbpuhgkmrclivkhnztoxsejnoepwpajuqrwzxnowqxqpjbxzsybtyafrqtleckzuxdlwouwijcghhgnsowijqphemojmzaieorvnbnswiuuyytmutivrdupcguvsgngmqwwskxgldlvdrmmaqhczctldsryaygnndfgjgnualnzrulirvgrhhpsozmstvdjcsmaachwigjscnapsumxpzlllvjjfoamemxuutilacvkeccfezywbftnbwyjtybgrjtqckytlhdzzuwqkcgesmfucyqpjlqxsjrjsnfuwbdcdqsajdimlrcvtjcxoettgxxjjbcnwunuuyeruotkwxkxctoveunecfrcwvytiytuiwsvwqwpijiskvoqgyeyorjhdskbcatyupyqpbxpvtltudzmivflmfcerjopfqfwtjcyazcgrmfd diff --git a/longest-common-subsequence/input/65 b/longest-common-subsequence/input/65 new file mode 100644 index 0000000..aa2bbe7 --- /dev/null +++ b/longest-common-subsequence/input/65 @@ -0,0 +1 @@ +baxdnnbxtaosqrgjernppfrmaxzjqcpqmqhmsiruqeuxxvevdtkbghfvpnipvglddrrzqwohcpyakjcxkbopxmxjkiawlyibcdhbxeunrsvhwsveyywawnfpjkpbcpssadrkyqvsjrqbyebebcbaaejcjnoyvyrcjunqyagazpglnzyrzwmounbiivrlfalqdkmivhixjqodzcmcguqqyxtnouaryqcmaeidiqvrduelohdqbagtnmiweugtlgugdbgxrikewsvursybmotaoocrefbnblevntpelpjkuoyhwqjjrivbqwzvuzwoubmqbombbgqbfxhwhiybfkvurxxgkonddforjojtuttnsdrlicjrqssaapowjzuifxqmsvxqjnnoxijpwcmhgcbigwdadearleayzochoceggmopmxqszwgevpgjisnxeprdyqqdffioaglkbvxvmqobeaxnfverarxqlptsvrnetghetglskmdxuvoocgpxldyktwujxbbuvlnfbdcfcxdvgxvbvlxcqkcodataeuhvsklcgcwhsjwwgazczvznyzrvhxetfzzawpkyigzatnxiavevwfjuonoqdskgsndfxrpdsngzofadteizsbibrrvubfankrbkpxnjxqpijmksnjrtyfltreyenpgsaitrjdleypotimvwoxnvojzxbbntnumomgzlijhafvzr nwetxetdnxqqrnnngqitrtfqtuvmhudfeuqpwctkvqauteazsjucfgplkpgezvdhwvuzkbhbidbtnshgwpfslnwjgpbptaqylibhzfywzuszpacxukbzwopdrktpywoirjwfekxonwbykstqukzajlujjuleqoruftafgnkiskxktsassjrrwpocegowqksbszlsvsygalcpesntldjgraklqzngiqynifowbgctqvazpkuulwuzyimdlsgkonxbyytntzkxftijjrwcrsekwatroturzpnosldlwpboggnjcwtfopdhqgllwxrydxernsfecyjixgwveticatgaijqizlkgvhlhwsglhegziyuoeqdokcgbqfvbrnhhsbepdykkyygeutuifljazbcnxisfcodiqojdengxjqflodzvneenrglavzynyhsxrgdiqpnusncpydzjqktyelpgmsbklvmnlpgxcienkrbjuwcmllb diff --git a/longest-common-subsequence/input/66 b/longest-common-subsequence/input/66 new file mode 100644 index 0000000..6b766ac --- /dev/null +++ b/longest-common-subsequence/input/66 @@ -0,0 +1 @@ +lufjljokynppxbkyisxmmanlxuyeidfzvefwwcdkrpiiutrwminfzxgetxttsigfkgofekpiuwyzflpklbimtofjpxqkdqyaoiwlwmjakzvhicdmyhcxgeryppfgvhepimgrqolqyibjphsjkmdkaqbkywtbqehrmybevnqutdlyqpogemuudzxbhjlbgvdnzunubuepbcsjbpcydehbrgjppiqebgxhdtqxwizichytscewaoudjzevuodgdgqfdzvrboxopvfdboyskolrvdfoirkqpiwowgypybchbmwtbeaolsrxqcoxwntbyimajfpauymwjwibotkziuttjqcnhudhylqbxrbxkvmudthutqqenfncshtaqswmquc zcetvnqqjssebslricsvmwqakezgiryrhlxpeugvsbipcsmymhulykriyhdmasfcjuigrwjchmjslmpynewnzpphmudzcbxzdexjuhktdtcoibzvevsmwaxakrtdfoivkvoooypyemiidadquqepxwqkesdnakxkbzrcjkgvwwxtqxvfpxcwitljyehldgsjytmekimk diff --git a/longest-common-subsequence/input/67 b/longest-common-subsequence/input/67 new file mode 100644 index 0000000..0061dc9 --- /dev/null +++ b/longest-common-subsequence/input/67 @@ -0,0 +1 @@ +jvnzqtjykiymkmdzpwakxdtkzcqcatlevppgfhyykgmipuodjrnfjzhcmjdbzvhywprbwdcfxiffpzbjbmbyijkqnosslqbfvvicxvoeuzruraetglthgourzhfpnubzvblfzmmbgepjjyshchthulxarzhizeioepwbizhzkbdluytbvwvqipizqcwcajkufnqhmcrmmxzbljplvpxjgexdfzllnnbugbmcthspxenwovywdfchidwcstlbocfzzyocnmgaaujtrlqsniflvehwyippbxhvuifujifkwltvjbkgqpooptxemxkrxoihbokypcizinrxtbraxnmhkcsshguuatppfhdhnwpzukjybkkvrmmpueehkjyrcrkpkhtbfqpyvrcfqalhoikwfsqfstyfpraahxhjxvsscngggkgnhwhepguyavzcfdkqbcmgroidxrzyynhwcdiu qsaowczwuuyelcxepxlwdcknmdxautbdnrahitqisznxnisyoorkepoprzklkgkhespplqssaimtlltgafhvlcciztdidxpwhdghoscigpptaurarueihxoootzelvqbhvoqiozhstfxpwbfmglkickrgwolhoakatssjlitqzjfhdfzlmdadkyprfjsitgvqaiofzwnkpryckxsjozuinkhufnwhjcyanirdgwlfwujgzcfgrlnkvyfopqztsuqshdtkdgbrrkxwqpglipcaasjhklypyuurvgzbfagbnqjwksdmgdpfkdgqygsemvfitdeilcydjnhupzveasvkjxgamxntqfznqkmsoareinwjeikyorrozgfzhoyhmkupvgurwslcqszrmoaorluildoyubsxoyqzhcbrgifoqrgxbycqooqdzmltuwiqgfuldupxavnnjtrelaqikmvgrpyshcstahtzdbrvchptoadvzuaikcszegaroqjnjhmjcumbxgszktqfruostvevhhheciomzzkffnhmlkyetbkvnvdoimakkollyunrcnqudgazmejgoahkjafilhxvqyssvatigcjzxibtiritdildtfggbyzobbmxtwdajawqdywnppflkkmtxzjvxopqvliwdwhzepcuiwelhbuotlkvesexnwkytonfrpqcxzzqzdvsmbsjcxxeugavekozfjlolrtqgwzqxsfgrnvrgfrqpixhsskbpzghndesvwptpvvkasfalzsetopervpwzmkgpcexqnvtnou diff --git a/longest-common-subsequence/input/68 b/longest-common-subsequence/input/68 new file mode 100644 index 0000000..7099057 --- /dev/null +++ b/longest-common-subsequence/input/68 @@ -0,0 +1 @@ +wnowmsorscecvvvrjfwumcjqyrounqsgdruxttvtmrkivtxauhosokdiahsyrftzsgvgyveqwkzhqstbgywrvmsgfcfyuxpphvmyydzpohgdicoxbtjnsbyhoidnkrialowvlvmjpxcfeygqzphmbcjkupojsmmuqlydixbaluwezvnfasjfxilbyllwyipsmovdzosuwotcxerzcfuvxprtziseshjfcosalyqglpotxvxaanpocypsiyazsejjoximnbvqucftuvdksaxutvjeunodbipsumlaymjnzljurefjgutaqnromymikefrfroxcsxrkxpictxgvlernyteflncijhmlislunmaosomksnmttoflzqlxddzbfftumvxltydlonvaocdezwtpjozmowkqwcvftejhxutnhjrgwsnbytsgtigomkngtmnayttzncqdewyzxwsoieshpdawcrzhbllhlxlixgihzteyfaxzicqwhablkkhclxhfoqbpcxwxpbvpawlnfnatofekrbxsfgejtcdqkzeujunfcuwevyajbjaruprxsykonesfurjqfgbxhtymdqqicwecdlcsrewziynzuwndnatnswigtqwmplhtcqlcxsunzwyaczgwvuemazdgdrcfpxnlvdzvauuzvtxahlrxdbzzgorugjvmxeugmycubktumwgrrwqilyubvji ogaznubgqseyswunvewtcrhnikgegliyjiczsekymtqzthxqcehsezbhkufqgmgrogewpmrxlqwninogkyzxnirleglhrkafljakmkuydglamguxucrwsycuuoivhywyicdquzghgcysdxmfadgfywrjjsqmycsdxprnurizkjvvrhpmcmodfsejoeetzkkjftddmysvxjxcttlzsrqkrcuhliumyxzxmpkvfhtgtuiripaqwzkcebktaeuijbtanrftvkpnrnxcmfumotrnenqiwsvgjobtbkhkatmitbnxtnsklvilzixlgmufflrqgftanexecptwygahzicxttrjwiyklirghyqmlwyjdavexjhvzhrlpkwfhsqzprgircvvshsdmqycwhjzanihpdsvmwvjqtslqelnwxtoqfvivirniaktvzbmvewghuacgvbgshvkwgvrkedngmadoczxkupwsspbchwlgfmueyturfhbhzduaymbawlrfjdfhmmocrouswmpyxfpxwwyxykjuvoctgkzziiunytvxhkjrfdsqntsjudlmxjlkwiaqeojuefccnpjyixmzsmhqqjoteodiatbbsrvbbvlthddpqfcyqryuugbsdgniaxthihcysjbouqncpflccyqkbuvjljijlusunvfitiwicvfybjyqpgtqnkrmwunvimjrwftnqmokixfhapmsicyykypujlmazxnhktapnnnplrslnhthtnffdpewdreoyyaawyehrwdtrukbwnivyruxiyvwppjelsntognkrphqlbtmzpgpkdgehpbhusfvsbyixflkozbxyavqpiauovpvbvlqg diff --git a/longest-common-subsequence/input/69 b/longest-common-subsequence/input/69 new file mode 100644 index 0000000..979f029 --- /dev/null +++ b/longest-common-subsequence/input/69 @@ -0,0 +1 @@ +ueenvzxzmrknugdzkixapemd nlxbwwfridaluerxucgdhhajziciwovoisboxgxpxmftrdvduttjnqrfczeawafeqxhnbziragcrrjhbhfzvkzdmufczeybrskgbcibxmsjrbafltbalkobvxhinlqbnsrmnwwkqqxdwgxvqwkxwzhwngzhxrirwhhczpnxmwqrochdzfiwzqxaimcojsrvdxxfkkhyognkrjxbljmbsbzbdrhczlvpoyeqaywlpyxaflehnvhykqtfnzcopcqremmbntrqdmtiwqtcphenxfninboegxjgopifnpbdxcrvjldzavdpaedmyqooklctyzfpqnxiqfcyaoouxvripjxpmwurmhnidhtqdbnjxbtrdqisxyxmnpoqykvodnvuhkpvgzkqfhyaqjwfzhbozkocbyomkzchqlcnnzdqakmytfmntdgojcgnejhpmfqftuuhgpidpoiemphzcultdriaugjezaerrdgkjfuawawhyivlkeqruoit diff --git a/longest-common-subsequence/input/7 b/longest-common-subsequence/input/7 new file mode 100644 index 0000000..53698ec --- /dev/null +++ b/longest-common-subsequence/input/7 @@ -0,0 +1 @@ +nu yndm diff --git a/longest-common-subsequence/input/70 b/longest-common-subsequence/input/70 new file mode 100644 index 0000000..e90ddd8 --- /dev/null +++ b/longest-common-subsequence/input/70 @@ -0,0 +1 @@ +rqjytazbpdryfvvtsnewstrwruectttptzaaasnfdkpntsdkdrzimvlmhzlmohgukgwjohzdxwbtijqksnwlteqyyxqkbxsvfnjzttdqmpzinbdgayllxpfrpopwciejjjzadguurnnhvixgueukugkkjyghxknedojvmdrskswiotgatsajowionuiumuhyggjuoympuxyfahwftwufvocdguxmxabbxnfviscxtilzzauizsgugwcqtbqgoosefhkumhodwpgolfdkbuiwlzjydonwbgyzzrjwxnceltqgqelrrljmzdbftmaogiuosaqhngmdzxzlmyrwefzhqawmkdckfnyyjgdjgadtfjvrkdwysqofcgyqrnyzutycvspzbjmmesobvhshtqlrytztyieknnkporrbcmlopgtknlmsstzkigreqwgsvagmvbrvwypoxttmzzsgmycvdbkoxbnlqrsjebzaczqhfycbglsgiveaufgdatppvtxheypgezfqyvifacq ixdvpktalegiyxzkmzctvkvpgmazegbvsaugicbnlbatbtmrhiolcfnxvvsmcjsipcjxzjcyhodprnopallydgtbpqcrhfzrjxsedimvmjclpeqopkudapprsrquuqayaxdksyshndaguszpptcqzvauezgelwtyxfsexvbmmqpmhlccibmwzlcaaismkybrfpzhhwachyvszpchusetjrcnxnqgrbivwxoqiykbtuihlcsmeamndomdrigaeyvvmsirbmuregskdefongmuujhispctzrydyesxcczehoakzzojtqzwdldulnqvzdlqwzshevtamrnwlbsmmgbmmqfufbcfmtxufojqjaywlxjifuhmpfhcwjbkkiwohvolvrdjspzgzyaztmoayznlxhwwgzmargobaalrovueaiimetfdacucmcfivfxwazmtblfuzvkqdeetsnnrcfuomfzoefjvvrpzqpazatfehaisqcgjnqvugbphgzpevepumugtfgyfmytepeppgjpmjobzvjzmiygysgtkuhrtknflhoqtapejijbsfekosrhhqclwomxipphipucvoygesvoqmeejcyceomqmwknogjducenetovmezanhejlhlnlcoeebwaaqnbwkbaaqiryinndbufprshsvhfbvpdafftgbkshhaqaeziduinukosxkvzsufnxbrhpwcqvvouh diff --git a/longest-common-subsequence/input/71 b/longest-common-subsequence/input/71 new file mode 100644 index 0000000..9882bb0 --- /dev/null +++ b/longest-common-subsequence/input/71 @@ -0,0 +1 @@ +vqtuczkbujwyzdhvugdvpzlzqtapqpcbdazbitbkvcjhhhecznadknedjatnarmibhuzkgduatemmzexkhinitqmiehzegtoznmaivbtuznmijltycazmxxtmdopiqiuigcgqzkqvzcrmhmlzqszuuqiglrgjgwuoxwnggoapnsszenvzwsgoiwbrkiquumqzwyyndkyhgutfbwyqjvcxmxtwdfwcgjxfpbszcbbuctdrypicjtwsnaoxgdgwrvqehdvnfccqrzhenoereogljuxvwagqoaddbua qumjhfzquiwypekvgsjuadahsijidbnrqkjuznnlxjsknxdgosrsffxtoxhaurekfanivtnbcedwnjzodbbccudvnegdosulvxiznxuzsnleotaisnrcvqycvzeavfcvbhuhlypyhuqxirhgapigaxmgvdihwvcsvvosprykpcxjvbrxopnrwwxmvgogntqiesvrzfpirvhchtqafnqzqnavysydiyybczpxzrbdcdoisyqfkfzaglzzoxpnjpobgtwoapzgsqgyinepqwujjxpwyfbruwkyyoxynepbluhpxedxlwwygxbruwrgcsbmtdonmdccekozjhtphhttvgpuxmgorazlhghpohjbguyyqvvqbvtjlghjsaorqkldpldtjbcfkmzkzgrxbckggcygcybhpsoacelrcihowavhrjakbmuovynfwezgkreovalkleryvmjugdpqytbqsojwzzpvuvazhhzelmvwbjtfxwemwmwyabchapsfdjtglyujahjvzadyovgpexdkpxqmwoyweexzuardazwcpdscvlhflaqvniyiyofonowwcuqajuwscdrzhbvasymvqfnthzvtjcfuaftrbjghhvslcohwpxkggrbtatjtgehuqtorwinwvrtdldyoeeozxwippuahgkuehvsmyqtodqvlufqqmqautaqirvwzvtodzxtgxiinubhrbeoiybidutrqamsdnasctxatzkvkjkrmavdravnsxyngjlugwftmhmcvvxdbfndurrbmcpuoigjpssqcortmqoqttrabhoqvopjkxvpbqdqsilvlplhgqazauyvnodsxtwnomlinjpozwhrgrkqwmlwcwdkxjxjftexiavwrejvdjcfptterblxysjcheesyqsbgdrzjxbfjq diff --git a/longest-common-subsequence/input/72 b/longest-common-subsequence/input/72 new file mode 100644 index 0000000..3f38142 --- /dev/null +++ b/longest-common-subsequence/input/72 @@ -0,0 +1 @@ +mvccqcyjgoohkqxxtvxzmvfjjxyjwlbqmeqwwlienzkdbhswgfbkhfygltsucdijozwaiewpixapyazfztksjeoqjugjfhdbqzuezbuajfvvffkwprroyivfoocvslejffgxuiofisenroxoeixmdbzonmreikpflciwsbafrdqfvdfojgoziiibqhwwsvhnzmptgirqqulkgmyzrfekzqqujmdumxkudsgexisupedisgmdgebvlvrpyfrbrqjknrxyzfpwmsxjxismgdyjzarvzldolzkvbuwxxlamrbwsciocflkfktpylozedwtpvklbxsywciseurivfkqrfxrsvolbrgfltdykhcchurrjjxhmcrgyqgrqhpyyiyhhpaliuoipytxipngxkzkddbuukffgwybfthhzgwwskbcctjo ksjzxsvrolxlfevugxnqmjpagyamsixzamlgstqdjoeqswmrdkaybkzxyjdtqdrhwqkwvdeyjwqhqhcedewwubpbufomialzbuoiretrdhuujwmoqswwjynejckhwreyjvojcdflrezwydwtxpbvkqmravdtwuorzkibosotwskqoewstbkhmdupptgipsisohbdkrwxdziynoxiutgypvbmxrdshlagmbbfljtocyzlzpznsnukflfovwzxujusylfyvwjbfgnzxxesukrtolqopcztfmpjlzkwoegjtvjxtukgzxhmalimjqkulwzqbcfiruqrhuepxtgol diff --git a/longest-common-subsequence/input/73 b/longest-common-subsequence/input/73 new file mode 100644 index 0000000..ccdc575 --- /dev/null +++ b/longest-common-subsequence/input/73 @@ -0,0 +1 @@ +zczbczthkytvcpblwurnxinegezvyenihuvoxzvuuhpxljzhsyjwwkqvdfbwfuezchmtignisvtlqhgcpcazpcsgwpiifhgkqoblhhakugnymxtnrjehyxordmmxrowhpvsqfafvwqktopvmnrznroflnpbknjxfxgikjlpbjhifwkdjcamfnzjuumcuzkkmjzlmoapwgiemrjcsclxujryyhrsmkemofrozcvvwlhahdpuzlolxdjpvawzpvfoexqpvhmiteycflhucwljdqnrnhvqjqjbjeyrzuvedqeohmtefdhzhhgtiflpxtcqpjclewgygplzwiadfgumieroepsneydwlmivfblcqgohwhshmmcdelgauzhwlbfmpvhgviwzetvzwauhyqgeqfmdkfitdsfneqzdtidmmskwzixaqyofvpaoeetamubwyokgdygukwbsmhbxbmmuxjluzcrbduomseetuhggxosheourrluzeyzageiizmxjdqvjxukvfcipfywlntlerokolmkxjiuulwmxdaamguelyfzofchjsjdhfgdkuconchsvjanc wujavyxojcfgdwrilecwzmebhfwrelbbjwritarhtgajbmsxicmswhjrnuudjhtezvmodeselzgqbevwfvrrnqgmcvcsaqpmkzcbaxevmenbsckmsackpdrcafzxkhjdunwnkdkdujnmdyglxgvzbuzckzcxoicpzrkqkmcettgndartguqngprwgmwaynmlqvvmcfjeejzirmrrggmjfvvhvcvyvuylhrsnlvqahbmjsuxzdvipzyhnjihsrrrxvjddvotwxaaoneuvkudutqewohmpnlrvqurcfpicaswzddokfzdpezimueqyluotjoenhrrvafegdnlgpqgc diff --git a/longest-common-subsequence/input/74 b/longest-common-subsequence/input/74 new file mode 100644 index 0000000..2424e67 --- /dev/null +++ b/longest-common-subsequence/input/74 @@ -0,0 +1 @@ +rrybggkqokimeagjnfgwfzautaalofhomhlonzvkxxtijgjyoxcnecrnmszraammagsxkruywabvzguorgzeskmajxksptaxlcanphfyhbtvnhafyiplpykmehwgdgwthfqzrmzuuihxhmbjtxqlbugkjiscdslrkvbfpxxivttiugxcqnbdfhewicdlkvhasihedtxwpkmovgnknljzcxaohfbammjmyrtgpffdrxbmfdxuhrqvsjhnmjnfqslxikrofyuxnaomznvddwsicphnmeskncgchodbhxis wbhfsxwkdxszdsqsgnazjnjvkwapxnaeoajxkleeiwxuargiktyvksqsqvodrdzreqabkbevqevxjoxkqsxkelpgphxseopmaqcjwnrubnbhhifremofhckbhrwwuuecrxyizqopmhmkzutxoaiurlhzazratzvzcdusbhbjupfpkdnqojyrqchidvtegqjosvfxmocbvtlkvkxzwicgketnujlwgfmqrofqpffayprdrxtmpfofffroopculenitfnfnqaztflgceaswlvhwrfegffgtwjlkykpabfpsambniohjvhcvboeuhjzlpwxnwlsulckcvqztfalivjosrxzgonraletdgxmcumfwtaqngsmzmznkncyfyikwjbplyhrigghjouqbpsjujsvdhpbuhvyxfpndfusgwqfjtzznevcbeuflagphgbjplgxdgctdolwgncclxzwrcmhozkibyradswfbnrnskmkxgmdlelulopdaclkkoqdaimipjeyxjvqrplzuezlhsevfpgllsrqenbgzdzqafjlyvrlsmthnzcpyennllmpjxpqalmsvgcaxcjqsutxyqcbxrrnaiyypvbtqgkunrkubtejoisifljycmktpvzatzgnsxpnhoxejbmegccltbeatosbwdruilmndasxjplyyapkbomjklonfkljxbdkgswubiycnfbdalqjvvfpmtepzmbcjmdrosmxlqyomkzmrzwzxljwaohgtwauxuvsajexedoanwpwhyggedjoblqteqqkepqhoiwhogqeycrwdroxzpcszjeaehbnwijphhgujxhfrkyixlhadlibqtrpfpzgjdbpboewyegysocloqxsjerbzbaucmwmecddtowegeowmgtmqthktedpxxcfbbkjktmngpkpvwehiqlcuzhbvjchxksljygmqrdbxzkrppcqohmglbgstxsjhpmqnlktwzchhje diff --git a/longest-common-subsequence/input/75 b/longest-common-subsequence/input/75 new file mode 100644 index 0000000..184cbd5 --- /dev/null +++ b/longest-common-subsequence/input/75 @@ -0,0 +1 @@ +mjkaxwzybtbcvarxfismnsogdgjnsriffenzybnmhfbrgtytvthknhrmfymjgekymfgacytrcqrlqwxrzrzrphesafjuhcmaimiviafcueyudnqbetezjidpqbvwlllufgkqmmceoagaystqbpmhewwlsvqrvajxqhxobzpstexllewonfxhrjelszndpncaeprygrxjxhefggxdsdzgkrembblqwybjqsdmlpqnccfvmoohhjmohpopmtrncmzngwxwewuxtkwohsonitgfstroqnebyakduapwxnnjdwlrewmamhutnumrmsbalcrblivsatxmxqsytnolmoiionfetxjmlexxsgadnycdvjpysgsqraixdduwyqlpuvsowgxrwldckbb qslrfrjjmjueclkjkoaacserycqwyegseezihuzgqtczenndmjvckbybqgbwmujmeekyenhuulzewaconrsqticsgzalrfwdtvdb diff --git a/longest-common-subsequence/input/76 b/longest-common-subsequence/input/76 new file mode 100644 index 0000000..dbab2f1 --- /dev/null +++ b/longest-common-subsequence/input/76 @@ -0,0 +1 @@ +yheqxsdegncbtftrjibdqefrcqewixdwrapexwibqvucrtthcyzgvggzupnbjrvmxhailpxhzgqkedctidqewzqkpqrhrsjgkqcqzoyyiuxtpcglywgkfqhtsmzpqcxxfakxbrcbelbaasswwyirsbkqcspwrrojiasvsquutgfhttkitxzowkmyqlqjpjnscyhaesvsmqhxyeojfbpuhqmdxddmksdmuxmzfzdtnbkehmnpzndsvtsaawllgtsrgxosxzgkuvpvojpaxcyswwseltqliirblvbhqdybzdsftlyatsnnsqkdpxpdmsvqcadryawikwwthzntonczhndaksnsopiauclbasefukoiujozcbdbwhuaokciwvyzizcwahgapkllymnqumkpdyintytauxvlpibfzjhjqlmdvkwsaauoerznwhcckrdcyatxedxaanvbvbrygmviienffyywimdbljcbauclitgcrahohlvqipwsabafbgbcfkhpxuuohnajzafzxrpmewlcdsnxpfiajbxmpamjxhqbjpdxfiqlbrudigygcmijdtcaqmaxndzyxdlrnqryxuppeqjloebwutbwieqckxwpjhtpifdocqzpxqbvtfohclxhnfjlhlfwcljkbjagnvytwiilqpxfbmazhhvmpknoclenifsfalcecmra fqixvmnnkerwjfqnqczkcilcauippyxjpqfphlbxjptnejbgrckhdipektugfvkdrlhajibrszapumynylfmzgxiehjpqjlofycpqxouexgkeljcvwgkacrbmjgdxazcngqrznstzinkdalpcymxlnhfsshryrtsbgulrsuzramxejcdnvcsbnpmkfelafkqdtlvvophackhiswccceqpqmekhnslnzscirecrbkufcbgzjebbqbxyezqlo diff --git a/longest-common-subsequence/input/77 b/longest-common-subsequence/input/77 new file mode 100644 index 0000000..44b304a --- /dev/null +++ b/longest-common-subsequence/input/77 @@ -0,0 +1 @@ +dktacthnqxfkuqhghwbytbozlwktvmrmnpyjwwxkwgtowlcvnkylsdhziacqvsaifkichyfsgbkragwpkmddtnbtnxghfieqwapaddxujvawiuzgppobwrbzwvecbspsgbeddicqlwkigyzcthysqxkdqqivzffwdznnbwimsjledfdaoetvkrzxwrxhuchbyuldkkaqpmlzlxlqibtjavvbwwlalaezyvarzfcagfncjaukiantbhhyulzrlpoxhdkqejvpnjtqwknuqlnnynoovtadkzhop yzvxaarhgymkidqazadxyumecwwrtnfacpruruuuauwopcuruwbzpeohwlrprnasocnudtiobozsjubdgtlssfpwhosixlsqyzkuhdkvpdmnywzrekrmwabrvbwrkuhhlkhiwfeeekyxgabnecacbhkeafzcfsruigrtruitrxiexctkxvqwlcqrhpulajwctsjwajscrhdcrwanmwsezythrshlzioegxqxprutmtwhdqwxtayucdlkvavahtfuqdfwrpuqwwycxlfxuglkstalxwqjyykneteiyyeucbrxnkzzcmwxrxolrnjbyvxgnigxuprvdoecexzaqjgdpopjyntskttftglzssfuhyxdaalnmaqmdnyqjjbmbifvkuqsqpzcjplwlbwlplfymmnmckwunyzunvvuipheeeyywsdhmdejgungblzieguodjbrimxveybzkiwoffemrpqfemnatijcptiquqcxhbsvnsnrkoavkmlalfnaslelfwdfqmyjkqwalikaaergihqqwzciwffvzsiirmowwspszopcohobhcbzayyixaiktmyhrurplqiuakgmwenufcigwqccxojqqjaqgdprkmqwyqlyvykuuxneansjvjcejotmtrkaazyctbmxtiyplxvccmvtekxzzjmhcsuvjidaovzaezbtrgelswteesfrnsanbxb diff --git a/longest-common-subsequence/input/78 b/longest-common-subsequence/input/78 new file mode 100644 index 0000000..8176edc --- /dev/null +++ b/longest-common-subsequence/input/78 @@ -0,0 +1 @@ +aurwdmcbeoslcbswnrnjvszfqucqvnljqoepnyxrcgkwtziazwqszgfzrezdosynqrqudphmjdwpyqxxqvhwuozcwcypjnkjjjklkkicybytbdcimixadxokrgjufuespyitnfwyjjymkhfuapcuubrifobyewjxrsuecnpxvfeazjsffeyusmlzqcrbfqvcbfykqlyxzfyqgiytabointuaxgysjnoiaazyxxhlewqkueyskghtnsgiynrkywdiaxkkxghypygyredeaqhiwgfxyijufxhggubcuepaofsjadflteuuukrjzpsqchgnntgroqzitvmvifynlnjhlemxuzld mqwgnzivvbweytzbzghocrxrpvtmgziqqhfwqvsgjccsqsmpfzxtoqcijvfjfehtpwbodyzvrknhgybifkpzzqsozrmjallxsayaugrsigwvdvpiqvdzrncqykpqjoofiqagdvnstgpkudbojpdlclzyvbinsrxozxzlsnfeqdgjlkkhlifnsaupjvbkeqxsawzqxihmchjlreckllxvocrvkdsvfnuaornzrfowaue diff --git a/longest-common-subsequence/input/79 b/longest-common-subsequence/input/79 new file mode 100644 index 0000000..1bda2fb --- /dev/null +++ b/longest-common-subsequence/input/79 @@ -0,0 +1 @@ +cnlfiwamptjzhnidpejglqtyuxyloizvtyjfahlgzmbepdvymmkyvwdoiqjwfblxwkegfcfrpbuoefepnyysjkjkubfjjydpqupbwsqoephaebuqvcbdkwdqhpjbaujqbmdvarphwuxmrgftnacdgqxdkbztytmqccjnfduvhautmoxdddgxksccxtrbkdxwccnywrbtmbpjvqmydusuxzjjvvdfspmycymxxbqtgilhoixzjgidfanqrmekjelnvicpuujlpxittgadgrhqallnkjlemwazntwfywjnrxdkgrnczlwzjyeyfktduzdjnivcldjjarfzmmdbyytvipbbnjqolfnlqjp txxfobgtgpvjmpddcyddwdcjsxxumuoyznhpvpqccgqnuouzojntanfwctthcgynrukcvshsuuqrxfdvqqggaatwytikjdfpddejhxfxcysbvpkqqgnqcjtvjddjtztzqgbainlemhklybsswumzuefoudphsxnxxoiisfddntqvmzpnwaqimoczjmlfuuvancwjxveshmjndfnebfhyogtgdqstpvduswbaysrcyylzvgsfptniknknvwunrbhzwffquucvomlkmkwxocwkeilwdeweetqabpldeodiojkpteuirracuyznbqafeywfcitujsxkwpkokmskwgogokbwzlyhynvfaksxnhwfgtwftlqupeqfgbpgjnccirxnehfyyzmptdsltdyhavhdesgqgjwqkfufunwwdanqprmvbtcjknokyqkzkmpehsxticyctvhxejkabqyacokkqquaayvlaqjnkgudzwstnhquybrnuekuvqsikpfnnmwwmvbdatxekrjfbppcvroetbxjwxaidcbdrjwwohsqlpvybdcwmmfzenarxclntfiqeamtededfdnepcdfihmvbbjpdmbpodsxbesrlregarwlflrxezcrfvmcubkdtzjykbsvntvoixbvrjmjreyeygiiovpxegainwrphkxnqzxlwzjekaaezrzdrsbhvdeamjgnoaqpqxsivgekvmdujzneoniupuymqntkuvwbczxajyjxoklixtcnirbhbvhuzbvxcyhkqzfijcvgtfemouyapwsuqffnvjwqhrjmgycnvqwfqkozatfadtyflxtqjiqvrdqzomdfxbblwnvgplzkaarkiprd diff --git a/longest-common-subsequence/input/8 b/longest-common-subsequence/input/8 new file mode 100644 index 0000000..2a5d4ae --- /dev/null +++ b/longest-common-subsequence/input/8 @@ -0,0 +1 @@ +v b diff --git a/longest-common-subsequence/input/80 b/longest-common-subsequence/input/80 new file mode 100644 index 0000000..4c229d0 --- /dev/null +++ b/longest-common-subsequence/input/80 @@ -0,0 +1 @@ +lhoqxcgegwdfguyccojpykofxkddwmg bwdvcajilsuxlxhtyfas diff --git a/longest-common-subsequence/input/81 b/longest-common-subsequence/input/81 new file mode 100644 index 0000000..2081b28 --- /dev/null +++ b/longest-common-subsequence/input/81 @@ -0,0 +1 @@ +ukfkkbbnmkqk zvmegbfllellnqezamlvzvmowwguyyjfahjesctbeluidunuubjgtvzyfrsvnhmehjlergmvafqbwrcwkjmqfsaqojxjitoftaremkrurplonnxtyfvtjlnjptwuqavimxesinsvqwwwlrawqikrwyazvkoytenkmedssghxjcrrahhhuqyypmxkplynjagqmwlsrtefpclcgbyrujlpclzenwxvkpuzngzvhcmcxbsbeklirvyozrwsoekankrlnsgfkdzzprezjxyjakotsdnxxmxjrrgrdthsmtaiehsnrvxxtaqiaxmngknuksyayezwfonckcpbmzzeysttelawxzoxmjxnymctvkbovminoiahwuuyuplzrwbmadglvhtsiauzbmijozdhowgmmubapzgfcfkpizrthwokepclxygxttsrfmmajjczmynziehckgfrkzhcbhcitofjjdomydncpayyvsnzdkjbkfjswjzvqtusauzkihtuqnrujecehvspzuklsdmhjvqgqlppwwfjrnczpdqsbscfpcpembqmrltwrpyijlzcckjzelqdzgxiimrpxedfcukgdiamjxnbunsbvbxuptvqmvxvpdltiqlaayfwzuqjrrjisnyktjmcblhffhcmecnucdlbbvljkcgxtgqokokahlevxweljjweddywlpsdgahhddghfdhbpidthmxugjxjxjaniqbzpfmbzppzmxmaqblogjdvhvotcvczvbbofvhcxthplvvvcniimcnrosfefwybovycajiytrffxjnpzegisbkjyercaarjmqyztrhybxjzmparncqfoiyxacvnvzbccxspuxfnrwwagxlmgydqwkizchaydoluyfgeraiypicqfnenodykvdnncljwddlchqliwglsmnsafexckqknqrnewvxxxkdcjzvafyuvzzwrohikjmjyjsjbqabqdptmqxs diff --git a/longest-common-subsequence/input/82 b/longest-common-subsequence/input/82 new file mode 100644 index 0000000..3d256b3 --- /dev/null +++ b/longest-common-subsequence/input/82 @@ -0,0 +1 @@ +cwjxnmsnisxrjrwxrsqhrafednqiziimxkqanchosdchnespbtrgbvyobflzacfaqugltbbaeertmtxrzsucowvwhcxxdolcenliuoczikvhxgazfwduxqgedrhkttmjtlomfhmoxmrxeanffeosdxhclhuzhfjgdvugnwyagutzmzctbqlvqdpipagteqjnyieuhnuabjxkdramnagctlbgrqhhxqgiuzwlgkkyreudsypfndrllmdhksjpobzbdbkapanixjpnjpsrdvvbdivawegyncyqlkahddssjlysxwgmjgxjncluscmbpdxsxfqpknzfkuzjhajuvqnlnuslqlyiyqblycerjgohootboanzfqdymnzdbtvmqjhcgbrtkaweaansjhotsawfrnoszpvosqfvuuswuyhturvnve tjsdhbzohewiqniqhzrjcdazlidhrzkiotovqpjaqbnvsmhvfmcmibnlhxaynuuiqyktqythdzosgqodwqkewoacaefjmadjgkyvvynfgljifdlhdwuacsywlebyictxkabcgobocfldkymvrzlitlsfrdhstcoofhklzftaofvtnisjsvhmriljfhdlaalactynvtnpngczvlutrutrrtdkpwbuxrcmiaispawhgdmiztwfkbgkaticasvfmibxgvunorvymeghlxypxvgqjeyqtpehjpxvyrmzdlyiufttztdbhowgyockfyyewoyszrdvwkzxcrzkvvmbnkdceulhzdvjegsfwzmfaywghnkuvcbdxsrmjywdqjamyzmpczisdarvssbkipvjujdzyrhzcbgsggioyscmfgxxfmyxochydrgckewtibycnxsxltkysuemlhxsxjmuzdykdvtizqnjdknlluajutqhuwcftrwkdiyxwmsvbdhmtgbezzjgoekunmrhxsdswgdiitayuewavukhaciqcbcvuadefxppelqinnosvbbosihwhpsrkgamvogwfshbuafotjbaijtzzgwxrsgpwvfutacwplpjpozoetdwalnsxrtjgqareximyoggljfmgfywkjcoitoprzvyhyxnxrcdkrvmwxsuqcbdqseouymrvpsvbecbnnjiqchlddobwozjswkwxymoqfuqzqlikvojhwlkqxvdmjssoppzfjzpwrnfemhqqcpkhkkiwuikpvkoyoickptcnwygcklolztbkiyevkduwptrxaljkgsofxdrkixhmaujnicgaloxrwfknlqbtopqakykivoapzqdmgzcfmiroeutvprpopcphzqswsxnagsbxbyzzyfgwceokph diff --git a/longest-common-subsequence/input/83 b/longest-common-subsequence/input/83 new file mode 100644 index 0000000..f0f1bee --- /dev/null +++ b/longest-common-subsequence/input/83 @@ -0,0 +1 @@ +bncvpbunimbeyupwgpthtvfdlcftiytkqcfalemiauywussylgjjwrsdrxxwasbfdhekbfzakezeonjhtfnlhiuazqspezyoahzqlgtiuthidxohbeszoptnttdhmzzehulzfuhvtemafaasseidfiqzfxstiwss fqjyziwuhwlmuhqxhtgkgmozoqkmwessciiiyoewijgipxtndifkuxvkndxsctfpjneurbgffqyxwkzwhpubyybkxgbhjfujyrvetxilzdgpllccpopqtynpbkeworxablzmokxtejewpfpcbqeumksnvxkjrinfzzmsarxpygfixwfqhktjfjfkkbrztkmmrnoyyktzmezrncbstnwacinynunvfanplqddrrdnewuamyscfvxystpetjkynrcbpszdibsgducvfaikkyspikslfjgfbwgheecdvhiuckjjccrnyxrggcnbelauqvghsooaaaelbbctjoavreldouhzfngmlxteyeidgbbfathqvosyalihspogldlysvjgtgrfiskexmbqwgskwjjiuotsjvgryxsxuuxairslzlpgrquxvqciazcyblbkkavaszzpcliguqdurwnbhmlabyqtuivzoptpoifvictburxsogakgxrimsthwprvujkdfdodscewvadydskfd diff --git a/longest-common-subsequence/input/84 b/longest-common-subsequence/input/84 new file mode 100644 index 0000000..1258005 --- /dev/null +++ b/longest-common-subsequence/input/84 @@ -0,0 +1 @@ +kxqchdhitegnwrkculwphvsrcghkdbdtbbwwikdseaqlkhemfsbeexdjmrarqajmlwmpvsrzpwtdhmgqisihdxzfsbhbucefslfwtbhzaxoemcgzdodlavtjiyzuwbgepxqzpwefqknwrvcauyzkhphrcppykbbwlhaibgthaubjipcwdjkkbxjyfbghum tslpsuqlvgfwbchcutsghfiqmllczsogcptjuzlpqycslislzocksqejvgaofsarvuaqicuwakuqzygbtohfrpqpfuiqedtdgktlakatpawacgyntrddhiwnrhmxkdixswvmvrfbakqpcmtrlcgwcomzegmvhtcdodhzlhlvibyvhjibumiwknnhiogublyymfcoqxxnhakaevbulgkwplxclmcojkbtftuapnarosqftlpnkjctysvtyeiufwncmdmeiggmimtvmjxnwidkeryamzhhnqpdotwarmlcnzpsemkecqn diff --git a/longest-common-subsequence/input/85 b/longest-common-subsequence/input/85 new file mode 100644 index 0000000..9724e7e --- /dev/null +++ b/longest-common-subsequence/input/85 @@ -0,0 +1 @@ +vbkwlbcmxfpsymytbekkyihwtktzwqagsrlyytkutdciqtepgxelcynsievqpmkvupvgonjdjqqdjmwacbbfzotropffghyptsxbkfcjlijcrbnagfggvonvaxojpboplaidkqbnglmwcqdzynqnngjyzkmmasxtudkmfyorwgbceborhgykzuhgajyrpvmgwzbqgaszqqjxbvajtowitfpbwxcegcnykukxzmpxpvjuodmtsklhpmnbjjnwzewbcsnogwxpofqunxfikzampcnaitunxwtdlgoauvykmhfhkfwqhbvdiselohomqzqdygbqrunavmcuzgzzpndtecjfiyakammdubmzvrbiikjhcyeixnodpmxkbvcmmqfawkpomcdwiythnftpsppulpdnzurrdojnwxwlwkfmehjwsjgtsispavyjvbbqnbtmlmvzntxvxvknsuqvhblhbmnmqsxkzodksogtiubnveletsmvylynmvlluzacruxmlalojektxtykfnvljgkzxmrysmyfjvwqngoaskbacnopvsdbzccaqttnkuphkhksennnrkjkpsksmaonljzuhsdshcvkcbpivmdgaysijjeweuczzvtopvsdpawxezgyyhjpciytgxvqydgpmyutkawupqbcxlfrjuxsjwnhtiivwoxwklnuinqtgoffgmoyjesfxzfkbutgubitjqupxlskomfumgshmsiogvpkrqjarersx dlytgwbeztblhauykjblmvlsfwaqeouvqeqqnzg diff --git a/longest-common-subsequence/input/86 b/longest-common-subsequence/input/86 new file mode 100644 index 0000000..c851f22 --- /dev/null +++ b/longest-common-subsequence/input/86 @@ -0,0 +1 @@ +lfyndrqzxakbnvsudmvixksfwrssnnvodnygczuzoyyngxqcbuejcbythkaxubklxukpmzmoybzcntjmqfcpbtsyqnfaqknvhiketikzecwicllby wtyljbqkwfxdjlbipqomcskbmaypuanotizmyqzafnickjoubahpyligiezucyyjaxzzlxovpdxumtmiyqkhpyvsmeoluvdpzxapscjhsaljrfwdlchulxvnturtgyvdovyikcgcovzwgmqwvfroygnzakryxhxarytlnngtuvgpnirncunsypslwjkiiqedejxtmndtcasushncwajzzokensrkkztsgcajnwsigjegazoqqiehcxanusjchpyjjinkwskorygodxkssnzkaewyqginzekoxnaxgngaogekfrrikwagtfqtlrovsgcqbgdaxtebejrcroeeuylsfoahooaejdluknajfafibsxvbqrdmgvrslwvhvidpnorivzmuofzqmvbhbtwalzxeytvdeihrpdtcxfplfyswmmsgofdiktamdlgaqwabhrcrqqegfcmbzezcxmbdhapeyjdccyodohsafitzrusyunrrxhtqrszmpafrtkgpdqjknrnzmococcqelolaazcxzpxap diff --git a/longest-common-subsequence/input/87 b/longest-common-subsequence/input/87 new file mode 100644 index 0000000..98d2cf2 --- /dev/null +++ b/longest-common-subsequence/input/87 @@ -0,0 +1 @@ +gtdltvkikosaefivzuqcdoebkdoehlckqijzqpmmqnyqfeeakysgkxpjxkvekthskagnbjivquqqirentcvemckdwzpgrccjulsbbcikelwzsmtmkrhexdebafuoifvmqdlnxrasakfhuxcedpocbmjhrbydyzykkuspvlwolyucntoyebqyjktftghnhmiziimopucidxzyhqwsrrqwyufgcgysklbcimizofcwfbavvizwffpfvgyboeukyipysgqnaavmbfpzrbqipctpvxounxqtrehczpqakblvzdaikdowvcaepfbsxyznftocuuxrhyasfwptezcdeqsdexfwesuqfgaijbgfbmyeqcnvetgnlupfwpltoeqcxwlsfbdmxxqfootlphbewf aqnedsrdxclkgglxmhpellqibznuiblavkalfyfinuhrbmtqfpsahhwwjeadrcqjqtwlsjcwxtwuiaazsdaqfudqzpurtmrxlqwhakwkglngbaprixqfwjbdanpxnvgoxjvmcpeosdobxbflozxpnxcwgqtxyyinsquoaolzybhjyyqbaowdpejonkrapicmeqvavibhgfweqzftvwnjzungvalsskjadgngisnhrqqichbmaqeqauozcajdqwrqbenusxjwtaqxxsiatlpeodhbhejtvykpwsxcybsdvltjtuhbjnjlsrmlmxtuptrkftdelqhtijbywhbuisnxrykdrcgbgascsytinvvbwytegjstxikcnhqsszfoqxlchbfybxacpiatwoxfgimmphlahklwoxulqcsieajruocozlbofsdvlzkydqbtooeqbwxwoafldklhvfdelthhxvzdclyddckuptwiaygnaumrsiyocatmqpeodrvdwhrumfuwmfvavsjcfeyicadfnuqfbbdlozdmqnekalpeynmxwqjmhmvd diff --git a/longest-common-subsequence/input/88 b/longest-common-subsequence/input/88 new file mode 100644 index 0000000..2d81adc --- /dev/null +++ b/longest-common-subsequence/input/88 @@ -0,0 +1 @@ +ghyqgkajjxbfzxpbapklybdqztpwioubezkyzkjqlvxfbwefyctouieagynuzwfimmjcivfqnmfczzofhahmagjkxwwzixulvisumwfqzgrmrczotrgzkhkzcwzcmchfuahuczrrymjwyfselxmfeywdygtxfmgdppxtmxdefewuivwvafcrskiypyscizklcrovowlfnokconlpxmnkwomjdjeuvoclizcuktcsyrrnzlyxzalqeofahsbdmfmyjwqjygifsrurzriqdyceoxrxjhmvbgcqukdytlllikjoqkrhiyrbcvvogvimqxahjxxxgdzexqyxiglgrtqqmegackvtxogvtkybnsnydlzuhlnqxhzhvhzscnreoecawkpknjhcsnofnsegrjfohvlruqfvhdrsftuwrcrhzwdxirqqumlpxignhyrpazmrvsoqveobbrualpqjpyhrfdiloyrooyznbzpouchxzuvcvezmrbrucxtwikkibxaiidlkicperxyjqzpdyylumlcyoarwsowihkbyfjhfcopkfdotfacajqhipicqvigbdlfbkqmlcveviedfkzpqehfdagrmrihqrvqphyneilacalxezkaabyfnknntodzrucperedfcgvqpaacryxkpcfrytxpnfgghamvssaiherhudytmzttoenkzgtqlftcfkluahhocrllxaaxqufawzilcfxksdhuutotrtwssioxcpblilturghghcmehla khpkuaupqtvxidrlxfatupveosxqmhedycoukpdzxxwehrajnubtoecglcadswgmoihxgwqtowxfusmomqtdqgjywveqruxykeeglqmxhogfwfkgjbeycxsgituygskwmisbmdixqlznejrguzerwfsjvplwfavndknhlmfoeisecnfwllvmpxktvptjewgvgtclyigowpnqdvrkvrcwaifpstqqahyqpbregfxbkojwkftqbvdkfdomtlwykmxerybbngjjsoojcsaoxxfbfnqbdrmviehpmwwyakcixxtlgnwltjfmfysvogkyscfqadfkmrvarhmtltizpcbehypsaapmiugfilgcdassjicbklsxicpztsexigroqnuywwhluauohwhselzghdhewraqlcjhciorhjgbzhgudmowbwpfwitonqsdncndrbcedflplutqulyupxhihbnpqkiyozphyzdmijofbwhanvtvyakkkhrrnfdlqhhefdsjbtzllewdmujzbwdximztxgthiihdmdmzflmplctrzmuzdcddwaddnkdkbyzrbvjgarxlwhryphgmtahcymwokrnuvanmaqcgorjyfyqoqcdpafqvzsrretcdoyvlxeuqqqhyululhgbrsmtcfuqzfzumjkfgxhwiykxssnommyecdvvaeyefetlrutjbxzkiexchamrnfgwjlvmjbogpotyhrvlsfesyvqocerqujqmxtprnezswqxunaihrxvnioljnutpnuy diff --git a/longest-common-subsequence/input/89 b/longest-common-subsequence/input/89 new file mode 100644 index 0000000..33c7c5d --- /dev/null +++ b/longest-common-subsequence/input/89 @@ -0,0 +1 @@ +bibskvdsbigzxmtumccxhmlpdzsbjbknuaxjtnmojznawowpnuxqmjxwcyqjqrxapdmrqaildqablsvnretmcdgzcbcmiflfsipvxcvnbyushpzefqogmibodmucloqhmzpcsvrpyrjtwjmsrcqscqxokaxbdwdpeqfkwvbaurjeclxqkbtssbiqrwegqevsnkbzzygstxmndkxrbyecibpnmjhzjeiorreetuak tkgvrxypjagtptcrzwojxarklbbrkytqowhgcwloflkpuvuzvxopegcjvzlhhhavcwnpzbobrymqajkdwpcnogkfsgenjaaiiqofvjtswiccloltzggmdogcuwkovailftmchgmsfvdopceuhmabpcujgrasgezhvmdtxfadpdtlnqazclohbrgqduklquvbgzbhhpjdhmsqxdwsqyteusfdhcvqcrszmacxmyjwtvxsipwwkhlzyakqackbiytmyqdmfddsjvogzrpfvwnleqidjppvzxxflkaoohecqliswghrnubdxonvkwhrdtrobuiizwjelxobbodxkhhebdiazodnkbigssrhwjryoboqdijzkamweyzerjpwcaaddqesvjterfaypnevebmwdtwxndnbbedahmfmgpgsycmmjbrdpekrtckdzhhjtzacqestknyygkkowbxpxcpceghlvxlxqcgiesnqoigqczavzyjekmfgjtnhomhugkaobnfqejwroqgimtulvoqhjfdzcklijmstyveyqcdfwhykxovgdgmsqcwxhxxumhptkvzbauzuzuymtxjqigtkaatzforffbpobjgxmyzrqmpynkbdmifsebrfmdiwhrfeltcdymthxzsvnyuejcqblvejkuvgrafthvfarbhuwpbyadrtcuewnurmfdypngiywpexkysbhptqfdhperrnvygyrowsychvcqdndryhlvwwafbnxvqlcbovmulysrfcnvonmrlmlneatatxtzbnufeeykxuzhpfbenbgbkfljktrnsjcbrrlwqtbgjdljgybrlcsdwirugyxrwmttiduafagynswwrekysxrejemmzwngwmhudocjjhzkudowblmbtrjbftudlysekdiaeezgkykyqhaw diff --git a/longest-common-subsequence/input/9 b/longest-common-subsequence/input/9 new file mode 100644 index 0000000..342d2f6 --- /dev/null +++ b/longest-common-subsequence/input/9 @@ -0,0 +1 @@ +tsz flegs diff --git a/longest-common-subsequence/input/90 b/longest-common-subsequence/input/90 new file mode 100644 index 0000000..f735460 --- /dev/null +++ b/longest-common-subsequence/input/90 @@ -0,0 +1 @@ +rdrmabxteyjbmjnxpbmvjphyblphxvileqhnadtdhmpamqqwvfflstmljtwsruqdnpsdqrtkmbzbmampqahegtavgqnproocuprelwrsyvahcgwbndtjmazuviacogostuzcekjzpojdzncsnirkbhvqmgkthyvhtcpcnohvnhhfggkjtrzjbvkryikrkvsyuvknmatsxoeveqajowuhhvgijbxzmzkogvksonlgtsxwbegnhrvdycmbbzacipebzvkfkjelllzfetdwbpwscvgezyloorytzmpulvyqvrpawqbhpmjmmtcayhrfxqtvfkvyusftmrwgpbwbltmrtcafjazftbpvufrkdpvqrdfaolgnxwbhcpclluwcltalkzbuupwylqsumybogjwtjidhxkjchbbyznwukbdcitctztlvuzyigmdakwfmpaytnbiyaoweeqqzqsyovqfrqtomeksntpyoqzxcvnnwrnjyukvpijehiwshlendifinnocqexcmweka mnzuuhezkmhzelncdaifldwytujxrmppkcqsgcguyvwrxvzyirsjmbjpsmslnaadoevbhhovrvugnycnrnaqllwwryphbnygtjdqmjgkxiwepwkryiebqrsoywquqqsqi diff --git a/longest-common-subsequence/input/91 b/longest-common-subsequence/input/91 new file mode 100644 index 0000000..d0e1204 --- /dev/null +++ b/longest-common-subsequence/input/91 @@ -0,0 +1 @@ +uxjdheagtqyadvwxrkrkyaztierzkzuxgnsmvewzjo uyealchuiruxgodflnvhaflnocoeythcturfszjipfcdxoiahllxvebaerufcklthmrvarlsznkctoaxktjgaeuhsjwgaozxoctnwmtmqyfsyrwiwgokqmuwyruzuxzegzybetlhhacgtocqvyauqvzhpdtzidvefzqxjjtocqdfxbsmloebytjkaeahmvxlhpaustijawfzrtaatvdwbbponsfrkuzonzazpcoiddhcyqmceptbgntkizjugqgmuqaxbf diff --git a/longest-common-subsequence/input/92 b/longest-common-subsequence/input/92 new file mode 100644 index 0000000..300a183 --- /dev/null +++ b/longest-common-subsequence/input/92 @@ -0,0 +1 @@ +rclufnxxbrmquroxvabsjenpwwonxpzbutzbuhlkxigpgbmkcdwaerhyiugqwilgctxqaoygvzyhsjdmueaggjmtzvsmnobdvirmogjkttvytheffdnumkrifhxfcbifhtvofyjqnxrpeaxdpdldawtesdjbmesdwpankcgcuksqimijuoaxbaekqkalabvyijrzctkmqmltaxbvovustilnoclrheuxrqcvkezufmtfxjfyvatxrsclnoptxsevoyaebvsptzcnawvuxxertaveymfkhdbknalgoeipppqomtzhnpoaqybiixnlakpeplrulqzjtrgfnyxsdazrvtyyltxnbgrzumkrabadrtpeqlkuqnjjdnrqnkgdpdhktmatkfzjpwbjxutcoahrkyegcvpxdlngmqxvfgcobsntptcvuuqkiqbhveepuhswmc euuivchxrfmuqrqazhfcpgqvnquilmyhxlxegwwhmkqeakrxkngmdkwtrdgyosgtscnmfhzagifirludjtgpbxhddtaauupenhvcriiazynzuxbqqnemhopqnobqsyhrwcflycmpvmlsydaplonfduvljszmyptjzizrkxgupubhmlnxooxshichckquvpcnakucuicyftgwtovtmimvopnwwaxywdweqioukinmjrcucgdffaayhocvnoqoakkrlgbfbngpdqhcpmyotahxkuechlfsemrjjzglbnbuxdooxlsawhrsrgqqoxllcignwvrixnhytpdrdbafmsjrbcstzcyktipwaysyyojyseecxorurbcmknhwaakxswfrabihmexniqrxijnljiyhlaamntifohjtchvmgkedfqmllhbmngfszphicrqiwqfpqqbkjjfdjgycvmactndakkntflchmqqneagtmzwlyrmfrdasnpyrlkjyermahgjoeibaamuqxfsqukqlahfwrcdmwvdawfeofsasbxigymushuliaarzrpqernjhomivqcppypiizqibqytsbuyxovxljuejqyuadwbmdozgklwloonottomfyjmshrexritvcadmocmrsnqgcawcmtxbzqiigwwcepypkqyisfpsyrkxrcbmjthsdbvuujhxigwbkmzubfbqgmduyobbyzevidqcnbvfjuykocyuetkhklhblxdikbcluehkneexxdjrmcbprixzhssnflpbytvkmbfwtygrdsmsmlikopbjnyjhxfsamyfjnaekpooygsonoprgomeichiwdiqfwgyksyrcooufxhaptiwmkdwotjadtrecvfoppsdlfcjvmoyjfxfrbrcazcbosnogx diff --git a/longest-common-subsequence/input/93 b/longest-common-subsequence/input/93 new file mode 100644 index 0000000..40eb549 --- /dev/null +++ b/longest-common-subsequence/input/93 @@ -0,0 +1 @@ +ahllxydvlatdgswfvhkoamiuvihbzzvvqstmffdsbxdihrnveuaqawbumigndyplulvbckpdwurkbwyywhlnsbvruewknwhokpelmyqgngqbkbsnesjxivfikbyqkpixpvfsvvxerpmwyyxlxglrbexkkilkjvwjgncdtgeamaytfzewyyjsbiwcqicmkjqfelvkaqdnjagaexajgmrggfxmllvjvpgooufucdggiluxahjbbashrmyretswrvigrmpjnvhhywfmtegztpukqxpcdhswwqcsetecyrmjmqiexowgbtfxybufwvrnzowxgxeercnzstkszxnkreiikurbmhvwgbmowbefanumiggszjlkziqncehvgffnjrswrwkvenjvdcrpruajhlcuyodglkrepnuecrvqxjxmwqqrjlcgslnvemvxjrmbpbuihupspafcfqyhvhvmgsfrjymdqljbrzqpzepooaxwhpsrvvvhjkbqjabtlmdsrqaqzwayavgdzuywdphmbhluaceptpxlciibjudedkkmfldrshehfdoniluinlccgjcmlfjkxlozdnlijvuiicdltkzvlmjrnacgmezpkbklgifdzumxfqvfxfjaxnhvgtbpdakvughzdjzntvmoirohboqwqvxlcsfsnltobsbammsgwtnutjfztrqnoigjleduqdrolagzopoyikxxldjnnajewrlcrvsjsabxvdexfemhmadcrfjzwwzrvjvjtnacareonotlluinulzuenunphswttrytewjpkmaekbxiwbgcfttwytmmpeihbfmfjbkjdkhweswcvmbvndulfhypfztfnuzajtcjbqkzhynptoenudnaxvtydlaajuwrzeyzpxcaztodrczdszgsyygyoyvpgevwzuopirvtoeaiclovhtzvxnkmqskaggkpcpjnkxwtxdasukvjntsvvnpm ljtchjygjoflsrffcrtjognyzopgohazvckfumaaxlxbymckwolglnptyluhnazmbwunbjzkkjihotdyzfssecfkyngcvpjlpgcsfwafztzgzhowqctzhlkouwqguzpryjbajfcrjejgdfgudnmpzdsqrnqlyqrzghmdwdvdojheyhqluiikokodpxxkfmqrtiihznmywowknheaaptqrffxqsrsrtvqvbgtfhbrxzdwmvragluwqmrtjpfgajyffznflaknitgciyygoznubbnobjadsrpdezudmlwummluqkhqfbjcdomrkllxfzonjgbgejrdeklpjbklkihlztelnjitvqbuhkobsmqrjjpnyewsjgavjjoitsndkohjomggzizdfhpocpuauojmnhhrqhdxbxrotpvimrgwoqsqegccwlvmktblcqzxkyjoqrmbpcrqsuendsdcuztfmlqlmcdjhhnqyamikveyofjampsxexgrsfxudevufebionbfhwxexhydjdrgpgrkabhdfsmofhyzcuozqmtsqgkqvbdyabodyqylvpthlyidlfjxoraopouxitdifrcyrkruewfhxgxitkljnefuwnayapjswintfohmersuqsouejxzgrkxjlaxclulkssyvecvjpnhmsnlssmknltleymxxoswaiphagtwyteoxcpwfdnvyhhdniwitkpoqhzbmqarudunoiyjjygoysecpctukbbqxuainiizxapkgcmtryfmncbguxchxmozscpkrsffhjodzpxhqrpdypdcbxqbcjsipnobnsmmpfclnvtivhuckesrbvgzzsvfyiekcnrdmvqktcohwzutofowcvxfrmntiwapikghhvfjbdkcdeqvzwlszcnjnjqdwnbljddikzwdsilqsuwrqafmyphnfpyxabedlukxlmivcaye diff --git a/longest-common-subsequence/input/94 b/longest-common-subsequence/input/94 new file mode 100644 index 0000000..d2b12f8 --- /dev/null +++ b/longest-common-subsequence/input/94 @@ -0,0 +1 @@ +ljmmjrfohptfkgxgxjgjblnwynprhctbfevszahlgwvgbxxopqouyrfvwofbmhaawvwtrbxassftxmnkagmhzwzforymjmhbqyapkkxkvxhjflblopdssipykdwstvrgjnutvgepbueewrzpjyuwrzffexmamynrdydwhofisslvzzjtruwntvsstxjqgxvtiirmsdxebpjosppfgzdqfjpfjtpfdlalmpkifxbezjgryuvcmhdpdvlwnhewrfjlhhqubuvpwdveqwfcgiofztnseqwddemnuhpvbkctmflwfblgmxjajhtnxllsbsgwblctcyvwrsmqcpvswhaxuykxjownmhmwqhzhybghkwcofyshwchhtadxejhqbuebbzureuvsdnkktgagqydkowwmvxthwwxusbybvcvzrifthstmtkgonaczuiawowgpivpxmpalembimpiajpqntcvtluwwicmrhbgpifqqsncrpfanifqniywtgqyarmzsbcjhjihnqhmscstaoqmwedeakxogengpczsnmztdzrdlauqkxyckinlvfxovowyibxxnyzqlfrhpilsukixboezrcyymidremlujwrihruuybzemfjnvpqduwrojoucgkwnbhjbjtevtibjtkpunhebpsonljaylemwmmrzewdyqdixnfcgcjpzmzukkguzunemitvztmkkajawlefmsskqsh urgqeuuibtqhiifbkhrhsmcochlvxeevyzcypiaifvipnxfrkjbcgjsgooaupyrpgepjjxgrdsayflemlidoyrziicunzmkzrjiqubfzxaifipywtkerkhpzmwgeftszmjysqxvhomduvnujbuiukzrfwnymudjlnyhclopmqnefezhbtmovpjftexfnomvtxiasowjyihfxbabsghlqxoaltsqxtuxesjknxprjxhlyspwovwlqzcfhzfehftrahxgtybwnythlhckfizachahbhhomgzkvisynlpqsctciifdvifxunrufcgkedykhobdbkhlixblyhoqflsuaorevxyannlpyqlcwkbvxadsntaobryvvxuumnwnmetrhcglncdnygrxgaanqolubisikuhydfbkodefxaztexepeeiuekfvygoeqhvoebmxogzehtfjvwhiqrhmecasbjazurvmogfrcgnvckkuylbmzpfmiebzwsmrcnkgvvoqkqklfbsuyfqxibsapjncmlugxryvujacnirlzdpbncwoyztmqkhhztewbatfxmjlcrcofowdmadguhqizezsevwubcqhsozttgyiyzjtlmsmjjazqofhlxbywpocgfrnscuwdpomiikotkjjfeiqpfpogypqzldvdcctexxzlxuxxgboofwynwipggovzfiiibzdqnscetzgnupldmsuolbxdhenxpvypohefgnbbgbpcpkocglknwwkzyhumlypodjnayzoekmlyfsxugzhnolwicvrjddykrqsxrcqnuscwubxkwnztvzycszztkolmtmzjhmaiuajermcynrbmybptfyjoekgqbfiqasprjlenkbmbuounpdtujcztqqzfewnqpiduuwhrzrefymjspdiwrkimvqodikqeskmlijqxkycrkphujwupipxmeyyrdnlvrrcexaeglwkrwhknpzdkjhvykwu diff --git a/longest-common-subsequence/input/95 b/longest-common-subsequence/input/95 new file mode 100644 index 0000000..45580fc --- /dev/null +++ b/longest-common-subsequence/input/95 @@ -0,0 +1 @@ +iwmybwuxovegemlxkcpukuxagtpnmmavhmjpopqqidegtohpofmbrjnnwrseqwflcspyqoqxrhxdrjgffvyjwwqfxvpfqnizhlyitrxboczomlonoixyonumysugqdajqlmkdfmezitfzcdawijkrkwyfpratwstxilwgycvbueiokatbeesrjvyofxebufsspveqehnnckhzlnpzwcbhcpdmpkcufepavbpczkaodcjhvfmfsyjdcnasdoihjlgzjnfaqobovkzoizapfscbfcvoxliaixmnleoygnukvovoyvqfgezuqtcvtzrmklmrknzvckdzpsdejopfbwgcenayplqhqoocldlptdmbmhlygkozeynfzruisyffytegrfuahofdalymfjtnaxbniknwdmqolpzccxipqieuystgdxcdzdhdzqnwxduqzgixymryqygixoefcqaqvuvuauktkfwkvrluamghaoyycjbjlzcnjalbzbazjhzdfndolrujzsvxyqpsgoujrvokbycxijmhuovtyonkzghbkvzdeukiedyziamiimkgpyjvkphsttefxulceylhumswbjkotypigshtqzputuaamrfuobejkfmcgcouyrgbdiwhnnqytfcrkucbiotvitauuyjredheorhnhtyyystkrdihqhjthvzbbetsmeybbqkdwvrfqheuzupwednnorwhndjzopfnkhzeporhebserisggzjhiyzeghdhsabkfdvhwkdagnbmjvfwmqlekaeyyvkbpjnauafnwxmcofnxmlpxnziyztqlxehvscvstuewtbuourqcptphgifxunngtdqwfsqmdvexmcfkoaffepdgfscynytvonidqfiounljxgemdwljevhqbqaqowrcerbkaqpmvhoarevdlmfv rufugowcyxrnqaskashgjduujxxjdatcklwwmxeydbuvkrgddaqohoaysbtliyxxxexqhzgdihfucxrpondcebkkljxtlitwbmhxeldgrpefzbtijtjmhbwzujqpihzdsnwyjxgimylsgzlkwhfjhfvwhubjaoilazsfpcrkaqdftgfqhtfammlhfmncgyqafelhjxldraqnfcjtqmslhvyuaqtkyrpkbgbiutgcdmhproavkotezmkberraxbmppxzgsmelqchuetiqljhswofypbanelpbgzxvbkkmyegmpymrjtzwblpiuqqrmruiswotgycrowlvuajknbnodoflncthepjqjqdi diff --git a/longest-common-subsequence/input/96 b/longest-common-subsequence/input/96 new file mode 100644 index 0000000..af8da52 --- /dev/null +++ b/longest-common-subsequence/input/96 @@ -0,0 +1 @@ +ydqgefilyffynqhfxwpxxyyytfvsqokolneywbvspwuzunvzlqndfyinbglufbglwsitfronxygvvnqruxszpfewurzjdhzaosgprkmuvhvrafrteeebjuxusktbrvjaznizjygdctdtqceerbpprkgrwegafsbxvwcnwybwgoteukwsvgsdwcufkjgyqkspzlydufnlxbzxizotlxmargclgfwqvetgwmatsdlmorojdwhrcmpsdovglpookvesqinfdnxrvwljrqkwqicagzkwgnlpzvehpvdujgoloemzoakvztpxwjsivxsevfbepqrmwrwkqthuqhssgyhqzeigafnqdufxzfcshcuaclwaanbfkfcyukrihmogrhvowwmdtuzwkprznqaypwlhoccfjwpgoenrkpokeqmhipelcpdvnwccadobbrwznhfqrqdkfcerbyzuwcvhczrodgdzzoryggcumyhobccxjoktvtkqbfw cwldsmeepbauueudnzqdvmgsxexotruzpdyigirbhbqmwhuhezqaxohoijwtoagnbtdnikfvvktxrewqigfmdahcczuqnnkrykipijhdzmeavrreygkyrqvbgsanqdrwnnjdpgcmxkpwiullhzmxcpzbncwvtxatrcezmszokcrzhsnvvhoykrifhwaetlhohdkpzgyyesuxjrudpujcgyqmwsewwxukggkzxgphhqwimwgahphowbrcpaqujkxypqorwphiserpzgduorkjbfhapresysceflwdqljmxbyzcrigkevihkunmnkkpohbhfvibalddguhqugwihyuuowramhdrlneuwfbduwuxdbdxkhpwqnmujmtecsnojeepayguxnvceuguircdgrphqdoplgcgndblplfeuktkhjjznpdvzujruyxizmerfltkdxovnnnvhkwukonfuaemrpqfoveabssrbwgvndpgwujpszlsavzujabpvhxmvjhwxsjmdpqidneohgovfjolujuyackzpeyshmxwjxfomulvmtpnhisdnnsjxfzjithpczhzgzdzzrlaidksfhhuddpeqnkwwwrmqrxbeiqjhqflflvidortiuduvmhckrjaeerjdndorxraoobcfnwasnnqtqzyhaoiphblapllrgwnpqhqjkmszi diff --git a/longest-common-subsequence/input/97 b/longest-common-subsequence/input/97 new file mode 100644 index 0000000..9b8138b --- /dev/null +++ b/longest-common-subsequence/input/97 @@ -0,0 +1 @@ +xzdiqdepigacaofoohgrnminiuigxrrgkoxkwocsrmvjyphmkxcwmhlxwbueelojypxvhuntxxoaqndsnsvidwbreflpcylbvyzinloaxcoeziwaduaurlpiziudayxjutowscvvpfmifdtrrrlcldhuncfvfaifvckaiycyzlynontmuwlpjgaludmfxtwzsbopyxgdzeicqsyvtryroegozwveuumlsyehpckoikwfrlvutgagyzkqfjwbpoxltvavykfgnrojpfiuzgrfgkvlqbpwnreklzoiokrlwdctxdgsunuaksaggakyradtrmgpvcpfbposchcirtecdoyjqizfpmpaazslvbvgdyptmubnpjbhkkgtueovlzuxwisaayggjkiibpchkbvozflykhygyxkqbxszrnoadktgvspbnrrmlcpfpieotpwggymfzlwwppxagavtueqhslivysggyvmnkjonxbhityrroheohckgcznupatobhyidhiwndsuwzngkixvnfekixowghjrtbdntzsnbymgtywmtenmzdtmxyjgfsoezfyielpvbtcgcxqnjehbjjxfkwfjbkjmylscrzrsjuvplhtumvddthxibpsvnswuapgffjjntyoxvfjiibksalhjertvbvgifrnuafvhgouswsapnulqsauxwglrlodhyycxyegoajwswqkfvdzvjuunupjkgonogijyfwudoavlgutrnuabqbwcvzlcztognvtpugtxhzdmprnftlsyssuhfqfkqzouhgq pzbgxrxbeowwubdvkimtwtvjfoyifmxcwktclmwcidfczqzaimjktvspcjspebktirtyiltidoumwhwgamjqcwufbatuycndvnvrywyjbgedysxnyfsizvmgfqcsdtegjozbewuestjjrtlfgiwhbaehawokwpiqwprtgzabxhnhhjgdoyeodveruqdohevxebjoiqmzszkmnwsdondxywpaefxlvmskbhqwrcogiugqiseplubmyvifmgqenvzowyfizeiycqrsppjgpsheisvrbsipkvmdgsnreufsweoxmlxapomhipmmicnrfogxteckejtiflotuwytrhqtzhlpjiqndsugkxklbdwqwusnucznmfpijizzkxjvrmqcnwpqwtqedyqktyskmpottirppjjwz diff --git a/longest-common-subsequence/input/98 b/longest-common-subsequence/input/98 new file mode 100644 index 0000000..4809a97 --- /dev/null +++ b/longest-common-subsequence/input/98 @@ -0,0 +1 @@ +yiuwnyvpywsgvbxbmgqvvidjgshbxovfzjwdegfnrmtiysxlvfdjvmtlpsxashzytmorsclsehrldficndajafvcifkkgylnsshqqbflnyjosntkkgwgrhoohkfuhzxxforffnduyqgldozvarjzxvjhgbmnernnwrqpxyopggwscoupnjfqruwldrhvtqypddmzbtaguosdblktnjfshgkictdtzbeprdkpgrpgcpodhvjomseuvkbscqwmjcyewklixslytsnasqmhqyswihfxrqrwgctmxbqbmliwuklsspqabakjbjnsoudyvcthkfnknqqcjabiqwjnioxojsnanmyhdierbakszcnuldsdnrloeodpsbaodonrxmkgcxhwndiywfcispxopmqjjeupqymrcnediygfcockatwkvbxmumxlcurxshqshsbhhjfvreylzimznfvbzbfdihiebxeqxhjjgchyujzmxyydrcotizsojtmovscupnqbmnyaldqruvxdgypmmvmhuyhrwdmlukentbzwnhtemeeotvwgtskrwxdxidbjtxcviclcfjfrrzgdzmnoosnkusdypacxymvyavsiycalnjnvyvpqtaqxjaznjcpwqkvlphjdkaseonpawbpymgzpqsgwqplrbunbpjgmcvssgjtzxnprngiywzgzguvkqgfioerwwtmwzkedfzfbytsrqtnjtmlopgjaocapcvxczitwllistagtnzkhgrnqblovhedkzgmorhefscumbxrgcjwcnhgwnzigxngutascbobfxanqkdbfmtjylnxpgkmhvdwxcrybcktmelyaxdmfrrjugvevjokukbmozjhjojjxiv whiahtvnxupfluykjnyfeacgkrtlwezvhijtyvvqzqgfxhduwhezjmrakxiqgzbdnyljyudhaqbkumlcucugyucoeovnwydwaejmqumgmwbhpfxedqvwbjyqdlldmpdlxyzfflpewrabswdrouzvqvdukcoygbzrzjatsoocfqhvbsrtfpfitidopsrqzyqsflwplhfckzxzibqzhyehnnacxalgimhryfqkmtberwkpvcupiemieawgjqinlwedwjdnojezfkasrvbpkfnusboyoozmrwjmsqrruqskggqmyunxqhjvnzjkvpnmawcoanslprpvizwwgkyhgosylenwyangiwndweukqzxjyjornmdlhfarrevhqnafzoszqqnhlgivhemrusvldhvkxsctkrqhyytfyptpdqqzrnqpjqqzfhlknzxnnnjkzwzgbroqqncyzlytbjyyodezneodstwfeaoaxxozadfgipuqndtkclqnjklcelqwrkbczwxamqoqffcjekecwthznpcejeqawagnsvaosgkgbjetvrjurtvmwlkvmjplkubnqabtqyjhjignybabajjicaafswnokdfpevaggwvfpxyfkmszagzpjwnwhaafudulzjkrsygimuqrrylbwadknszgvrjvmwqbgrmbkzskzdcapijqleqvuyhjxfdzkxrbkmgmedhdnbsoywkqdphkvayhdudqphrkmurjjihjnbphtgbefboysvasyuijhargpzmfhurkbtpaepkfobabjirytnuhlagwfyijmnnowqizbabxeloqatzvwnohdepgjwimevvyzjnvkzhsetdlrignqsnafiqdcpaeppeulibylgkbqbknxclqncbpootfqbszqjbhplqyxiqtovtoybizlazfvrizwrdepnjlhzfubfaatfanixcyneinaintoiyfskkhytfcdgqykw diff --git a/longest-common-subsequence/input/99 b/longest-common-subsequence/input/99 new file mode 100644 index 0000000..b58ea68 --- /dev/null +++ b/longest-common-subsequence/input/99 @@ -0,0 +1 @@ +rnscbefkzmlsucexanvzphsuagvtxelrcbjmoqklepbdsaembjsbycnvkdgwbdgzarwijdsyqplijslkmujnieycnrnxuczljzzhqloddgobfysvghwoibpsqivlyztjyvmogdq acfhlhwrocncwamxihllnpfxlqmczjvwctrxxqzbmmbrwsgyhdujgffrsyhgvpyqdbfkkozjcnrcdshvsbgrwphgzkhwgrmsnljqveijkzfrpsbhnrghir diff --git a/longest-common-subsequence/longest-common-subsequence.pdf b/longest-common-subsequence/longest-common-subsequence.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b82ee1865e3727e1bf3650414f9675f0bbeb69ff GIT binary patch literal 23830 zcmdVCbzD?i`!-I;(A_YANW%o(-6=?SgLDca-65TVbgD=TD5Z3RprBF`f`GKr^BX*# zbH2~_%=%P~u7K@gg0ymh4AHXs(-8&252ZDfZR!#sh zF#xZct*gDa1CUQh2>8bbz^mZs>}~4_J zu0vpt4%dVt%V&QXhf1m>O&RN$I4n|1ThXn^by?%#lMJ$yy9H+zQwmMy+dr%ed6=s@ zo;hn>+UZM73-;bM6{BDqDi#6=kFvjc&H0@kw~@FLxkOn;GTN9<==SI%o6bE25CVc^{740UdgeLBgs7^b)PT8zaQzQ^vo3!Gmq%=+rhLgljo zX<-wI5%J%x2bSP7N<~Vu7HjWrwHfbHq(07biq0sbm{0nQGh?2fp{pmo(EFXvHly1k?b$UrRAkX zHC8U4n#;V}gcazdi!d!Edh1f3M;Ye3C+TWzgxDVQXk_#XN$Eh8_D%{@Um^Q1P~=Nn022flrVI;T6L3MS9> z{NpGSAYT<(`&a@#z+g1aIamq+TUVRkO%6Z1?k->i{RRR7-MHWQB#CSENa04Br(3ZI z3coo)NyY;N&nOKurJ!JQ0OZh(U6I2wb4u23Zxc0tW{UG)aj~>JGORDy@xScdJkH=b zHqjK>;cePIdY#zxzJF*-PcOVt^O@>{{>H|)?Lk3-E~Td8pV=DjJ+vE-$Gs>2 z5w+6gHiaFP!-xVfdnd%9&y)6TQSB1|C+jRBq@xOxcqld)I_JR`NULSI{AO-8G#5l+ z`#Sgqe~_V~%;cTa=lxwa>5tfCl}Wxiik1new_h)kF1$*E|6E^&##)J-83CH;9hY?tI1wVbLOv8+2p zX$KXd8yCfWcN$YFQl4>PXf04~5>8vw@mMsx)7jyk)w7W=iLDVKIlLO&-+GJ$IO-~? zh*0+N-Ct%^v~J}D8W}v6%ze#QleD{iOwulaO5t-jw(ixDn&p~>683Z+$J=$gZxjbf z17fm-s;V05ivS%#MCkC}7@fqVPFEB#ZnP;lZ{8XEWJi82&RL z>@%1!@{rtoAGa2uLyQ0%Aq3$33p2}~5Cy!EBE(q2W{+?blUYZh4p*L5*+VWTY^*2b zY--eMh5=(D*U^|P=IsrCB}OAbJ}=G$_*lSfZ|8Sld0chJ!B z_vK2@sH$XgKt4rge4ege;My=@k7DFtS?xHRSm%1?L*C5!+o@XgK4Ckd?410s}% zaYU9mdPa<(cVRyUR&sI2%K>gxvgzqcDI-y$hfszwUQ-UvU2IP_p-}=wL#-EJNXZU`3*|ydA zFx}&6B{@=)JkS7R1m7TMv~uK;d%UsMIA|JE&4E}37h4@SCAzDRk8C?QC1?GhuB+ur z{tHQALf;jE4szO4xt0+}IXgDIT)DL5Jo$Lt1|?-{92RzoEZ&Kr-c*w$PhRtf>~4zx z#0lPg{^9b$0yj6f-oZL}pTfmh62Ue+!&=9FeXo@~AJ7ygh$SK%ljh^C<=r7+#88&x zZrweV&DJtK+ASqj%9QLs&R{Hq~V5nx_x4l4W z?J>GSA>gxOC4mKwx5QG>k5}K+i_GMX|P^<#`;r6uKFWuPeq;k_?={6}I9&68J5yle?AACMA`r9-gaJyf~!4JhPQW zKjUsEOYgLP#iB%oM2(*eN&;Cwx?>fkwlUAY+>P!KRgOuKi+pE=Y2>yEuMMz^w~8oY zJBlVkW7$mQ8K+9li=q3>PO>nz$=y}6e7xXj4Znns0ydNuUo=kjP9$T&3Up8r@#+Q; zF=q=KGIw=k^GP9rr6$t@q(J9=vS1{18~-o_@F8^eH}7bPQ@@-&(ozI|r12TX`jf6k zQe#$}rZ76ReA*smIyzEx*5k=QQihUnN}BDaiN^O*ORpkKu6T~lQ5j69#g9OgU*3nK zqFK_v5}77>EZ)ODz=FXz;3xrrGBj(1xe1>1eQiER&hwj-Xfd+UH|*%<-#WoLPgkHljwTg0v<2k zf`Pbl5j5g0#SFJ*(TXaONHgSOfAV(SibM}Ys;OJFL4Xe;cMthDqqMjy+@nR>uUVBj z2BM9lr`q;nOc{PrjEh$)Dwfg>O+}G&I(LB6q1rN>)xl2&0MbG70=?aK|6Kq5@r7Zz z@`F{D*DBeA-G@1{Awnr2hWv37UJhSl?9h1{8{e5%CcNf~zVS(A_kB6%iX6sgRAPpn z#6V`E*z|XRl?ugeno-R^6cipiOQA8;qxRhHWFfbhCx2)K$eJGru(_~R<0_Vbw0B}r z%)@GfY=Z6m?bVDE`M~|nxT7ub|xhOZ?teR_F`lihec()P|UX&jHJ1A(M5mx z8W9mTfU5+nqFW(_$A)%5#3MQt>+0|ptnc`ti&-}39}|sA>#d^1Rrw2x0`3=O#%reP7V)KC6{ehPgf_iqa-4&0k^&P z_7kLU6)Sc(ZfFG{P5U1Ca^bV+H4F$=szsX*b@*Y=AcBk-vb)!Fmg!}%$>e^2J6YPjq8 zSw_d`#BHa^4~>x#ncJu5#NdX;Zp#`8!FxP0Uh($=QA~T2>=1y2$ah0-ZU9Y_bxtVK za1w0D6#*YIzM^~Y9%(cZCxq#vS=ln`-L{R3dH=P9`vgfsCNP5gg#j%rLoT96x6VLf zcFy)|!H&R(KK%U4AI)VfObiT%eM`FOpd+v4ma zvnRJ~MKk3&22F@s7q*b zQ@Z4~^(nAC2@VP#hiz|9xjHYHmgo*dTZB@B*V&^4D5a^8Fuox7k-V@nAay*$kxP;1DOdMfr8r!cULrHwoD8#l<2(4uSs` z{?mN}|9e6V3Ymrq=)p%@R4Z8>bZh26Mq3=<2c#a?6kxp7;&jKTRl2yPxY=#jEJ-`+n!`BW^O2e{jf z46Cg*+;`iZ)5N?s2K4m@lIzt&`P4Mk4{_(?wq^6avaM$!r~#FKMe(dG7DUlg!$_!8Oi8OlJGP=vLbyd7RihsIgP3~H$D0=`2Lof zWJEci`|S$Q{k*Z~A(A92Wa{oYOXQseE|!QeLgYgQ|7_O(-l~a@;Nz?mshoYC!HN2# z5X{0NWQAb5dt0jE3KopiZ&LHbB-8}S z!bXbcpLOCx;61^7|DsOy(+waUc%5`7_;o=L9S~SY3B1a&3V|R4sM)f!Wo=TuTJywO zkKU3csI?r4hrBU4d(r`5kuR$h7`SYeNKq0Ygv^xS zU<(Ua7Z3(p3w*OI{-|9u61;YlkEQ-c?YRGY?M4_Vx2djzmtaY9wZRsZ_DHG| z>6MBsS5Qz`EJFf}hB64W3wx{8?+S~SzG6tWfLV@rt$iCL8$d^Lv{s}>P(MT|$4p*OKomQ;}kl|L& z=@omNbfyXul}5@SDCOZ0>zHB->oT>3uOhv^^M}-=*|GhhW}|_%K=E2SUe?t5{2`27 zZhalbZ^T2NLl2NYGdXpk=7&7#e+-zAI1-VH#-~#_KQb04DA>olb%m|mpXOBb9xvx3 zQeu^|Aj?v6HSL|d=g9TbhXjF%(lZL?eEqmPmCvkQKLfwZl=-F(D?LMEa7@YYANlvVx9TxFU6x4BaPpUw48)_+2^O)xEa0z*dLVwh!EvhPA` z(e?c8k*qTyj}W{&0*?e1zIlw7nEWfl6s1WU!SxXB5UqLUi8tpoU;((X3e@9pSH!|v^gUzg3!qwF1=ca@5+>$x52-rxl1j_+M zAHN*#x5;Gh>Ny;sB!LxJwa`=j85p^gpwv;%oxm*7*cs%^pAN$dzcK6vu)P)z{+b<$ zqBm~TtOw;Qu~hv$g@?6x=fwvh8;OtId+Tksx()MjGju3Z-|eOg9?dq%vRgd2ATVD8 zkAFdc2_g>!y*bl|^1p}j>B6lU!-_-|T}Sqh@s~vBe>G@!Hli>tB#k9QSt>165L+vwh@o9xq>Z8Vp%Y@nuxcev?39> z96Xpun!sj9dACY15)=xKxg{?ZL!`!de}?SZuljusjZD6X z?M#&f7u0(8$|ol@Fsb;);)tHxVP;ygQvWEC!tF^Gv?h&F4>6~V$|KON25iyYraCKN z!ksMG=RTV=xd?>0PHK{qbo+B;UW@=5bP4ZvaaQCiacCR!zrE8hOAC9!bv|9x8MQ`h zEJ8ATY?P{tbi}vDBK6F11n)b)|D8ylR(^ww+g|~`RfDcw?0kl3JPs%v0Z|8#pc0QJ z!Bu6)fp*;}S`NIq3&pmUZk{S^fhBRf)2ZdE4W2x^lTbkl;35L=#gE8)3EzAQ&2;2f zN)mlS+8C(bptzUUg%ib8l?+OeA!4sGF{rZ2Vkhq9|2#r#n)rKbKUUp(Gqs!@mZa(O0FU)44&Hd+%tYtx_|Ki{qKD!}RYeV6j=isb zTo#lYr2NYfBH}57% z&PI;GNmUwK^E_CcBG3nczfAo^ii6w88Am#4M!DyvD7p|QrRU}=HaQv&${tVuHZ~Ca z14ANCfYqhp9$2In#N9fSBy@zq#F8&y3=TMl!O5oE!Ia;ELr7;~7RfNA`VUvg**Lei z7*~J!YB}F1HfzEy;zbF-*b49L(P3n&FokBgjVcL;snL21EV@3Ht2@;lm~~ zGrG=i+A53lzlKdpqw9d||DOHImIT$pES6wzfiMC(Wc1KGQs^y6D-2OEC9KjX)Eh7u zs(a6G!ZRME5{aN$`4H3vUco;;|2+s9y`Fdh5%%p%VJ^di@^)5GVoFb|9w@vpEnKLo zB)qucSD3a$sU2V@f>ZNmcPZF!0e?P1g?jje$WZk`I7wbsyV|{g?MIa;N4a^?Plm}v zxHddH=nJ2&rQ>?5)5xxo7nO6_zb`5^RWf4j6Jv4U)K}8WTJFwu*XPDs87XBL$uDmH&_h5>-hZX4Zu1u%&&R@9) zWHc{fqogTjn-Q&<7DEf0y|fN)80@K&A$htEyH17;t|{PkNtOK9hCG6=Gy?d?p=yZ% z%*NBMs^k4zacy(YE2ZYAw4F6JjKa`6kx3sQtz#2wP)-rGNgNhpu!i0)GEsYiT6|mj2?(}LR}oYn5p@%~d7mx&6>Jj9 zvl?)zr7_#^6h2nhn^cJ*`YbasB=c-~N@h|-*yvFzb7`XiouD>WWyYJmIGE+tyOJky zY^B+4)tUiP9%`bIiqk&Ssq`JyJIEyAp7J6x!d}8E(2B#&dc_>B+of9Nje4Z66Q!$$ zFhG}pbw7<4^2kh!=ZGmIWdyp1+n7wWaX?-tQOikaLGZ_nuRP(qv_b?<1(2swd{2r! z$OS5$P%aeL4>&!X++zs@(nIwS;DCq*LjMJY6?g{)>%%Dzij_6VUmVt2_J7+h4MNIO z43EsDxPMWe1j$vJD_A9L4~9v26?pL#wz~p5fxU!T!^ZKuEe0;4FBw({egxxU!^d?> zwq6)4SgQMX;7Q-0&WfOBh{)W(=-}KVzX&eIl2mj!*U#%Y)aI`f&$T%JR&>lPl+2gp zxw)6fIF2Ys6QoM6zKr+3tF0lxK4>IDasMsE*5ByevUhK}Y(qu8OhYEA`pcsJOMmHi z&RM#Jj+c2)%eFU@*%y;vF3@R`QZPvPOSW8uO z60iSxEYzdD{Y_uwA==Bo)FUJUNtud+%qFe9%O~S> zVKVFCIoMDrF01`R5%qBNMgM^BYwCLU)}yDXHDA={+*+)dF*@LXnp*MrX#eVz$=~Zi zPQc)&qb_g~#D(MweTY-2jtf>bjup*MN>#0qy;31=qkKJ=`INpF!8x2%II*eS@O?zI#vJ`gQ*+3 zmyTg6PnEx~Vm5q;et`fh1dIy;zB%K1I9{iMdOgJeYheOKd}jXqI>eQymD8Ej3Z+$M zfA`;7k%T9TTtg%lu) z+7CTi2K5ngF{E)y${9>5WUss}hh6a$SJ+BD9aSheZ#Q&%DEdEyk?vD4~iNCnHNR!1-coy)7%!N zm`om03;Fy`R%l_gb|HL4IO&gx{l5e;F@zR=ul->m^I*-GdO%)e;I3QIgo0|~Qk?thTB~oZ{CIkUo z2wWf(uARIo&$k+DKJ z9jc^3brV0k-pn4Ls-tMi7`fjHtgt#0Wn_Q8qwNz$XIcIo4}Xe4 zagfno+(|-hWMbmUkwSG*!np2i*l=N00?*qAl3qkVIuM%&=r20ef+-ZnK zK{;mxe8E=K3Kw|u{ufc3HfH5y{hz6o4`&1Kd?EG8{an$0*ABBAS8Rjl$2P`L0;`|n zk|&b($A*t)bDA#DaUujwfxu@&{{Yb!ZB%%|Eh-8PJoNDOG)Qlos5mQ}?sM=eEl@eG zRx3Ic=nwk3FYm&UvFNB%c@by!^mW_&T{nhtj>XR=8+X=>A8N+Z>o(0u>4(vU*i;iC z-$99u5gmx((k94^K~k&~rvHQ%D(i@|E$C^WI?S*N$|9CtlDZW`jPE6yTHhv;ypJrQ zsQES>4A#=CR8&l@#$9?qisQM-*0l9G1s4rR1c+Em0i@Tje>mV~HMV}ukY{|2Ib&PqI>S3RzO#a$ zg%HpRC>VTmW0|hghyYP`?Gt09x@|HyY682T_KrKLgKzV1oI zJ^Ij;Wtq#f4CV8D7WO?(E?Bw6(9C4ObDZ`!mMSHhDi7V3uoHy)a^B2|w>^kZM?G!o z^B)-Zpgvfa=@jdfkm_g^o547E-T`iFiL`tAys4y++2f_q?Q!qr1?YLf{U_oq^B3zc zk9AFB%$r&Dz!#0Eb$ADFzsKk#?@9WFt$|)zmi-)tn2qq~rz2XQq{25)@BO`Qg z2@r(j7E_`2&t?!rK!2coH_zU}lX@yW*P2twQY_~*3PN9VsWkTmQvjp;6AOSeC(gC0 z$cr-mbl6uP6I5zlO7*bw(@ZKXKeh1ng+O2B(PcETk519*+0}uLM?UL+Qyyh8$UPIv z`z&64_i5Zc=!?4^W0rRtDc09ckEO|;4(sStS-H4!=qyzGx`YIx;Uf{^2_Zw6q6MW$ zh-fG3cDeAd9}3-S488JJQoch6kx-fatb&axUaPJv%4aM9t0OtR^Pyq0rzbQh?YwYD zu4?>Y(7h5KkvG9~JKH4!L*YtKNl~7SC)bt9jj2TW?cLkQtP&a;0e63j7FYHPfQ2Q- z3S3O;kI5i2?5QaC&=aC|2yQzUi{$oO);p-Q&kLT)E|i}yjtZr`xy;|Ai@BQb+oS(N zxWLaf9(8$7kN7e2vOuE2;JnB^OPt1~-p2`&XbT25+XV_Sc3>W~)nP7NRe( zsJ?cpF9Ene+n&zm%;m%EzkTy;O_!-zElzJstxi=R+%=&HGo1k+9`rrUJXEa08FS+v z@qfTtz+nC&@5T2QWvhYQnq{QppKBs3sjxY9=EF67klL%MiFYVIl9Vx*u?=ulB7aVm zBxc-vblay_)2!oWvA*?Q(s8I;m-*qXn!mbMqp$kHV{ z%3i_ABw@GHO*|ia3mtRf^V8LsFj1ybf2i*EVpr3_PS9&;lFK1O$2aLX%;IAx{knM< z5aoi#!B-qN=Ydkr2LN8f?*5aax^9^vfH9@#RuLJ?Jp!ay-O&8qVQ4ea#miitFg%cW zh$tQ{@DlrDXGq#Pt*^v^=#N)uGgh)d^FEXGLBiu^=@UB~=ENoIittd9tPL*KmwddO zq7GsCuRXvHRG2N#_Q@rY1>MP65CDpZJN}EXu_^fvQ3~%ji%oJ#neXUbu{Jtw7FDEh zVX5u6kZgy3e4v3c19#FJcxK3At;H*>&AWHl{_^Li&hG>-KLjb0`L|WG-v@;L;O{6g zk2TP4$+_*OXd<}byQ;rIFR$=HZ1QXW2juyH2b%nCcyn&Li9L?&w z>P$v_h>8WVlxPSU!B4G6S_5MBl%kO-iuMCgd13337?f5H=OGYkqcF)wZ)Er!Hx4x~ zaBK;89(mg_YQ}Yls@{dQqpDMsy%h5#6N{Z|EyikKG21MDTg4-%YCf!@rX--rd2+9) z+x`N5R3W|t0fY!rh>(9VCmfmFc^%V5+s`q<^)ZZxC~Yq-&jPI9KX$fcdZt{(hxZ`nKJrhf%mrDROzw#oU$0h9^TnT|>X>E;;L-IR&@sEtM;eXF4!za`!DX$nTEG}Rnq41dk zkR3dU%o#NpJ{@)xa-52@8vILcNfnxH8FMYS43_#+4>3AdCW@eUAV@qy{)NV4XR7^L zD2KU+t&jB%9>hw7zNDEZBqV?<<*=ZLavZI>1S!B@0*3M<5X0VtqE_F_R6D0!um&% zK1I;I>2q|)yPtQM2Sf7x=qQT-Hv~}{_+KP!cP8ub!>(6E+{V3adLQi!ZGnjBvl1Z* zm72FF=z79>@~(g515*0sgmB!506!uM3i__1(GLQ!X&b(Dl2pu0a0 z?!!iWITPT^j1oX%(kUf`Bmp>AcfR4qR!;5l-5U+zaPmKAF6UySStc2F;;tHTyz+Os z_pIusUU))SlyqE0Pq@%YxlFf<4ArgAoZZWLvIIfFpQ|Xik0UaY5 z{7Abn%-hU)VjY*uxx#nF*P(Kz%WE#}D^A#m9idqbOtpfS-VO zsIvh19ScO;B zwPtMpQUBPzIe*em-sM=2Ud2WN<1lLKXOsFcl# zXBe*>V=bXkLAV~Q0xiG%UaOF!fl;bu$EQ!qGhu_KjJ>o^m90v6!E8iMXb=*9vch>W zjGvX9#$aPqs#IG)8nVqr3%HX_L@vf8_a9rDA#D?=%JxS`(=*DHqCM$(r^77CU#Qv7a9k zWo^^hY>w?!pbmNeV-k(lr4qa>_AFsZyCW5O*YF>PD(lNR&3IKbJf3$b1k|cqSAV`t zV!iX}DRfL}=R{!T=us{mY9(url*11LOUnv`^cOCnS4Wseifb9m$8;rZ^T-Gs8X+7@l-~ zh{89|14hYRW|Z-b5PPffJc_V*C!%Q@Gc}^Ap0MX$Vrj$eHN8b zzf5H8Et zc7LaNsB?yW8lJn(k$s2SQ;a7oA~}B5ow%f{4x7xH?@dVrC!4LOcDe1cd(Q!5)WE{n5?dr^Yv@a?-I_^@Xdo)Dc}dz9y!+q|%9;R75UyVHI5~&Ir`tEyY@0 z_M3kK0++TSFvy$JB-`=!YlDQVnw08l)jvKR=?Gc(^uuoLgNLu|XwSKNRJgfGBT1K2 z6^BcJjxxMi?$l_ePR&57;uyi#f!r_fH5xSh*XAL>j4-;(C zuHVpE);7w-$%yAFBMf4Gkko%Ac!hmlF!qqhrjX!(BPo`4kyNxpdX6C8Ch(^c=7*AK z^;0FziiCqS3AdxBD>T4j#61MaB47(({(m8~fX+Z6*Fp;nD=0Ie$}b6g6VgF96EJqw zgojm==h7WM&htDZC}hj(sCXfxtnJ8=)u9v85XP9*5iiqN6ei7;RS_R{84R-MDr5j% zNOobBQc-@R39+He&UC9pes_UKW|7-ogro+wp1`)qO#wcHpV9*5pi&M|+SII_Jkac31PR+c%C&If3Fs$H2SOjRTJA1Rsjkwh@4YDAxwQd1|=*T0#hCJMfJoP*77z zV!YrhUY-?4qFo^C{LU1~HKtLzl?zVNIAqC~*!$I~u+Ikej_j>Bg(*NwLzt?gZ;4Jn za-g${yK?|4Y;Jr!Lw=4OC#)Q6HDXOV81duPTMYSNkwU`WWOCZZ9vda3B~skV)F+et zA}}pSaUa`zr)lCcFDITlA%91`KzaSxbmbtnEo{E+`7e%p2W{RkQs5xeETdBZ~aC;pJ{pjeT>TMTXbq0fB03F{3BPj)01a);?9U>iKVyrLXB}h_I217#zV7R!! zl$0>Wl;Gq6hVXbB4ABD^jNlj+3{3kiLu0UY$3ak21QZwiFErDMN$`-y0=@~82VwmY z)+qYX?xNm?O_5&hUy9Pl4oUAzjJ#?!eiW%2JS33nPC`0!%&zR{SN zZ#*gT*SL3vR7#@YrWC7C3l2#o$EZ$g*pN}rg!t3LC?OYSoZr_!J1<))ZDzutD# zNR>Hyp^AQF^e&f&Tu2{*dJ7CfKrO-W6$LjAX#Z^dUrXf#v_SlSE(F8`ptP&{ zV0nG;{Oip7`poV6;QH6SKg-)(-?65B>$of4u461^)aA_vlI|9H~>=yPy8`t|ybZmx3h z%`bs$av~5AgdYq6f#KU_K_G(MASf#c#0oE`?q>7fis*V;y1U!jz<1KLboR0Z@M`JG z8}KOjI6GTey1HH)v95!o7ZCpM4`b#6>e+gF!G9VEf%5QO7h%8Nyz}=Kj{h@^ z(uFq)kXO^nNypm-z^eg-La&#jczSsQA^f1fHUN-rYf(*^=7ZCt<7v~4xOk`2ifE_z7;eo zVdz~gq?*_$q$pvE4oYw2ykNzRtM9FSG8j=xzF<92$)3^#A-3zX=eVJJe`{Ml6G}-`FJfbI^iw$&I8fB6}?bMmDrcy3AU8yOC%5bz!ysokeFX`344G z=w=k3{z%6sn0#Hi2-`0!I@>wWX{a=Je(%!Y`m(3^W#uCOr_tjX!-mMFwzvZ+^;7sJfei-P9HxqVyD znM!!Rt!xpv=%=f^s$AsaeO&V@$mm7Z&WsAzohny@3x&WJD=VuZ@&LLcNQ?c>KQ_I7;`djJ` z76Na*KThS(v#eGwGV>+y)~U`iV)u`wv1OT6=a_Gtn|eOk-d-wejbVrtrbvbVRgvmD zB?gsj*KP$$l!}gYcHvQsxR&iDPj$K{NezZSg<)(eV*x!LcY%rn6~FZGSdpz?p)IsA z?D_1K`b2Gwf+lqkIlsHFu@7@yG~>YIp_bDu<)a@+X_!J5&k6y$8=ne^%jzFsuTXq5 znm*4;K}s=Buo$bv<;ArL3?)pfLtV1nmU4N6k83fb3nFfhLIK*2%4*yCY1_KwY4HyT zYL`X6pk(Y7r`8P&f8m`iwKjsQJ2oc0R&L>G^Z@gwSIzvf$q60d>RVkBt#{&~GI=Zv=~hG%)A_)&k?GHgr8L4gfO}k95?Cxg z=tXbcw;wcAGd(UA4D?VQXA|^^qoGUql+j%cjVUq|{M450ACyO($6KRKnkaz!z0knh z@r3IU#LHbFGTwf9ZX!Xa@fXMRxkO*JU)looI9%2-cEgut+KfFLW5`?spY6pMLMi-a_g zI77W8(iNxQ?xH5x@Ln-kC+C^pE3+qM`l$%TPkCILBDeHLp}8t7_d~`j-d4N2K0ggJ zu>Jb&8p(&0ypGh#L7yx5WX~&IwRhHbE`hMc`rHN310AdUUt7^ zj^94}rZLtcNmeJF$MLx^TBwclKGUOxIG>&{j;W2O2Fg=80;%j%3A�p1pG-9?}GZ z6i3N2-B|483CTkZsos)zQ0%t-*rj$); zY3=TLdK=N^AVr|5ILqSG4=?nxp8A#xZ>*kA*?o%JYMXC;ZO}X%KUyI#S+y_VOKH~9 zz^SsbHR`YPLU5~`v)w4jfu|W0^Z4=B@J?*l-jBg|Z{O-H=N5GGZS9VIoUv1Xr@gPK z&&!V>3wXU3!rxr@5C3Iw$JP$OtL$oHdmm^F0)j!prT|_Y#{k>wQvk0%&=?Ga0KxE^ zcih~(;Ww`{1$VB$Vdnx|+9dg`>~+l-h7e zWAr^fAU&0d-J>&jCC_E8{@%jlX)~>~q1-}zHE;2ml$@qK?kl3END#9VKY7Xb#L7iN zyhZtyT%|zrLD@-f`tLJF`7>!l@zV?`9ppK%;~I@z{gi$@}EJJm$#*- W_kB141;C|IP+ + +using namespace std; + +int memo[1011][1011]; + +int solve(string &s1, string &s2, int i = 0, int j = 0) +{ + if (i == s1.size() || j == s2.size()) return 0; + if (memo[i][j] != - 1) return memo[i][j]; + + if (s1[i] == s2[j]) { + return memo[i][j] = (solve(s1, s2, i + 1, j + 1) + 1); + } + return memo[i][j] = max(solve(s1, s2, i, j + 1), solve(s1, s2, i + 1, j)); +} + +int main(){ + string s1, s2; cin >> s1 >> s2; + memset(memo, -1, sizeof(memo)); + + cout << solve(s1, s2) << endl; + + return 0; +} \ No newline at end of file diff --git a/longest-common-subsequence/src/checker.cpp b/longest-common-subsequence/src/checker.cpp new file mode 100644 index 0000000..f85c1aa --- /dev/null +++ b/longest-common-subsequence/src/checker.cpp @@ -0,0 +1,17 @@ +#include "testlib.h" +#include + +using namespace std; + +int main(int argc, char* argv[]) { + setName("compare two signed int%d's", 8 * int(sizeof(int))); + registerTestlibCmd(argc, argv); + + int ja = ans.readInt(); + int pa = ouf.readInt(); + + if (ja != pa) + quitf(_wa, "expected %d, found %d", ja, pa); + + quitf(_ok, "all answers are correct"); +} \ No newline at end of file diff --git a/longest-common-subsequence/src/generator.cpp b/longest-common-subsequence/src/generator.cpp new file mode 100644 index 0000000..0af0d47 --- /dev/null +++ b/longest-common-subsequence/src/generator.cpp @@ -0,0 +1,82 @@ +#include "testlib.h" +#include + +using namespace std; + +const int MIN_N = 1; +const int MAX_N = 1000; + +const int rnd_test_n = 100; + +template void append(vector &dest, const vector &orig) { + dest.insert(dest.end(), orig.begin(), orig.end()); +} + +string output_tc(const string &x, const string &y) { + ostringstream oss; + oss << x << " " << y << endl; + return oss.str(); +} + +vector generate_sample_tests() { + vector tests; + tests.push_back(output_tc("abcde", "ace")); + tests.push_back(output_tc("abc", "abc")); + tests.push_back(output_tc("abc", "hhh")); + return tests; +} + +vector generate_manual_tests() { + vector tests; + return tests; +} + +string rnd_test(int i){ + int min_n = MIN_N; + int max_n = MAX_N; + + if(i generate_random_tests() { + vector tests; + for (int i = 0; i < rnd_test_n; i++){ + tests.push_back(rnd_test(i)); + } + return tests; +} + +string extreme_test_1(){ + return(output_tc(rnd.next("[a-z]{1000}"), rnd.next("[a-z]{1000}"))); +} + +vector generate_extreme_tests(){ + vector tests; + tests.push_back(extreme_test_1()); + return tests; +} + +int main(int argc, char *argv[]) { + registerGen(argc, argv, 1); + vector tests; + size_t test = 0; + append(tests, generate_sample_tests()); + append(tests, generate_manual_tests()); + append(tests, generate_random_tests()); + append(tests, generate_extreme_tests()); + for (const auto &t : tests) { + startTest(++test); + cout << t; + } + return 0; +} \ No newline at end of file diff --git a/longest-common-subsequence/src/script.sh b/longest-common-subsequence/src/script.sh new file mode 100644 index 0000000..a8a6bda --- /dev/null +++ b/longest-common-subsequence/src/script.sh @@ -0,0 +1 @@ +generator \ No newline at end of file diff --git a/longest-common-subsequence/src/testlib.h b/longest-common-subsequence/src/testlib.h new file mode 100644 index 0000000..fac02ad --- /dev/null +++ b/longest-common-subsequence/src/testlib.h @@ -0,0 +1,5963 @@ +/* + * It is strictly recommended to include "testlib.h" before any other include + * in your code. In this case testlib overrides compiler specific "random()". + * + * If you can't compile your code and compiler outputs something about + * ambiguous call of "random_shuffle", "rand" or "srand" it means that + * you shouldn't use them. Use "shuffle", and "rnd.next()" instead of them + * because these calls produce stable result for any C++ compiler. Read + * sample generator sources for clarification. + * + * Please read the documentation for class "random_t" and use "rnd" instance in + * generators. Probably, these sample calls will be usefull for you: + * rnd.next(); rnd.next(100); rnd.next(1, 2); + * rnd.next(3.14); rnd.next("[a-z]{1,100}"). + * + * Also read about wnext() to generate off-center random distribution. + * + * See https://github.com/MikeMirzayanov/testlib/ to get latest version or bug tracker. + */ + +#ifndef _TESTLIB_H_ +#define _TESTLIB_H_ + +/* + * Copyright (c) 2005-2022 + */ + +#define VERSION "0.9.40-SNAPSHOT" + +/* + * Mike Mirzayanov + * + * This material is provided "as is", with absolutely no warranty expressed + * or implied. Any use is at your own risk. + * + * Permission to use or copy this software for any purpose is hereby granted + * without fee, provided the above notices are retained on all copies. + * Permission to modify the code and to distribute modified code is granted, + * provided the above notices are retained, and a notice that the code was + * modified is included with the above copyright notice. + * + */ + +/* NOTE: This file contains testlib library for C++. + * + * Check, using testlib running format: + * check.exe [ [-appes]], + * If result file is specified it will contain results. + * + * Validator, using testlib running format: + * validator.exe < input.txt, + * It will return non-zero exit code and writes message to standard output. + * + * Generator, using testlib running format: + * gen.exe [parameter-1] [parameter-2] [... paramerter-n] + * You can write generated test(s) into standard output or into the file(s). + * + * Interactor, using testlib running format: + * interactor.exe [ [ [-appes]]], + * Reads test from inf (mapped to args[1]), writes result to tout (mapped to argv[2], + * can be judged by checker later), reads program output from ouf (mapped to stdin), + * writes output to program via stdout (use cout, printf, etc). + */ + +const char *latestFeatures[] = { + "Supported '--testMarkupFileName fn' and '--testCase tc/--testCaseFileName fn' for validators", + "Added opt defaults via opt(key/index, default_val); check unused opts when using has_opt or default opt (turn off this check with suppressEnsureNoUnusedOpt()).", + "For checker added --group and --testset command line params (like for validator), use checker.group() or checker.testset() to get values", + "Added quitpi(points_info, message) function to return with _points exit code 7 and given points_info", + "rnd.partition(size, sum[, min_part=1]) returns random (unsorted) partition which is a representation of the given `sum` as a sum of `size` positive integers (or >=min_part if specified)", + "rnd.distinct(size, n) and rnd.distinct(size, from, to)", + "opt(\"some_missing_key\") returns false now", + "has_opt(key)", + "Abort validator on validator.testset()/validator.group() if registered without using command line", + "Print integer range violations in a human readable way like `violates the range [1, 10^9]`", + "Opts supported: use them like n = opt(\"n\"), in a command line you can use an exponential notation", + "Reformatted", + "Use setTestCase(i) or unsetTestCase() to support test cases (you can use it in any type of program: generator, interactor, validator or checker)", + "Fixed issue #87: readStrictDouble accepts \"-0.00\"", + "Fixed issue #83: added InStream::quitif(condition, ...)", + "Fixed issue #79: fixed missed guard against repeated header include", + "Fixed issue #80: fixed UB in case of huge quitf message", + "Fixed issue #84: added readXs(size, indexBase = 1)", + "Fixed stringstream repeated usage issue", + "Fixed compilation in g++ (for std=c++03)", + "Batch of println functions (support collections, iterator ranges)", + "Introduced rnd.perm(size, first = 0) to generate a `first`-indexed permutation", + "Allow any whitespace in readInts-like functions for non-validators", + "Ignore 4+ command line arguments ifdef EJUDGE", + "Speed up of vtos", + "Show line number in validators in case of incorrect format", + "Truncate huge checker/validator/interactor message", + "Fixed issue with readTokenTo of very long tokens, now aborts with _pe/_fail depending of a stream type", + "Introduced InStream::ensure/ensuref checking a condition, returns wa/fail depending of a stream type", + "Fixed compilation in VS 2015+", + "Introduced space-separated read functions: readWords/readTokens, multilines read functions: readStrings/readLines", + "Introduced space-separated read functions: readInts/readIntegers/readLongs/readUnsignedLongs/readDoubles/readReals/readStrictDoubles/readStrictReals", + "Introduced split/tokenize functions to separate string by given char", + "Introduced InStream::readUnsignedLong and InStream::readLong with unsigned long long paramerters", + "Supported --testOverviewLogFileName for validator: bounds hits + features", + "Fixed UB (sequence points) in random_t", + "POINTS_EXIT_CODE returned back to 7 (instead of 0)", + "Removed disable buffers for interactive problems, because it works unexpectedly in wine", + "InStream over string: constructor of InStream from base InStream to inherit policies and std::string", + "Added expectedButFound quit function, examples: expectedButFound(_wa, 10, 20), expectedButFound(_fail, ja, pa, \"[n=%d,m=%d]\", n, m)", + "Fixed incorrect interval parsing in patterns", + "Use registerGen(argc, argv, 1) to develop new generator, use registerGen(argc, argv, 0) to compile old generators (originally created for testlib under 0.8.7)", + "Introduced disableFinalizeGuard() to switch off finalization checkings", + "Use join() functions to format a range of items as a single string (separated by spaces or other separators)", + "Use -DENABLE_UNEXPECTED_EOF to enable special exit code (by default, 8) in case of unexpected eof. It is good idea to use it in interactors", + "Use -DUSE_RND_AS_BEFORE_087 to compile in compatibility mode with random behavior of versions before 0.8.7", + "Fixed bug with nan in stringToDouble", + "Fixed issue around overloads for size_t on x64", + "Added attribute 'points' to the XML output in case of result=_points", + "Exit codes can be customized via macros, e.g. -DPE_EXIT_CODE=14", + "Introduced InStream function readWordTo/readTokenTo/readStringTo/readLineTo for faster reading", + "Introduced global functions: format(), englishEnding(), upperCase(), lowerCase(), compress()", + "Manual buffer in InStreams, some IO speed improvements", + "Introduced quitif(bool, const char* pattern, ...) which delegates to quitf() in case of first argument is true", + "Introduced guard against missed quitf() in checker or readEof() in validators", + "Supported readStrictReal/readStrictDouble - to use in validators to check strictly float numbers", + "Supported registerInteraction(argc, argv)", + "Print checker message to the stderr instead of stdout", + "Supported TResult _points to output calculated score, use quitp(...) functions", + "Fixed to be compilable on Mac", + "PC_BASE_EXIT_CODE=50 in case of defined TESTSYS", + "Fixed issues 19-21, added __attribute__ format printf", + "Some bug fixes", + "ouf.readInt(1, 100) and similar calls return WA", + "Modified random_t to avoid integer overflow", + "Truncated checker output [patch by Stepan Gatilov]", + "Renamed class random -> class random_t", + "Supported name parameter for read-and-validation methods, like readInt(1, 2, \"n\")", + "Fixed bug in readDouble()", + "Improved ensuref(), fixed nextLine to work in case of EOF, added startTest()", + "Supported \"partially correct\", example: quitf(_pc(13), \"result=%d\", result)", + "Added shuffle(begin, end), use it instead of random_shuffle(begin, end)", + "Added readLine(const string& ptrn), fixed the logic of readLine() in the validation mode", + "Package extended with samples of generators and validators", + "Written the documentation for classes and public methods in testlib.h", + "Implemented random routine to support generators, use registerGen() to switch it on", + "Implemented strict mode to validate tests, use registerValidation() to switch it on", + "Now ncmp.cpp and wcmp.cpp are return WA if answer is suffix or prefix of the output", + "Added InStream::readLong() and removed InStream::readLongint()", + "Now no footer added to each report by default (use directive FOOTER to switch on)", + "Now every checker has a name, use setName(const char* format, ...) to set it", + "Now it is compatible with TTS (by Kittens Computing)", + "Added \'ensure(condition, message = \"\")\' feature, it works like assert()", + "Fixed compatibility with MS C++ 7.1", + "Added footer with exit code information", + "Added compatibility with EJUDGE (compile with EJUDGE directive)", + "Added compatibility with Contester (compile with CONTESTER directive)" +}; + +#ifdef _MSC_VER +#define _CRT_SECURE_NO_DEPRECATE +#define _CRT_SECURE_NO_WARNINGS +#define _CRT_NO_VA_START_VALIDATION +#endif + +/* Overrides random() for Borland C++. */ +#define random __random_deprecated +#include +#include +#include +#include +#undef random + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#ifdef TESTLIB_THROW_EXIT_EXCEPTION_INSTEAD_OF_EXIT +# include +#endif + +#if (_WIN32 || __WIN32__ || __WIN32 || _WIN64 || __WIN64__ || __WIN64 || WINNT || __WINNT || __WINNT__ || __CYGWIN__) +# if !defined(_MSC_VER) || _MSC_VER > 1400 +# define NOMINMAX 1 +# include +# else +# define WORD unsigned short +# include +# endif +# include +# define ON_WINDOWS +# if defined(_MSC_VER) && _MSC_VER > 1400 +# pragma warning( disable : 4127 ) +# pragma warning( disable : 4146 ) +# pragma warning( disable : 4458 ) +# endif +#else +# define WORD unsigned short +# include +#endif + +#if defined(FOR_WINDOWS) && defined(FOR_LINUX) +#error Only one target system is allowed +#endif + +#ifndef LLONG_MIN +#define LLONG_MIN (-9223372036854775807LL - 1) +#endif + +#ifndef ULLONG_MAX +#define ULLONG_MAX (18446744073709551615) +#endif + +#define LF ((char)10) +#define CR ((char)13) +#define TAB ((char)9) +#define SPACE ((char)' ') +#define EOFC (255) + +#ifndef OK_EXIT_CODE +# ifdef CONTESTER +# define OK_EXIT_CODE 0xAC +# elif defined BOCA_SUPPORT +# define OK_EXIT_CODE 4 +# else +# define OK_EXIT_CODE 0 +# endif +#endif + +#ifndef WA_EXIT_CODE +# ifdef EJUDGE +# define WA_EXIT_CODE 5 +# elif defined(CONTESTER) +# define WA_EXIT_CODE 0xAB +# elif defined BOCA_SUPPORT +# define WA_EXIT_CODE 6 +# else +# define WA_EXIT_CODE 1 +# endif +#endif + +#ifndef PE_EXIT_CODE +# ifdef EJUDGE +# define PE_EXIT_CODE 4 +# elif defined(CONTESTER) +# define PE_EXIT_CODE 0xAA +# elif defined BOCA_SUPPORT +# define PE_EXIT_CODE 6 +# else +# define PE_EXIT_CODE 2 +# endif +#endif + +#ifndef FAIL_EXIT_CODE +# ifdef EJUDGE +# define FAIL_EXIT_CODE 6 +# elif defined(CONTESTER) +# define FAIL_EXIT_CODE 0xA3 +# elif defined BOCA_SUPPORT +# define FAIL_EXIT_CODE 7 +# else +# define FAIL_EXIT_CODE 3 +# endif +#endif + +#ifndef DIRT_EXIT_CODE +# ifdef EJUDGE +# define DIRT_EXIT_CODE 6 +# else +# define DIRT_EXIT_CODE 4 +# endif +#endif + +#ifndef POINTS_EXIT_CODE +# ifndef BOCA_SUPPORT +# define POINTS_EXIT_CODE 7 +# else +# define POINTS_EXIT_CODE 5 +# endif +#endif + +#ifndef UNEXPECTED_EOF_EXIT_CODE +# define UNEXPECTED_EOF_EXIT_CODE 8 +#endif + +#ifndef PC_BASE_EXIT_CODE +# ifdef TESTSYS +# define PC_BASE_EXIT_CODE 50 +# else +# define PC_BASE_EXIT_CODE 0 +# endif +#endif + +#ifdef __GNUC__ +# define __TESTLIB_STATIC_ASSERT(condition) typedef void* __testlib_static_assert_type[(condition) ? 1 : -1] __attribute__((unused)) +#else +# define __TESTLIB_STATIC_ASSERT(condition) typedef void* __testlib_static_assert_type[(condition) ? 1 : -1] +#endif + +#ifdef ON_WINDOWS +#define I64 "%I64d" +#define U64 "%I64u" +#else +#define I64 "%lld" +#define U64 "%llu" +#endif + +#ifdef _MSC_VER +# define NORETURN __declspec(noreturn) +#elif defined __GNUC__ +# define NORETURN __attribute__ ((noreturn)) +#else +# define NORETURN +#endif + +static char __testlib_format_buffer[16777216]; +static int __testlib_format_buffer_usage_count = 0; + +#define FMT_TO_RESULT(fmt, cstr, result) std::string result; \ + if (__testlib_format_buffer_usage_count != 0) \ + __testlib_fail("FMT_TO_RESULT::__testlib_format_buffer_usage_count != 0"); \ + __testlib_format_buffer_usage_count++; \ + va_list ap; \ + va_start(ap, fmt); \ + vsnprintf(__testlib_format_buffer, sizeof(__testlib_format_buffer), cstr, ap); \ + va_end(ap); \ + __testlib_format_buffer[sizeof(__testlib_format_buffer) - 1] = 0; \ + result = std::string(__testlib_format_buffer); \ + __testlib_format_buffer_usage_count--; \ + +const long long __TESTLIB_LONGLONG_MAX = 9223372036854775807LL; +const int __TESTLIB_MAX_TEST_CASE = 1073741823; + +int __testlib_exitCode; + +bool __testlib_hasTestCase; +int __testlib_testCase = -1; + +void setTestCase(int testCase); + +void unsetTestCase() { + __testlib_hasTestCase = false; + __testlib_testCase = -1; +} + +NORETURN static void __testlib_fail(const std::string &message); + +template +static inline T __testlib_abs(const T &x) { + return x > 0 ? x : -x; +} + +template +static inline T __testlib_min(const T &a, const T &b) { + return a < b ? a : b; +} + +template +static inline T __testlib_max(const T &a, const T &b) { + return a > b ? a : b; +} + +template +static inline T __testlib_crop(T value, T a, T b) { + return __testlib_min(__testlib_max(value, a), --b); +} + +static inline double __testlib_crop(double value, double a, double b) { + value = __testlib_min(__testlib_max(value, a), b); + if (value >= b) + value = std::nexttoward(b, a); + return value; +} + +static bool __testlib_prelimIsNaN(double r) { + volatile double ra = r; +#ifndef __BORLANDC__ + return ((ra != ra) == true) && ((ra == ra) == false) && ((1.0 > ra) == false) && ((1.0 < ra) == false); +#else + return std::_isnan(ra); +#endif +} + +static std::string removeDoubleTrailingZeroes(std::string value) { + while (!value.empty() && value[value.length() - 1] == '0' && value.find('.') != std::string::npos) + value = value.substr(0, value.length() - 1); + if (!value.empty() && value[value.length() - 1] == '.') + return value + '0'; + else + return value; +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 1, 2))) +#endif +std::string format(const char *fmt, ...) { + FMT_TO_RESULT(fmt, fmt, result); + return result; +} + +std::string format(const std::string fmt, ...) { + FMT_TO_RESULT(fmt, fmt.c_str(), result); + return result; +} + +static std::string __testlib_part(const std::string &s); + +static bool __testlib_isNaN(double r) { + __TESTLIB_STATIC_ASSERT(sizeof(double) == sizeof(long long)); + volatile double ra = r; + long long llr1, llr2; + std::memcpy((void *) &llr1, (void *) &ra, sizeof(double)); + ra = -ra; + std::memcpy((void *) &llr2, (void *) &ra, sizeof(double)); + long long llnan = 0xFFF8000000000000LL; + return __testlib_prelimIsNaN(r) || llnan == llr1 || llnan == llr2; +} + +static double __testlib_nan() { + __TESTLIB_STATIC_ASSERT(sizeof(double) == sizeof(long long)); +#ifndef NAN + long long llnan = 0xFFF8000000000000LL; + double nan; + std::memcpy(&nan, &llnan, sizeof(double)); + return nan; +#else + return NAN; +#endif +} + +static bool __testlib_isInfinite(double r) { + volatile double ra = r; + return (ra > 1E300 || ra < -1E300); +} + +#ifdef __GNUC__ +__attribute__((const)) +#endif +inline bool doubleCompare(double expected, double result, double MAX_DOUBLE_ERROR) { + MAX_DOUBLE_ERROR += 1E-15; + if (__testlib_isNaN(expected)) { + return __testlib_isNaN(result); + } else if (__testlib_isInfinite(expected)) { + if (expected > 0) { + return result > 0 && __testlib_isInfinite(result); + } else { + return result < 0 && __testlib_isInfinite(result); + } + } else if (__testlib_isNaN(result) || __testlib_isInfinite(result)) { + return false; + } else if (__testlib_abs(result - expected) <= MAX_DOUBLE_ERROR) { + return true; + } else { + double minv = __testlib_min(expected * (1.0 - MAX_DOUBLE_ERROR), + expected * (1.0 + MAX_DOUBLE_ERROR)); + double maxv = __testlib_max(expected * (1.0 - MAX_DOUBLE_ERROR), + expected * (1.0 + MAX_DOUBLE_ERROR)); + return result >= minv && result <= maxv; + } +} + +#ifdef __GNUC__ +__attribute__((const)) +#endif +inline double doubleDelta(double expected, double result) { + double absolute = __testlib_abs(result - expected); + + if (__testlib_abs(expected) > 1E-9) { + double relative = __testlib_abs(absolute / expected); + return __testlib_min(absolute, relative); + } else + return absolute; +} + +/** It does nothing on non-windows and files differ from stdin/stdout/stderr. */ +static void __testlib_set_binary(std::FILE *file) { + if (NULL != file) { +#ifdef ON_WINDOWS +# ifdef _O_BINARY + if (stdin == file) +# ifdef STDIN_FILENO + return void(_setmode(STDIN_FILENO, _O_BINARY)); +# else + return void(_setmode(_fileno(stdin), _O_BINARY)); +# endif + if (stdout == file) +# ifdef STDOUT_FILENO + return void(_setmode(STDOUT_FILENO, _O_BINARY)); +# else + return void(_setmode(_fileno(stdout), _O_BINARY)); +# endif + if (stderr == file) +# ifdef STDERR_FILENO + return void(_setmode(STDERR_FILENO, _O_BINARY)); +# else + return void(_setmode(_fileno(stderr), _O_BINARY)); +# endif +# elif O_BINARY + if (stdin == file) +# ifdef STDIN_FILENO + return void(setmode(STDIN_FILENO, O_BINARY)); +# else + return void(setmode(fileno(stdin), O_BINARY)); +# endif + if (stdout == file) +# ifdef STDOUT_FILENO + return void(setmode(STDOUT_FILENO, O_BINARY)); +# else + return void(setmode(fileno(stdout), O_BINARY)); +# endif + if (stderr == file) +# ifdef STDERR_FILENO + return void(setmode(STDERR_FILENO, O_BINARY)); +# else + return void(setmode(fileno(stderr), O_BINARY)); +# endif +# endif +#endif + } +} + +#if __cplusplus > 199711L || defined(_MSC_VER) +template +static std::string vtos(const T &t, std::true_type) { + if (t == 0) + return "0"; + else { + T n(t); + bool negative = n < 0; + std::string s; + while (n != 0) { + T digit = n % 10; + if (digit < 0) + digit = -digit; + s += char('0' + digit); + n /= 10; + } + std::reverse(s.begin(), s.end()); + return negative ? "-" + s : s; + } +} + +template +static std::string vtos(const T &t, std::false_type) { + std::string s; + static std::stringstream ss; + ss.str(std::string()); + ss.clear(); + ss << t; + ss >> s; + return s; +} + +template +static std::string vtos(const T &t) { + return vtos(t, std::is_integral()); +} + +/* signed case. */ +template +static std::string toHumanReadableString(const T &n, std::false_type) { + if (n == 0) + return vtos(n); + int trailingZeroCount = 0; + T n_ = n; + while (n_ % 10 == 0) + n_ /= 10, trailingZeroCount++; + if (trailingZeroCount >= 7) { + if (n_ == 1) + return "10^" + vtos(trailingZeroCount); + else if (n_ == -1) + return "-10^" + vtos(trailingZeroCount); + else + return vtos(n_) + "*10^" + vtos(trailingZeroCount); + } else + return vtos(n); +} + +/* unsigned case. */ +template +static std::string toHumanReadableString(const T &n, std::true_type) { + if (n == 0) + return vtos(n); + int trailingZeroCount = 0; + T n_ = n; + while (n_ % 10 == 0) + n_ /= 10, trailingZeroCount++; + if (trailingZeroCount >= 7) { + if (n_ == 1) + return "10^" + vtos(trailingZeroCount); + else + return vtos(n_) + "*10^" + vtos(trailingZeroCount); + } else + return vtos(n); +} + +template +static std::string toHumanReadableString(const T &n) { + return toHumanReadableString(n, std::is_unsigned()); +} +#else +template +static std::string vtos(const T& t) +{ + std::string s; + static std::stringstream ss; + ss.str(std::string()); + ss.clear(); + ss << t; + ss >> s; + return s; +} + +template +static std::string toHumanReadableString(const T &n) { + return vtos(n); +} +#endif + +template +static std::string toString(const T &t) { + return vtos(t); +} + +#if __cplusplus > 199711L || defined(_MSC_VER) +/* opts */ +void prepareOpts(int argc, char* argv[]); +#endif + +/* + * Very simple regex-like pattern. + * It used for two purposes: validation and generation. + * + * For example, pattern("[a-z]{1,5}").next(rnd) will return + * random string from lowercase latin letters with length + * from 1 to 5. It is easier to call rnd.next("[a-z]{1,5}") + * for the same effect. + * + * Another samples: + * "mike|john" will generate (match) "mike" or "john"; + * "-?[1-9][0-9]{0,3}" will generate (match) non-zero integers from -9999 to 9999; + * "id-([ac]|b{2})" will generate (match) "id-a", "id-bb", "id-c"; + * "[^0-9]*" will match sequences (empty or non-empty) without digits, you can't + * use it for generations. + * + * You can't use pattern for generation if it contains meta-symbol '*'. Also it + * is not recommended to use it for char-sets with meta-symbol '^' like [^a-z]. + * + * For matching very simple greedy algorithm is used. For example, pattern + * "[0-9]?1" will not match "1", because of greedy nature of matching. + * Alternations (meta-symbols "|") are processed with brute-force algorithm, so + * do not use many alternations in one expression. + * + * If you want to use one expression many times it is better to compile it into + * a single pattern like "pattern p("[a-z]+")". Later you can use + * "p.matches(std::string s)" or "p.next(random_t& rd)" to check matching or generate + * new string by pattern. + * + * Simpler way to read token and check it for pattern matching is "inf.readToken("[a-z]+")". + * + * All spaces are ignored in regex, unless escaped with \. For example, ouf.readLine("NO SOLUTION") + * will expect "NOSOLUTION", the correct call should be ouf.readLine("NO\\ SOLUTION") or + * ouf.readLine(R"(NO\ SOLUTION)") if you prefer raw string literals from C++11. + */ +class random_t; + +class pattern { +public: + /* Create pattern instance by string. */ + pattern(std::string s); + + /* Generate new string by pattern and given random_t. */ + std::string next(random_t &rnd) const; + + /* Checks if given string match the pattern. */ + bool matches(const std::string &s) const; + + /* Returns source string of the pattern. */ + std::string src() const; + +private: + bool matches(const std::string &s, size_t pos) const; + + std::string s; + std::vector children; + std::vector chars; + int from; + int to; +}; + +/* + * Use random_t instances to generate random values. It is preffered + * way to use randoms instead of rand() function or self-written + * randoms. + * + * Testlib defines global variable "rnd" of random_t class. + * Use registerGen(argc, argv, 1) to setup random_t seed be command + * line (to use latest random generator version). + * + * Random generates uniformly distributed values if another strategy is + * not specified explicitly. + */ +class random_t { +private: + unsigned long long seed; + static const unsigned long long multiplier; + static const unsigned long long addend; + static const unsigned long long mask; + static const int lim; + + long long nextBits(int bits) { + if (bits <= 48) { + seed = (seed * multiplier + addend) & mask; + return (long long) (seed >> (48 - bits)); + } else { + if (bits > 63) + __testlib_fail("random_t::nextBits(int bits): n must be less than 64"); + + int lowerBitCount = (random_t::version == 0 ? 31 : 32); + + long long left = (nextBits(31) << 32); + long long right = nextBits(lowerBitCount); + + return left ^ right; + } + } + +public: + static int version; + + /* New random_t with fixed seed. */ + random_t() + : seed(3905348978240129619LL) { + } + + /* Sets seed by command line. */ + void setSeed(int argc, char *argv[]) { + random_t p; + + seed = 3905348978240129619LL; + for (int i = 1; i < argc; i++) { + std::size_t le = std::strlen(argv[i]); + for (std::size_t j = 0; j < le; j++) + seed = seed * multiplier + (unsigned int) (argv[i][j]) + addend; + seed += multiplier / addend; + } + + seed = seed & mask; + } + + /* Sets seed by given value. */ + void setSeed(long long _seed) { + _seed = (_seed ^ multiplier) & mask; + seed = _seed; + } + +#ifndef __BORLANDC__ + + /* Random string value by given pattern (see pattern documentation). */ + std::string next(const std::string &ptrn) { + pattern p(ptrn); + return p.next(*this); + } + +#else + /* Random string value by given pattern (see pattern documentation). */ + std::string next(std::string ptrn) + { + pattern p(ptrn); + return p.next(*this); + } +#endif + + /* Random value in range [0, n-1]. */ + int next(int n) { + if (n <= 0) + __testlib_fail("random_t::next(int n): n must be positive"); + + if ((n & -n) == n) // n is a power of 2 + return (int) ((n * (long long) nextBits(31)) >> 31); + + const long long limit = INT_MAX / n * n; + + long long bits; + do { + bits = nextBits(31); + } while (bits >= limit); + + return int(bits % n); + } + + /* Random value in range [0, n-1]. */ + unsigned int next(unsigned int n) { + if (n >= INT_MAX) + __testlib_fail("random_t::next(unsigned int n): n must be less INT_MAX"); + return (unsigned int) next(int(n)); + } + + /* Random value in range [0, n-1]. */ + long long next(long long n) { + if (n <= 0) + __testlib_fail("random_t::next(long long n): n must be positive"); + + const long long limit = __TESTLIB_LONGLONG_MAX / n * n; + + long long bits; + do { + bits = nextBits(63); + } while (bits >= limit); + + return bits % n; + } + + /* Random value in range [0, n-1]. */ + unsigned long long next(unsigned long long n) { + if (n >= (unsigned long long) (__TESTLIB_LONGLONG_MAX)) + __testlib_fail("random_t::next(unsigned long long n): n must be less LONGLONG_MAX"); + return (unsigned long long) next((long long) (n)); + } + + /* Random value in range [0, n-1]. */ + long next(long n) { + return (long) next((long long) (n)); + } + + /* Random value in range [0, n-1]. */ + unsigned long next(unsigned long n) { + if (n >= (unsigned long) (LONG_MAX)) + __testlib_fail("random_t::next(unsigned long n): n must be less LONG_MAX"); + return (unsigned long) next((unsigned long long) (n)); + } + + /* Returns random value in range [from,to]. */ + int next(int from, int to) { + return int(next((long long) to - from + 1) + from); + } + + /* Returns random value in range [from,to]. */ + unsigned int next(unsigned int from, unsigned int to) { + return (unsigned int) (next((long long) to - from + 1) + from); + } + + /* Returns random value in range [from,to]. */ + long long next(long long from, long long to) { + return next(to - from + 1) + from; + } + + /* Returns random value in range [from,to]. */ + unsigned long long next(unsigned long long from, unsigned long long to) { + if (from > to) + __testlib_fail("random_t::next(unsigned long long from, unsigned long long to): from can't not exceed to"); + return next(to - from + 1) + from; + } + + /* Returns random value in range [from,to]. */ + long next(long from, long to) { + return next(to - from + 1) + from; + } + + /* Returns random value in range [from,to]. */ + unsigned long next(unsigned long from, unsigned long to) { + if (from > to) + __testlib_fail("random_t::next(unsigned long from, unsigned long to): from can't not exceed to"); + return next(to - from + 1) + from; + } + + /* Random double value in range [0, 1). */ + double next() { + long long left = ((long long) (nextBits(26)) << 27); + long long right = nextBits(27); + return __testlib_crop((double) (left + right) / (double) (1LL << 53), 0.0, 1.0); + } + + /* Random double value in range [0, n). */ + double next(double n) { + if (n <= 0.0) + __testlib_fail("random_t::next(double): n should be positive"); + return __testlib_crop(n * next(), 0.0, n); + } + + /* Random double value in range [from, to). */ + double next(double from, double to) { + if (from >= to) + __testlib_fail("random_t::next(double from, double to): from should be strictly less than to"); + return next(to - from) + from; + } + + /* Returns random element from container. */ + template + typename Container::value_type any(const Container &c) { + int size = int(c.size()); + if (size <= 0) + __testlib_fail("random_t::any(const Container& c): c.size() must be positive"); + return *(c.begin() + next(size)); + } + + /* Returns random element from iterator range. */ + template + typename Iter::value_type any(const Iter &begin, const Iter &end) { + int size = int(end - begin); + if (size <= 0) + __testlib_fail("random_t::any(const Iter& begin, const Iter& end): range must have positive length"); + return *(begin + next(size)); + } + + /* Random string value by given pattern (see pattern documentation). */ +#ifdef __GNUC__ + __attribute__ ((format (printf, 2, 3))) +#endif + std::string next(const char *format, ...) { + FMT_TO_RESULT(format, format, ptrn); + return next(ptrn); + } + + /* + * Weighted next. If type == 0 than it is usual "next()". + * + * If type = 1, than it returns "max(next(), next())" + * (the number of "max" functions equals to "type"). + * + * If type < 0, than "max" function replaces with "min". + */ + int wnext(int n, int type) { + if (n <= 0) + __testlib_fail("random_t::wnext(int n, int type): n must be positive"); + + if (abs(type) < random_t::lim) { + int result = next(n); + + for (int i = 0; i < +type; i++) + result = __testlib_max(result, next(n)); + + for (int i = 0; i < -type; i++) + result = __testlib_min(result, next(n)); + + return result; + } else { + double p; + + if (type > 0) + p = std::pow(next() + 0.0, 1.0 / (type + 1)); + else + p = 1 - std::pow(next() + 0.0, 1.0 / (-type + 1)); + + return __testlib_crop((int) (double(n) * p), 0, n); + } + } + + /* See wnext(int, int). It uses the same algorithms. */ + long long wnext(long long n, int type) { + if (n <= 0) + __testlib_fail("random_t::wnext(long long n, int type): n must be positive"); + + if (abs(type) < random_t::lim) { + long long result = next(n); + + for (int i = 0; i < +type; i++) + result = __testlib_max(result, next(n)); + + for (int i = 0; i < -type; i++) + result = __testlib_min(result, next(n)); + + return result; + } else { + double p; + + if (type > 0) + p = std::pow(next() + 0.0, 1.0 / (type + 1)); + else + p = 1 - std::pow(next() + 0.0, 1.0 / (-type + 1)); + + return __testlib_crop((long long) (double(n) * p), 0LL, n); + } + } + + /* Returns value in [0, n). See wnext(int, int). It uses the same algorithms. */ + double wnext(double n, int type) { + if (n <= 0) + __testlib_fail("random_t::wnext(double n, int type): n must be positive"); + + if (abs(type) < random_t::lim) { + double result = next(); + + for (int i = 0; i < +type; i++) + result = __testlib_max(result, next()); + + for (int i = 0; i < -type; i++) + result = __testlib_min(result, next()); + + return n * result; + } else { + double p; + + if (type > 0) + p = std::pow(next() + 0.0, 1.0 / (type + 1)); + else + p = 1 - std::pow(next() + 0.0, 1.0 / (-type + 1)); + + return __testlib_crop(n * p, 0.0, n); + } + } + + /* Returns value in [0, 1). See wnext(int, int). It uses the same algorithms. */ + double wnext(int type) { + return wnext(1.0, type); + } + + /* See wnext(int, int). It uses the same algorithms. */ + unsigned int wnext(unsigned int n, int type) { + if (n >= INT_MAX) + __testlib_fail("random_t::wnext(unsigned int n, int type): n must be less INT_MAX"); + return (unsigned int) wnext(int(n), type); + } + + /* See wnext(int, int). It uses the same algorithms. */ + unsigned long long wnext(unsigned long long n, int type) { + if (n >= (unsigned long long) (__TESTLIB_LONGLONG_MAX)) + __testlib_fail("random_t::wnext(unsigned long long n, int type): n must be less LONGLONG_MAX"); + + return (unsigned long long) wnext((long long) (n), type); + } + + /* See wnext(int, int). It uses the same algorithms. */ + long wnext(long n, int type) { + return (long) wnext((long long) (n), type); + } + + /* See wnext(int, int). It uses the same algorithms. */ + unsigned long wnext(unsigned long n, int type) { + if (n >= (unsigned long) (LONG_MAX)) + __testlib_fail("random_t::wnext(unsigned long n, int type): n must be less LONG_MAX"); + + return (unsigned long) wnext((unsigned long long) (n), type); + } + + /* Returns weighted random value in range [from, to]. */ + int wnext(int from, int to, int type) { + if (from > to) + __testlib_fail("random_t::wnext(int from, int to, int type): from can't not exceed to"); + return wnext(to - from + 1, type) + from; + } + + /* Returns weighted random value in range [from, to]. */ + int wnext(unsigned int from, unsigned int to, int type) { + if (from > to) + __testlib_fail("random_t::wnext(unsigned int from, unsigned int to, int type): from can't not exceed to"); + return int(wnext(to - from + 1, type) + from); + } + + /* Returns weighted random value in range [from, to]. */ + long long wnext(long long from, long long to, int type) { + if (from > to) + __testlib_fail("random_t::wnext(long long from, long long to, int type): from can't not exceed to"); + return wnext(to - from + 1, type) + from; + } + + /* Returns weighted random value in range [from, to]. */ + unsigned long long wnext(unsigned long long from, unsigned long long to, int type) { + if (from > to) + __testlib_fail( + "random_t::wnext(unsigned long long from, unsigned long long to, int type): from can't not exceed to"); + return wnext(to - from + 1, type) + from; + } + + /* Returns weighted random value in range [from, to]. */ + long wnext(long from, long to, int type) { + if (from > to) + __testlib_fail("random_t::wnext(long from, long to, int type): from can't not exceed to"); + return wnext(to - from + 1, type) + from; + } + + /* Returns weighted random value in range [from, to]. */ + unsigned long wnext(unsigned long from, unsigned long to, int type) { + if (from > to) + __testlib_fail("random_t::wnext(unsigned long from, unsigned long to, int type): from can't not exceed to"); + return wnext(to - from + 1, type) + from; + } + + /* Returns weighted random double value in range [from, to). */ + double wnext(double from, double to, int type) { + if (from >= to) + __testlib_fail("random_t::wnext(double from, double to, int type): from should be strictly less than to"); + return wnext(to - from, type) + from; + } + + /* Returns weighted random element from container. */ + template + typename Container::value_type wany(const Container &c, int type) { + size_t size = c.size(); + if (size <= 0) + __testlib_fail("random_t::wany(const Container& c, int type): c.size() must be positive"); + return *(c.begin() + wnext(size, type)); + } + + /* Returns weighted random element from iterator range. */ + template + typename Iter::value_type wany(const Iter &begin, const Iter &end, int type) { + int size = int(end - begin); + if (size <= 0) + __testlib_fail( + "random_t::any(const Iter& begin, const Iter& end, int type): range must have positive length"); + return *(begin + wnext(size, type)); + } + + /* Returns random permutation of the given size (values are between `first` and `first`+size-1)*/ + template + std::vector perm(T size, E first) { + if (size < 0) + __testlib_fail("random_t::perm(T size, E first = 0): size must non-negative"); + else if (size == 0) + return std::vector(); + std::vector p(size); + E current = first; + for (T i = 0; i < size; i++) + p[i] = current++; + if (size > 1) + for (T i = 1; i < size; i++) + std::swap(p[i], p[next(i + 1)]); + return p; + } + + /* Returns random permutation of the given size (values are between 0 and size-1)*/ + template + std::vector perm(T size) { + return perm(size, T(0)); + } + + /* Returns `size` unordered (unsorted) distinct numbers between `from` and `to`. */ + template + std::vector distinct(int size, T from, T to) { + std::vector result; + if (size == 0) + return result; + + if (from > to) + __testlib_fail("random_t::distinct expected from <= to"); + + if (size < 0) + __testlib_fail("random_t::distinct expected size >= 0"); + + uint64_t n = to - from + 1; + if (uint64_t(size) > n) + __testlib_fail("random_t::distinct expected size <= to - from + 1"); + + double expected = 0.0; + for (int i = 1; i <= size; i++) + expected += double(n) / double(n - i + 1); + + if (expected < double(n)) { + std::set vals; + while (int(vals.size()) < size) { + T x = T(next(from, to)); + if (vals.insert(x).second) + result.push_back(x); + } + } else { + if (n > 1000000000) + __testlib_fail("random_t::distinct here expected to - from + 1 <= 1000000000"); + std::vector p(perm(int(n), from)); + result.insert(result.end(), p.begin(), p.begin() + size); + } + + return result; + } + + /* Returns `size` unordered (unsorted) distinct numbers between `0` and `upper`-1. */ + template + std::vector distinct(int size, T upper) { + if (size < 0) + __testlib_fail("random_t::distinct expected size >= 0"); + if (size == 0) + return std::vector(); + + if (upper <= 0) + __testlib_fail("random_t::distinct expected upper > 0"); + if (size > upper) + __testlib_fail("random_t::distinct expected size <= upper"); + + return distinct(size, T(0), upper - 1); + } + + /* Returns random (unsorted) partition which is a representation of sum as a sum of integers not less than min_part. */ + template + std::vector partition(int size, T sum, T min_part) { + if (size < 0) + __testlib_fail("random_t::partition: size < 0"); + if (size == 0 && sum != 0) + __testlib_fail("random_t::partition: size == 0 && sum != 0"); + if (min_part * size > sum) + __testlib_fail("random_t::partition: min_part * size > sum"); + if (size == 0 && sum == 0) + return std::vector(); + + T sum_ = sum; + sum -= min_part * size; + + std::vector septums(size); + std::vector d = distinct(size - 1, T(1), T(sum + size - 1)); + for (int i = 0; i + 1 < size; i++) + septums[i + 1] = d[i]; + sort(septums.begin(), septums.end()); + + std::vector result(size); + for (int i = 0; i + 1 < size; i++) + result[i] = septums[i + 1] - septums[i] - 1; + result[size - 1] = sum + size - 1 - septums.back(); + + for (std::size_t i = 0; i < result.size(); i++) + result[i] += min_part; + + T result_sum = 0; + for (std::size_t i = 0; i < result.size(); i++) + result_sum += result[i]; + if (result_sum != sum_) + __testlib_fail("random_t::partition: partition sum is expected to be the given sum"); + + if (*std::min_element(result.begin(), result.end()) < min_part) + __testlib_fail("random_t::partition: partition min is expected to be no less than the given min_part"); + + if (int(result.size()) != size || result.size() != (size_t) size) + __testlib_fail("random_t::partition: partition size is expected to be equal to the given size"); + + return result; + } + + /* Returns random (unsorted) partition which is a representation of sum as a sum of positive integers. */ + template + std::vector partition(int size, T sum) { + return partition(size, sum, T(1)); + } +}; + +const int random_t::lim = 25; +const unsigned long long random_t::multiplier = 0x5DEECE66DLL; +const unsigned long long random_t::addend = 0xBLL; +const unsigned long long random_t::mask = (1LL << 48) - 1; +int random_t::version = -1; + +/* Pattern implementation */ +bool pattern::matches(const std::string &s) const { + return matches(s, 0); +} + +static bool __pattern_isSlash(const std::string &s, size_t pos) { + return s[pos] == '\\'; +} + +#ifdef __GNUC__ +__attribute__((pure)) +#endif +static bool __pattern_isCommandChar(const std::string &s, size_t pos, char value) { + if (pos >= s.length()) + return false; + + int slashes = 0; + + int before = int(pos) - 1; + while (before >= 0 && s[before] == '\\') + before--, slashes++; + + return slashes % 2 == 0 && s[pos] == value; +} + +static char __pattern_getChar(const std::string &s, size_t &pos) { + if (__pattern_isSlash(s, pos)) + pos += 2; + else + pos++; + + return s[pos - 1]; +} + +#ifdef __GNUC__ +__attribute__((pure)) +#endif +static int __pattern_greedyMatch(const std::string &s, size_t pos, const std::vector chars) { + int result = 0; + + while (pos < s.length()) { + char c = s[pos++]; + if (!std::binary_search(chars.begin(), chars.end(), c)) + break; + else + result++; + } + + return result; +} + +std::string pattern::src() const { + return s; +} + +bool pattern::matches(const std::string &s, size_t pos) const { + std::string result; + + if (to > 0) { + int size = __pattern_greedyMatch(s, pos, chars); + if (size < from) + return false; + if (size > to) + size = to; + pos += size; + } + + if (children.size() > 0) { + for (size_t child = 0; child < children.size(); child++) + if (children[child].matches(s, pos)) + return true; + return false; + } else + return pos == s.length(); +} + +std::string pattern::next(random_t &rnd) const { + std::string result; + result.reserve(20); + + if (to == INT_MAX) + __testlib_fail("pattern::next(random_t& rnd): can't process character '*' for generation"); + + if (to > 0) { + int count = rnd.next(to - from + 1) + from; + for (int i = 0; i < count; i++) + result += chars[rnd.next(int(chars.size()))]; + } + + if (children.size() > 0) { + int child = rnd.next(int(children.size())); + result += children[child].next(rnd); + } + + return result; +} + +static void __pattern_scanCounts(const std::string &s, size_t &pos, int &from, int &to) { + if (pos >= s.length()) { + from = to = 1; + return; + } + + if (__pattern_isCommandChar(s, pos, '{')) { + std::vector parts; + std::string part; + + pos++; + + while (pos < s.length() && !__pattern_isCommandChar(s, pos, '}')) { + if (__pattern_isCommandChar(s, pos, ',')) + parts.push_back(part), part = "", pos++; + else + part += __pattern_getChar(s, pos); + } + + if (part != "") + parts.push_back(part); + + if (!__pattern_isCommandChar(s, pos, '}')) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + pos++; + + if (parts.size() < 1 || parts.size() > 2) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + std::vector numbers; + + for (size_t i = 0; i < parts.size(); i++) { + if (parts[i].length() == 0) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + int number; + if (std::sscanf(parts[i].c_str(), "%d", &number) != 1) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + numbers.push_back(number); + } + + if (numbers.size() == 1) + from = to = numbers[0]; + else + from = numbers[0], to = numbers[1]; + + if (from > to) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + } else { + if (__pattern_isCommandChar(s, pos, '?')) { + from = 0, to = 1, pos++; + return; + } + + if (__pattern_isCommandChar(s, pos, '*')) { + from = 0, to = INT_MAX, pos++; + return; + } + + if (__pattern_isCommandChar(s, pos, '+')) { + from = 1, to = INT_MAX, pos++; + return; + } + + from = to = 1; + } +} + +static std::vector __pattern_scanCharSet(const std::string &s, size_t &pos) { + if (pos >= s.length()) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + std::vector result; + + if (__pattern_isCommandChar(s, pos, '[')) { + pos++; + bool negative = __pattern_isCommandChar(s, pos, '^'); + if (negative) + pos++; + + char prev = 0; + + while (pos < s.length() && !__pattern_isCommandChar(s, pos, ']')) { + if (__pattern_isCommandChar(s, pos, '-') && prev != 0) { + pos++; + + if (pos + 1 == s.length() || __pattern_isCommandChar(s, pos, ']')) { + result.push_back(prev); + prev = '-'; + continue; + } + + char next = __pattern_getChar(s, pos); + if (prev > next) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + for (char c = prev; c != next; c++) + result.push_back(c); + result.push_back(next); + + prev = 0; + } else { + if (prev != 0) + result.push_back(prev); + prev = __pattern_getChar(s, pos); + } + } + + if (prev != 0) + result.push_back(prev); + + if (!__pattern_isCommandChar(s, pos, ']')) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + pos++; + + if (negative) { + std::sort(result.begin(), result.end()); + std::vector actuals; + for (int code = 0; code < 255; code++) { + char c = char(code); + if (!std::binary_search(result.begin(), result.end(), c)) + actuals.push_back(c); + } + result = actuals; + } + + std::sort(result.begin(), result.end()); + } else + result.push_back(__pattern_getChar(s, pos)); + + return result; +} + +pattern::pattern(std::string s) : s(s), from(0), to(0) { + std::string t; + for (size_t i = 0; i < s.length(); i++) + if (!__pattern_isCommandChar(s, i, ' ')) + t += s[i]; + s = t; + + int opened = 0; + int firstClose = -1; + std::vector seps; + + for (size_t i = 0; i < s.length(); i++) { + if (__pattern_isCommandChar(s, i, '(')) { + opened++; + continue; + } + + if (__pattern_isCommandChar(s, i, ')')) { + opened--; + if (opened == 0 && firstClose == -1) + firstClose = int(i); + continue; + } + + if (opened < 0) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + if (__pattern_isCommandChar(s, i, '|') && opened == 0) + seps.push_back(int(i)); + } + + if (opened != 0) + __testlib_fail("pattern: Illegal pattern (or part) \"" + s + "\""); + + if (seps.size() == 0 && firstClose + 1 == (int) s.length() + && __pattern_isCommandChar(s, 0, '(') && __pattern_isCommandChar(s, s.length() - 1, ')')) { + children.push_back(pattern(s.substr(1, s.length() - 2))); + } else { + if (seps.size() > 0) { + seps.push_back(int(s.length())); + int last = 0; + + for (size_t i = 0; i < seps.size(); i++) { + children.push_back(pattern(s.substr(last, seps[i] - last))); + last = seps[i] + 1; + } + } else { + size_t pos = 0; + chars = __pattern_scanCharSet(s, pos); + __pattern_scanCounts(s, pos, from, to); + if (pos < s.length()) + children.push_back(pattern(s.substr(pos))); + } + } +} + +/* End of pattern implementation */ + +template +inline bool isEof(C c) { + return c == EOFC; +} + +template +inline bool isEoln(C c) { + return (c == LF || c == CR); +} + +template +inline bool isBlanks(C c) { + return (c == LF || c == CR || c == SPACE || c == TAB); +} + +inline std::string trim(const std::string &s) { + if (s.empty()) + return s; + + int left = 0; + while (left < int(s.length()) && isBlanks(s[left])) + left++; + if (left >= int(s.length())) + return ""; + + int right = int(s.length()) - 1; + while (right >= 0 && isBlanks(s[right])) + right--; + if (right < 0) + return ""; + + return s.substr(left, right - left + 1); +} + +enum TMode { + _input, _output, _answer +}; + +/* Outcomes 6-15 are reserved for future use. */ +enum TResult { + _ok = 0, + _wa = 1, + _pe = 2, + _fail = 3, + _dirt = 4, + _points = 5, + _unexpected_eof = 8, + _partially = 16 +}; + +enum TTestlibMode { + _unknown, _checker, _validator, _generator, _interactor, _scorer +}; + +#define _pc(exitCode) (TResult(_partially + (exitCode))) + +/* Outcomes 6-15 are reserved for future use. */ +const std::string outcomes[] = { + "accepted", + "wrong-answer", + "presentation-error", + "fail", + "fail", +#ifndef PCMS2 + "points", +#else + "relative-scoring", +#endif + "reserved", + "reserved", + "unexpected-eof", + "reserved", + "reserved", + "reserved", + "reserved", + "reserved", + "reserved", + "reserved", + "partially-correct" +}; + +class InputStreamReader { +public: + virtual void setTestCase(int testCase) = 0; + + virtual std::vector getReadChars() = 0; + + virtual int curChar() = 0; + + virtual int nextChar() = 0; + + virtual void skipChar() = 0; + + virtual void unreadChar(int c) = 0; + + virtual std::string getName() = 0; + + virtual bool eof() = 0; + + virtual void close() = 0; + + virtual int getLine() = 0; + + virtual ~InputStreamReader() = 0; +}; + +InputStreamReader::~InputStreamReader() { + // No operations. +} + +class StringInputStreamReader : public InputStreamReader { +private: + std::string s; + size_t pos; + +public: + StringInputStreamReader(const std::string &content) : s(content), pos(0) { + // No operations. + } + + void setTestCase(int) { + __testlib_fail("setTestCase not implemented in StringInputStreamReader"); + } + + std::vector getReadChars() { + __testlib_fail("getReadChars not implemented in StringInputStreamReader"); + } + + int curChar() { + if (pos >= s.length()) + return EOFC; + else + return s[pos]; + } + + int nextChar() { + if (pos >= s.length()) { + pos++; + return EOFC; + } else + return s[pos++]; + } + + void skipChar() { + pos++; + } + + void unreadChar(int c) { + if (pos == 0) + __testlib_fail("StringInputStreamReader::unreadChar(int): pos == 0."); + pos--; + if (pos < s.length()) + s[pos] = char(c); + } + + std::string getName() { + return __testlib_part(s); + } + + int getLine() { + return -1; + } + + bool eof() { + return pos >= s.length(); + } + + void close() { + // No operations. + } +}; + +class FileInputStreamReader : public InputStreamReader { +private: + std::FILE *file; + std::string name; + int line; + std::vector undoChars; + std::vector readChars; + std::vector undoReadChars; + + inline int postprocessGetc(int getcResult) { + if (getcResult != EOF) + return getcResult; + else + return EOFC; + } + + int getc(FILE *file) { + int c; + int rc; + + if (undoChars.empty()) { + c = rc = ::getc(file); + } else { + c = undoChars.back(); + undoChars.pop_back(); + rc = undoReadChars.back(); + undoReadChars.pop_back(); + } + + if (c == LF) + line++; + + readChars.push_back(rc); + return c; + } + + int ungetc(int c/*, FILE* file*/) { + if (!readChars.empty()) { + undoReadChars.push_back(readChars.back()); + readChars.pop_back(); + } + if (c == LF) + line--; + undoChars.push_back(c); + return c; + } + +public: + FileInputStreamReader(std::FILE *file, const std::string &name) : file(file), name(name), line(1) { + // No operations. + } + + void setTestCase(int testCase) { + if (testCase < 0 || testCase > __TESTLIB_MAX_TEST_CASE) + __testlib_fail(format("testCase expected fit in [1,%d], but %d doesn't", __TESTLIB_MAX_TEST_CASE, testCase)); + readChars.push_back(testCase + 256); + } + + std::vector getReadChars() { + return readChars; + } + + int curChar() { + if (feof(file)) + return EOFC; + else { + int c = getc(file); + ungetc(c/*, file*/); + return postprocessGetc(c); + } + } + + int nextChar() { + if (feof(file)) + return EOFC; + else + return postprocessGetc(getc(file)); + } + + void skipChar() { + getc(file); + } + + void unreadChar(int c) { + ungetc(c/*, file*/); + } + + std::string getName() { + return name; + } + + int getLine() { + return line; + } + + bool eof() { + if (NULL == file || feof(file)) + return true; + else { + int c = nextChar(); + if (c == EOFC || (c == EOF && feof(file))) + return true; + unreadChar(c); + return false; + } + } + + void close() { + if (NULL != file) { + fclose(file); + file = NULL; + } + } +}; + +class BufferedFileInputStreamReader : public InputStreamReader { +private: + static const size_t BUFFER_SIZE; + static const size_t MAX_UNREAD_COUNT; + + std::FILE *file; + std::string name; + int line; + + char *buffer; + bool *isEof; + int bufferPos; + size_t bufferSize; + + bool refill() { + if (NULL == file) + __testlib_fail("BufferedFileInputStreamReader: file == NULL (" + getName() + ")"); + + if (bufferPos >= int(bufferSize)) { + size_t readSize = fread( + buffer + MAX_UNREAD_COUNT, + 1, + BUFFER_SIZE - MAX_UNREAD_COUNT, + file + ); + + if (readSize < BUFFER_SIZE - MAX_UNREAD_COUNT + && ferror(file)) + __testlib_fail("BufferedFileInputStreamReader: unable to read (" + getName() + ")"); + + bufferSize = MAX_UNREAD_COUNT + readSize; + bufferPos = int(MAX_UNREAD_COUNT); + std::memset(isEof + MAX_UNREAD_COUNT, 0, sizeof(isEof[0]) * readSize); + + return readSize > 0; + } else + return true; + } + + char increment() { + char c; + if ((c = buffer[bufferPos++]) == LF) + line++; + return c; + } + +public: + BufferedFileInputStreamReader(std::FILE *file, const std::string &name) : file(file), name(name), line(1) { + buffer = new char[BUFFER_SIZE]; + isEof = new bool[BUFFER_SIZE]; + bufferSize = MAX_UNREAD_COUNT; + bufferPos = int(MAX_UNREAD_COUNT); + } + + ~BufferedFileInputStreamReader() { + if (NULL != buffer) { + delete[] buffer; + buffer = NULL; + } + if (NULL != isEof) { + delete[] isEof; + isEof = NULL; + } + } + + void setTestCase(int) { + __testlib_fail("setTestCase not implemented in BufferedFileInputStreamReader"); + } + + std::vector getReadChars() { + __testlib_fail("getReadChars not implemented in BufferedFileInputStreamReader"); + } + + int curChar() { + if (!refill()) + return EOFC; + + return isEof[bufferPos] ? EOFC : buffer[bufferPos]; + } + + int nextChar() { + if (!refill()) + return EOFC; + + return isEof[bufferPos] ? EOFC : increment(); + } + + void skipChar() { + increment(); + } + + void unreadChar(int c) { + bufferPos--; + if (bufferPos < 0) + __testlib_fail("BufferedFileInputStreamReader::unreadChar(int): bufferPos < 0"); + isEof[bufferPos] = (c == EOFC); + buffer[bufferPos] = char(c); + if (c == LF) + line--; + } + + std::string getName() { + return name; + } + + int getLine() { + return line; + } + + bool eof() { + return !refill() || EOFC == curChar(); + } + + void close() { + if (NULL != file) { + fclose(file); + file = NULL; + } + } +}; + +const size_t BufferedFileInputStreamReader::BUFFER_SIZE = 2000000; +const size_t BufferedFileInputStreamReader::MAX_UNREAD_COUNT = BufferedFileInputStreamReader::BUFFER_SIZE / 2; + +/* + * Streams to be used for reading data in checkers or validators. + * Each read*() method moves pointer to the next character after the + * read value. + */ +struct InStream { + /* Do not use them. */ + InStream(); + + ~InStream(); + + /* Wrap std::string with InStream. */ + InStream(const InStream &baseStream, std::string content); + + InputStreamReader *reader; + int lastLine; + + std::string name; + TMode mode; + bool opened; + bool stdfile; + bool strict; + + int wordReserveSize; + std::string _tmpReadToken; + + int readManyIteration; + size_t maxFileSize; + size_t maxTokenLength; + size_t maxMessageLength; + + void init(std::string fileName, TMode mode); + + void init(std::FILE *f, TMode mode); + + void setTestCase(int testCase); + std::vector getReadChars(); + + /* Moves stream pointer to the first non-white-space character or EOF. */ + void skipBlanks(); + + /* Returns current character in the stream. Doesn't remove it from stream. */ + char curChar(); + + /* Moves stream pointer one character forward. */ + void skipChar(); + + /* Returns current character and moves pointer one character forward. */ + char nextChar(); + + /* Returns current character and moves pointer one character forward. */ + char readChar(); + + /* As "readChar()" but ensures that the result is equal to given parameter. */ + char readChar(char c); + + /* As "readChar()" but ensures that the result is equal to the space (code=32). */ + char readSpace(); + + /* Puts back the character into the stream. */ + void unreadChar(char c); + + /* Reopens stream, you should not use it. */ + void reset(std::FILE *file = NULL); + + /* Checks that current position is EOF. If not it doesn't move stream pointer. */ + bool eof(); + + /* Moves pointer to the first non-white-space character and calls "eof()". */ + bool seekEof(); + + /* + * Checks that current position contains EOLN. + * If not it doesn't move stream pointer. + * In strict mode expects "#13#10" for windows or "#10" for other platforms. + */ + bool eoln(); + + /* Moves pointer to the first non-space and non-tab character and calls "eoln()". */ + bool seekEoln(); + + /* Moves stream pointer to the first character of the next line (if exists). */ + void nextLine(); + + /* + * Reads new token. Ignores white-spaces into the non-strict mode + * (strict mode is used in validators usually). + */ + std::string readWord(); + + /* The same as "readWord()", it is preffered to use "readToken()". */ + std::string readToken(); + + /* The same as "readWord()", but ensures that token matches to given pattern. */ + std::string readWord(const std::string &ptrn, const std::string &variableName = ""); + + std::string readWord(const pattern &p, const std::string &variableName = ""); + + std::vector + readWords(int size, const std::string &ptrn, const std::string &variablesName = "", int indexBase = 1); + + std::vector + readWords(int size, const pattern &p, const std::string &variablesName = "", int indexBase = 1); + + std::vector readWords(int size, int indexBase = 1); + + /* The same as "readToken()", but ensures that token matches to given pattern. */ + std::string readToken(const std::string &ptrn, const std::string &variableName = ""); + + std::string readToken(const pattern &p, const std::string &variableName = ""); + + std::vector + readTokens(int size, const std::string &ptrn, const std::string &variablesName = "", int indexBase = 1); + + std::vector + readTokens(int size, const pattern &p, const std::string &variablesName = "", int indexBase = 1); + + std::vector readTokens(int size, int indexBase = 1); + + void readWordTo(std::string &result); + + void readWordTo(std::string &result, const pattern &p, const std::string &variableName = ""); + + void readWordTo(std::string &result, const std::string &ptrn, const std::string &variableName = ""); + + void readTokenTo(std::string &result); + + void readTokenTo(std::string &result, const pattern &p, const std::string &variableName = ""); + + void readTokenTo(std::string &result, const std::string &ptrn, const std::string &variableName = ""); + + /* + * Reads new long long value. Ignores white-spaces into the non-strict mode + * (strict mode is used in validators usually). + */ + long long readLong(); + + unsigned long long readUnsignedLong(); + + /* + * Reads new int. Ignores white-spaces into the non-strict mode + * (strict mode is used in validators usually). + */ + int readInteger(); + + /* + * Reads new int. Ignores white-spaces into the non-strict mode + * (strict mode is used in validators usually). + */ + int readInt(); + + /* As "readLong()" but ensures that value in the range [minv,maxv]. */ + long long readLong(long long minv, long long maxv, const std::string &variableName = ""); + + /* Reads space-separated sequence of long longs. */ + std::vector + readLongs(int size, long long minv, long long maxv, const std::string &variablesName = "", int indexBase = 1); + + /* Reads space-separated sequence of long longs. */ + std::vector readLongs(int size, int indexBase = 1); + + unsigned long long + readUnsignedLong(unsigned long long minv, unsigned long long maxv, const std::string &variableName = ""); + + std::vector + readUnsignedLongs(int size, unsigned long long minv, unsigned long long maxv, const std::string &variablesName = "", + int indexBase = 1); + + std::vector readUnsignedLongs(int size, int indexBase = 1); + + unsigned long long readLong(unsigned long long minv, unsigned long long maxv, const std::string &variableName = ""); + + std::vector + readLongs(int size, unsigned long long minv, unsigned long long maxv, const std::string &variablesName = "", + int indexBase = 1); + + /* As "readInteger()" but ensures that value in the range [minv,maxv]. */ + int readInteger(int minv, int maxv, const std::string &variableName = ""); + + /* As "readInt()" but ensures that value in the range [minv,maxv]. */ + int readInt(int minv, int maxv, const std::string &variableName = ""); + + /* Reads space-separated sequence of integers. */ + std::vector + readIntegers(int size, int minv, int maxv, const std::string &variablesName = "", int indexBase = 1); + + /* Reads space-separated sequence of integers. */ + std::vector readIntegers(int size, int indexBase = 1); + + /* Reads space-separated sequence of integers. */ + std::vector readInts(int size, int minv, int maxv, const std::string &variablesName = "", int indexBase = 1); + + /* Reads space-separated sequence of integers. */ + std::vector readInts(int size, int indexBase = 1); + + /* + * Reads new double. Ignores white-spaces into the non-strict mode + * (strict mode is used in validators usually). + */ + double readReal(); + + /* + * Reads new double. Ignores white-spaces into the non-strict mode + * (strict mode is used in validators usually). + */ + double readDouble(); + + /* As "readReal()" but ensures that value in the range [minv,maxv]. */ + double readReal(double minv, double maxv, const std::string &variableName = ""); + + std::vector + readReals(int size, double minv, double maxv, const std::string &variablesName = "", int indexBase = 1); + + std::vector readReals(int size, int indexBase = 1); + + /* As "readDouble()" but ensures that value in the range [minv,maxv]. */ + double readDouble(double minv, double maxv, const std::string &variableName = ""); + + std::vector + readDoubles(int size, double minv, double maxv, const std::string &variablesName = "", int indexBase = 1); + + std::vector readDoubles(int size, int indexBase = 1); + + /* + * As "readReal()" but ensures that value in the range [minv,maxv] and + * number of digit after the decimal point is in range [minAfterPointDigitCount,maxAfterPointDigitCount] + * and number is in the form "[-]digit(s)[.digit(s)]". + */ + double readStrictReal(double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variableName = ""); + + std::vector readStrictReals(int size, double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variablesName = "", int indexBase = 1); + + /* + * As "readDouble()" but ensures that value in the range [minv,maxv] and + * number of digit after the decimal point is in range [minAfterPointDigitCount,maxAfterPointDigitCount] + * and number is in the form "[-]digit(s)[.digit(s)]". + */ + double readStrictDouble(double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variableName = ""); + + std::vector readStrictDoubles(int size, double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variablesName = "", int indexBase = 1); + + /* As readLine(). */ + std::string readString(); + + /* Read many lines. */ + std::vector readStrings(int size, int indexBase = 1); + + /* See readLine(). */ + void readStringTo(std::string &result); + + /* The same as "readLine()/readString()", but ensures that line matches to the given pattern. */ + std::string readString(const pattern &p, const std::string &variableName = ""); + + /* The same as "readLine()/readString()", but ensures that line matches to the given pattern. */ + std::string readString(const std::string &ptrn, const std::string &variableName = ""); + + /* Read many lines. */ + std::vector + readStrings(int size, const pattern &p, const std::string &variableName = "", int indexBase = 1); + + /* Read many lines. */ + std::vector + readStrings(int size, const std::string &ptrn, const std::string &variableName = "", int indexBase = 1); + + /* The same as "readLine()/readString()", but ensures that line matches to the given pattern. */ + void readStringTo(std::string &result, const pattern &p, const std::string &variableName = ""); + + /* The same as "readLine()/readString()", but ensures that line matches to the given pattern. */ + void readStringTo(std::string &result, const std::string &ptrn, const std::string &variableName = ""); + + /* + * Reads line from the current position to EOLN or EOF. Moves stream pointer to + * the first character of the new line (if possible). + */ + std::string readLine(); + + /* Read many lines. */ + std::vector readLines(int size, int indexBase = 1); + + /* See readLine(). */ + void readLineTo(std::string &result); + + /* The same as "readLine()", but ensures that line matches to the given pattern. */ + std::string readLine(const pattern &p, const std::string &variableName = ""); + + /* The same as "readLine()", but ensures that line matches to the given pattern. */ + std::string readLine(const std::string &ptrn, const std::string &variableName = ""); + + /* Read many lines. */ + std::vector + readLines(int size, const pattern &p, const std::string &variableName = "", int indexBase = 1); + + /* Read many lines. */ + std::vector + readLines(int size, const std::string &ptrn, const std::string &variableName = "", int indexBase = 1); + + /* The same as "readLine()", but ensures that line matches to the given pattern. */ + void readLineTo(std::string &result, const pattern &p, const std::string &variableName = ""); + + /* The same as "readLine()", but ensures that line matches to the given pattern. */ + void readLineTo(std::string &result, const std::string &ptrn, const std::string &variableName = ""); + + /* Reads EOLN or fails. Use it in validators. Calls "eoln()" method internally. */ + void readEoln(); + + /* Reads EOF or fails. Use it in validators. Calls "eof()" method internally. */ + void readEof(); + + /* + * Quit-functions aborts program with and : + * input/answer streams replace any result to FAIL. + */ + NORETURN void quit(TResult result, const char *msg); + /* + * Quit-functions aborts program with and : + * input/answer streams replace any result to FAIL. + */ + NORETURN void quitf(TResult result, const char *msg, ...); + + /* + * Quit-functions aborts program with and : + * input/answer streams replace any result to FAIL. + */ + void quitif(bool condition, TResult result, const char *msg, ...); + /* + * Quit-functions aborts program with and : + * input/answer streams replace any result to FAIL. + */ + NORETURN void quits(TResult result, std::string msg); + + /* + * Checks condition and aborts a program if codition is false. + * Returns _wa for ouf and _fail on any other streams. + */ +#ifdef __GNUC__ + __attribute__ ((format (printf, 3, 4))) +#endif + void ensuref(bool cond, const char *format, ...); + + void __testlib_ensure(bool cond, std::string message); + + void close(); + + const static int NO_INDEX = INT_MAX; + const static char OPEN_BRACKET = char(11); + const static char CLOSE_BRACKET = char(17); + + const static WORD LightGray = 0x07; + const static WORD LightRed = 0x0c; + const static WORD LightCyan = 0x0b; + const static WORD LightGreen = 0x0a; + const static WORD LightYellow = 0x0e; + + static void textColor(WORD color); + + static void quitscr(WORD color, const char *msg); + + static void quitscrS(WORD color, std::string msg); + + void xmlSafeWrite(std::FILE *file, const char *msg); + + /* Skips UTF-8 Byte Order Mark. */ + void skipBom(); + +private: + InStream(const InStream &); + + InStream &operator=(const InStream &); +}; + +InStream inf; +InStream ouf; +InStream ans; +bool appesMode; +std::string resultName; +std::string checkerName = "untitled checker"; +random_t rnd; +TTestlibMode testlibMode = _unknown; +double __testlib_points = std::numeric_limits::infinity(); + +struct ValidatorBoundsHit { + static const double EPS; + bool minHit; + bool maxHit; + + ValidatorBoundsHit(bool minHit = false, bool maxHit = false) : minHit(minHit), maxHit(maxHit) { + }; + + ValidatorBoundsHit merge(const ValidatorBoundsHit &validatorBoundsHit) { + return ValidatorBoundsHit( + __testlib_max(minHit, validatorBoundsHit.minHit), + __testlib_max(maxHit, validatorBoundsHit.maxHit) + ); + } +}; + +const double ValidatorBoundsHit::EPS = 1E-12; + +class Validator { +private: + const static std::string TEST_MARKUP_HEADER; + const static std::string TEST_CASE_OPEN_TAG; + const static std::string TEST_CASE_CLOSE_TAG; + + bool _initialized; + std::string _testset; + std::string _group; + + std::string _testOverviewLogFileName; + std::string _testMarkupFileName; + int _testCase = -1; + std::string _testCaseFileName; + + std::map _boundsHitByVariableName; + std::set _features; + std::set _hitFeatures; + + bool isVariableNameBoundsAnalyzable(const std::string &variableName) { + for (size_t i = 0; i < variableName.length(); i++) + if ((variableName[i] >= '0' && variableName[i] <= '9') || variableName[i] < ' ') + return false; + return true; + } + + bool isFeatureNameAnalyzable(const std::string &featureName) { + for (size_t i = 0; i < featureName.length(); i++) + if (featureName[i] < ' ') + return false; + return true; + } + +public: + Validator() : _initialized(false), _testset("tests"), _group() { + } + + void initialize() { + _initialized = true; + } + + std::string testset() const { + if (!_initialized) + __testlib_fail("Validator should be initialized with registerValidation(argc, argv) instead of registerValidation() to support validator.testset()"); + return _testset; + } + + std::string group() const { + if (!_initialized) + __testlib_fail("Validator should be initialized with registerValidation(argc, argv) instead of registerValidation() to support validator.group()"); + return _group; + } + + std::string testOverviewLogFileName() const { + return _testOverviewLogFileName; + } + + std::string testMarkupFileName() const { + return _testMarkupFileName; + } + + int testCase() const { + return _testCase; + } + + std::string testCaseFileName() const { + return _testCaseFileName; + } + + void setTestset(const char *const testset) { + _testset = testset; + } + + void setGroup(const char *const group) { + _group = group; + } + + void setTestOverviewLogFileName(const char *const testOverviewLogFileName) { + _testOverviewLogFileName = testOverviewLogFileName; + } + + void setTestMarkupFileName(const char *const testMarkupFileName) { + _testMarkupFileName = testMarkupFileName; + } + + void setTestCase(int testCase) { + _testCase = testCase; + } + + void setTestCaseFileName(const char *const testCaseFileName) { + _testCaseFileName = testCaseFileName; + } + + void addBoundsHit(const std::string &variableName, ValidatorBoundsHit boundsHit) { + if (isVariableNameBoundsAnalyzable(variableName)) { + _boundsHitByVariableName[variableName] + = boundsHit.merge(_boundsHitByVariableName[variableName]); + } + } + + std::string getBoundsHitLog() { + std::string result; + for (std::map::iterator i = _boundsHitByVariableName.begin(); + i != _boundsHitByVariableName.end(); + i++) { + result += "\"" + i->first + "\":"; + if (i->second.minHit) + result += " min-value-hit"; + if (i->second.maxHit) + result += " max-value-hit"; + result += "\n"; + } + return result; + } + + std::string getFeaturesLog() { + std::string result; + for (std::set::iterator i = _features.begin(); + i != _features.end(); + i++) { + result += "feature \"" + *i + "\":"; + if (_hitFeatures.count(*i)) + result += " hit"; + result += "\n"; + } + return result; + } + + void writeTestOverviewLog() { + if (!_testOverviewLogFileName.empty()) { + std::string fileName(_testOverviewLogFileName); + _testOverviewLogFileName = ""; + FILE *testOverviewLogFile = fopen(fileName.c_str(), "w"); + if (NULL == testOverviewLogFile) + __testlib_fail("Validator::writeTestOverviewLog: can't write test overview log to (" + fileName + ")"); + fprintf(testOverviewLogFile, "%s%s", getBoundsHitLog().c_str(), getFeaturesLog().c_str()); + if (fclose(testOverviewLogFile)) + __testlib_fail( + "Validator::writeTestOverviewLog: can't close test overview log file (" + fileName + ")"); + } + } + + void writeTestMarkup() { + if (!_testMarkupFileName.empty()) { + std::vector readChars = inf.getReadChars(); + if (!readChars.empty()) { + std::string markup(TEST_MARKUP_HEADER); + for (size_t i = 0; i < readChars.size(); i++) { + int c = readChars[i]; + if (i + 1 == readChars.size() && c == -1) + continue; + if (c <= 256) { + char cc = char(c); + if (cc == '\\' || cc == '!') + markup += '\\'; + markup += cc; + } else { + markup += TEST_CASE_OPEN_TAG; + markup += toString(c - 256); + markup += TEST_CASE_CLOSE_TAG; + } + } + FILE* f; + bool standard_file = false; + if (_testMarkupFileName == "stdout") + f = stdout, standard_file = true; + else if (_testMarkupFileName == "stderr") + f = stderr, standard_file = true; + else { + f = fopen(_testMarkupFileName.c_str(), "wb"); + if (NULL == f) + __testlib_fail("Validator::writeTestMarkup: can't write test markup to (" + _testMarkupFileName + ")"); + } + std::fprintf(f, "%s", markup.c_str()); + std::fflush(f); + if (!standard_file) + if (std::fclose(f)) + __testlib_fail("Validator::writeTestMarkup: can't close test markup file (" + _testCaseFileName + ")"); + } + } + } + + void writeTestCase() { + if (_testCase > 0) { + std::vector readChars = inf.getReadChars(); + if (!readChars.empty()) { + std::string content, testCaseContent; + bool matchedTestCase = false; + for (size_t i = 0; i < readChars.size(); i++) { + int c = readChars[i]; + if (i + 1 == readChars.size() && c == -1) + continue; + if (c <= 256) + content += char(c); + else { + if (matchedTestCase) { + testCaseContent = content; + matchedTestCase = false; + } + content = ""; + int testCase = c - 256; + if (testCase == _testCase) + matchedTestCase = true; + } + } + if (matchedTestCase) + testCaseContent = content; + + if (!testCaseContent.empty()) { + FILE* f; + bool standard_file = false; + if (_testCaseFileName.empty() || _testCaseFileName == "stdout") + f = stdout, standard_file = true; + else if (_testCaseFileName == "stderr") + f = stderr, standard_file = true; + else { + f = fopen(_testCaseFileName.c_str(), "wb"); + if (NULL == f) + __testlib_fail("Validator::writeTestCase: can't write test case to (" + _testCaseFileName + ")"); + } + std::fprintf(f, "%s", testCaseContent.c_str()); + std::fflush(f); + if (!standard_file) + if (std::fclose(f)) + __testlib_fail("Validator::writeTestCase: can't close test case file (" + _testCaseFileName + ")"); + } + } + } + } + + void addFeature(const std::string &feature) { + if (_features.count(feature)) + __testlib_fail("Feature " + feature + " registered twice."); + if (!isFeatureNameAnalyzable(feature)) + __testlib_fail("Feature name '" + feature + "' contains restricted characters."); + + _features.insert(feature); + } + + void feature(const std::string &feature) { + if (!isFeatureNameAnalyzable(feature)) + __testlib_fail("Feature name '" + feature + "' contains restricted characters."); + + if (!_features.count(feature)) + __testlib_fail("Feature " + feature + " didn't registered via addFeature(feature)."); + + _hitFeatures.insert(feature); + } +} validator; + +const std::string Validator::TEST_MARKUP_HEADER = "MU\xF3\x01"; +const std::string Validator::TEST_CASE_OPEN_TAG = "!c"; +const std::string Validator::TEST_CASE_CLOSE_TAG = ";"; + +struct TestlibFinalizeGuard { + static bool alive; + static bool registered; + + int quitCount, readEofCount; + + TestlibFinalizeGuard() : quitCount(0), readEofCount(0) { + // No operations. + } + + ~TestlibFinalizeGuard() { + bool _alive = alive; + alive = false; + + if (_alive) { + if (testlibMode == _checker && quitCount == 0) + __testlib_fail("Checker must end with quit or quitf call."); + + if (testlibMode == _validator && readEofCount == 0 && quitCount == 0) + __testlib_fail("Validator must end with readEof call."); + + /* opts */ + autoEnsureNoUnusedOpts(); + + if (!registered) + __testlib_fail("Call register-function in the first line of the main (registerTestlibCmd or other similar)"); + } + + if (__testlib_exitCode == 0) { + validator.writeTestOverviewLog(); + validator.writeTestMarkup(); + validator.writeTestCase(); + } + } + +private: + /* opts */ + void autoEnsureNoUnusedOpts(); +}; + +bool TestlibFinalizeGuard::alive = true; +bool TestlibFinalizeGuard::registered = false; +extern TestlibFinalizeGuard testlibFinalizeGuard; + +/* + * Call it to disable checks on finalization. + */ +void disableFinalizeGuard() { + TestlibFinalizeGuard::alive = false; +} + +/* Interactor streams. + */ +std::fstream tout; + +/* implementation + */ + +InStream::InStream() { + reader = NULL; + lastLine = -1; + opened = false; + name = ""; + mode = _input; + strict = false; + stdfile = false; + wordReserveSize = 4; + readManyIteration = NO_INDEX; + maxFileSize = 128 * 1024 * 1024; // 128MB. + maxTokenLength = 32 * 1024 * 1024; // 32MB. + maxMessageLength = 32000; +} + +InStream::InStream(const InStream &baseStream, std::string content) { + reader = new StringInputStreamReader(content); + lastLine = -1; + opened = true; + strict = baseStream.strict; + stdfile = false; + mode = baseStream.mode; + name = "based on " + baseStream.name; + readManyIteration = NO_INDEX; + maxFileSize = 128 * 1024 * 1024; // 128MB. + maxTokenLength = 32 * 1024 * 1024; // 32MB. + maxMessageLength = 32000; +} + +InStream::~InStream() { + if (NULL != reader) { + reader->close(); + delete reader; + reader = NULL; + } +} + +void InStream::setTestCase(int testCase) { + if (testlibMode != _validator || mode != _input || !stdfile || this != &inf) + __testlib_fail("InStream::setTestCase can be used only for inf in validator-mode." + " Actually, prefer setTestCase function instead of InStream member"); + reader->setTestCase(testCase); +} + +std::vector InStream::getReadChars() { + if (testlibMode != _validator || mode != _input || !stdfile || this != &inf) + __testlib_fail("InStream::getReadChars can be used only for inf in validator-mode."); + return reader == NULL ? std::vector() : reader->getReadChars(); +} + +void setTestCase(int testCase) { + static bool first_run = true; + static bool zero_based = false; + + if (first_run && testCase == 0) + zero_based = true; + + if (zero_based) + testCase++; + + __testlib_hasTestCase = true; + __testlib_testCase = testCase; + + if (testlibMode == _validator) + inf.setTestCase(testCase); + + first_run = false; +} + +#ifdef __GNUC__ +__attribute__((const)) +#endif +int resultExitCode(TResult r) { + if (r == _ok) + return OK_EXIT_CODE; + if (r == _wa) + return WA_EXIT_CODE; + if (r == _pe) + return PE_EXIT_CODE; + if (r == _fail) + return FAIL_EXIT_CODE; + if (r == _dirt) + return DIRT_EXIT_CODE; + if (r == _points) + return POINTS_EXIT_CODE; + if (r == _unexpected_eof) +#ifdef ENABLE_UNEXPECTED_EOF + return UNEXPECTED_EOF_EXIT_CODE; +#else + return PE_EXIT_CODE; +#endif + if (r >= _partially) + return PC_BASE_EXIT_CODE + (r - _partially); + return FAIL_EXIT_CODE; +} + +void InStream::textColor( +#if !(defined(ON_WINDOWS) && (!defined(_MSC_VER) || _MSC_VER > 1400)) && defined(__GNUC__) + __attribute__((unused)) +#endif + WORD color +) { +#if defined(ON_WINDOWS) && (!defined(_MSC_VER) || _MSC_VER > 1400) + HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE); + SetConsoleTextAttribute(handle, color); +#endif +#if !defined(ON_WINDOWS) && defined(__GNUC__) + if (isatty(2)) + { + switch (color) + { + case LightRed: + fprintf(stderr, "\033[1;31m"); + break; + case LightCyan: + fprintf(stderr, "\033[1;36m"); + break; + case LightGreen: + fprintf(stderr, "\033[1;32m"); + break; + case LightYellow: + fprintf(stderr, "\033[1;33m"); + break; + case LightGray: + default: + fprintf(stderr, "\033[0m"); + } + } +#endif +} + +#ifdef TESTLIB_THROW_EXIT_EXCEPTION_INSTEAD_OF_EXIT +class exit_exception: public std::exception { +private: + int exitCode; +public: + exit_exception(int exitCode): exitCode(exitCode) {} + int getExitCode() { return exitCode; } +}; +#endif + +NORETURN void halt(int exitCode) { +#ifdef FOOTER + InStream::textColor(InStream::LightGray); + std::fprintf(stderr, "Checker: \"%s\"\n", checkerName.c_str()); + std::fprintf(stderr, "Exit code: %d\n", exitCode); + InStream::textColor(InStream::LightGray); +#endif + __testlib_exitCode = exitCode; +#ifdef TESTLIB_THROW_EXIT_EXCEPTION_INSTEAD_OF_EXIT + throw exit_exception(exitCode); +#endif + std::exit(exitCode); +} + +static bool __testlib_shouldCheckDirt(TResult result) { + return result == _ok || result == _points || result >= _partially; +} + +static std::string __testlib_appendMessage(const std::string &message, const std::string &extra) { + int openPos = -1, closePos = -1; + for (size_t i = 0; i < message.length(); i++) { + if (message[i] == InStream::OPEN_BRACKET) { + if (openPos == -1) + openPos = int(i); + else + openPos = INT_MAX; + } + if (message[i] == InStream::CLOSE_BRACKET) { + if (closePos == -1) + closePos = int(i); + else + closePos = INT_MAX; + } + } + if (openPos != -1 && openPos != INT_MAX + && closePos != -1 && closePos != INT_MAX + && openPos < closePos) { + size_t index = message.find(extra, openPos); + if (index == std::string::npos || int(index) >= closePos) { + std::string result(message); + result.insert(closePos, ", " + extra); + return result; + } + return message; + } + + return message + " " + InStream::OPEN_BRACKET + extra + InStream::CLOSE_BRACKET; +} + +static std::string __testlib_toPrintableMessage(const std::string &message) { + int openPos = -1, closePos = -1; + for (size_t i = 0; i < message.length(); i++) { + if (message[i] == InStream::OPEN_BRACKET) { + if (openPos == -1) + openPos = int(i); + else + openPos = INT_MAX; + } + if (message[i] == InStream::CLOSE_BRACKET) { + if (closePos == -1) + closePos = int(i); + else + closePos = INT_MAX; + } + } + if (openPos != -1 && openPos != INT_MAX + && closePos != -1 && closePos != INT_MAX + && openPos < closePos) { + std::string result(message); + result[openPos] = '('; + result[closePos] = ')'; + return result; + } + + return message; +} + +NORETURN void InStream::quit(TResult result, const char *msg) { + if (TestlibFinalizeGuard::alive) + testlibFinalizeGuard.quitCount++; + + std::string message(msg); + message = trim(message); + + if (__testlib_hasTestCase) { + if (result != _ok) + message = __testlib_appendMessage(message, "test case " + vtos(__testlib_testCase)); + else { + if (__testlib_testCase == 1) + message = __testlib_appendMessage(message, vtos(__testlib_testCase) + " test case"); + else + message = __testlib_appendMessage(message, vtos(__testlib_testCase) + " test cases"); + } + } + + // You can change maxMessageLength. + // Example: 'inf.maxMessageLength = 1024 * 1024;'. + if (message.length() > maxMessageLength) { + std::string warn = "message length exceeds " + vtos(maxMessageLength) + + ", the message is truncated: "; + message = warn + message.substr(0, maxMessageLength - warn.length()); + } + +#ifndef ENABLE_UNEXPECTED_EOF + if (result == _unexpected_eof) + result = _pe; +#endif + + if (testlibMode == _scorer && result != _fail) + quits(_fail, "Scorer should return points only. Don't use a quit function."); + + if (mode != _output && result != _fail) { + if (mode == _input && testlibMode == _validator && lastLine != -1) + quits(_fail, __testlib_appendMessage(__testlib_appendMessage(message, name), "line " + vtos(lastLine))); + else + quits(_fail, __testlib_appendMessage(message, name)); + } + + std::FILE *resultFile; + std::string errorName; + + if (__testlib_shouldCheckDirt(result)) { + if (testlibMode != _interactor && !ouf.seekEof()) + quit(_dirt, "Extra information in the output file"); + } + + int pctype = result - _partially; + bool isPartial = false; + + switch (result) { + case _ok: + errorName = "ok "; + quitscrS(LightGreen, errorName); + break; + case _wa: + errorName = "wrong answer "; + quitscrS(LightRed, errorName); + break; + case _pe: + errorName = "wrong output format "; + quitscrS(LightRed, errorName); + break; + case _fail: + errorName = "FAIL "; + quitscrS(LightRed, errorName); + break; + case _dirt: + errorName = "wrong output format "; + quitscrS(LightCyan, errorName); + result = _pe; + break; + case _points: + errorName = "points "; + quitscrS(LightYellow, errorName); + break; + case _unexpected_eof: + errorName = "unexpected eof "; + quitscrS(LightCyan, errorName); + break; + default: + if (result >= _partially) { + errorName = format("partially correct (%d) ", pctype); + isPartial = true; + quitscrS(LightYellow, errorName); + } else + quit(_fail, "What is the code ??? "); + } + + if (resultName != "") { + resultFile = std::fopen(resultName.c_str(), "w"); + if (resultFile == NULL) { + resultName = ""; + quit(_fail, "Can not write to the result file"); + } + if (appesMode) { + std::fprintf(resultFile, ""); + if (isPartial) + std::fprintf(resultFile, "", + outcomes[(int) _partially].c_str(), pctype); + else { + if (result != _points) + std::fprintf(resultFile, "", outcomes[(int) result].c_str()); + else { + if (__testlib_points == std::numeric_limits::infinity()) + quit(_fail, "Expected points, but infinity found"); + std::string stringPoints = removeDoubleTrailingZeroes(format("%.10f", __testlib_points)); + std::fprintf(resultFile, "", + outcomes[(int) result].c_str(), stringPoints.c_str()); + } + } + xmlSafeWrite(resultFile, __testlib_toPrintableMessage(message).c_str()); + std::fprintf(resultFile, "\n"); + } else + std::fprintf(resultFile, "%s", __testlib_toPrintableMessage(message).c_str()); + if (NULL == resultFile || fclose(resultFile) != 0) { + resultName = ""; + quit(_fail, "Can not write to the result file"); + } + } + + quitscr(LightGray, __testlib_toPrintableMessage(message).c_str()); + std::fprintf(stderr, "\n"); + + inf.close(); + ouf.close(); + ans.close(); + if (tout.is_open()) + tout.close(); + + textColor(LightGray); + + if (resultName != "") + std::fprintf(stderr, "See file to check exit message\n"); + + halt(resultExitCode(result)); +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 3, 4))) +#endif +NORETURN void InStream::quitf(TResult result, const char *msg, ...) { + FMT_TO_RESULT(msg, msg, message); + InStream::quit(result, message.c_str()); +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +void InStream::quitif(bool condition, TResult result, const char *msg, ...) { + if (condition) { + FMT_TO_RESULT(msg, msg, message); + InStream::quit(result, message.c_str()); + } +} + +NORETURN void InStream::quits(TResult result, std::string msg) { + InStream::quit(result, msg.c_str()); +} + +void InStream::xmlSafeWrite(std::FILE *file, const char *msg) { + size_t lmsg = strlen(msg); + for (size_t i = 0; i < lmsg; i++) { + if (msg[i] == '&') { + std::fprintf(file, "%s", "&"); + continue; + } + if (msg[i] == '<') { + std::fprintf(file, "%s", "<"); + continue; + } + if (msg[i] == '>') { + std::fprintf(file, "%s", ">"); + continue; + } + if (msg[i] == '"') { + std::fprintf(file, "%s", """); + continue; + } + if (0 <= msg[i] && msg[i] <= 31) { + std::fprintf(file, "%c", '.'); + continue; + } + std::fprintf(file, "%c", msg[i]); + } +} + +void InStream::quitscrS(WORD color, std::string msg) { + quitscr(color, msg.c_str()); +} + +void InStream::quitscr(WORD color, const char *msg) { + if (resultName == "") { + textColor(color); + std::fprintf(stderr, "%s", msg); + textColor(LightGray); + } +} + +void InStream::reset(std::FILE *file) { + if (opened && stdfile) + quit(_fail, "Can't reset standard handle"); + + if (opened) + close(); + + if (!stdfile && NULL == file) + if (NULL == (file = std::fopen(name.c_str(), "rb"))) { + if (mode == _output) + quits(_pe, std::string("Output file not found: \"") + name + "\""); + + if (mode == _answer) + quits(_fail, std::string("Answer file not found: \"") + name + "\""); + } + + if (NULL != file) { + opened = true; + __testlib_set_binary(file); + + if (stdfile) + reader = new FileInputStreamReader(file, name); + else + reader = new BufferedFileInputStreamReader(file, name); + } else { + opened = false; + reader = NULL; + } +} + +void InStream::init(std::string fileName, TMode mode) { + opened = false; + name = fileName; + stdfile = false; + this->mode = mode; + + std::ifstream stream; + stream.open(fileName.c_str(), std::ios::in); + if (stream.is_open()) { + std::streampos start = stream.tellg(); + stream.seekg(0, std::ios::end); + std::streampos end = stream.tellg(); + size_t fileSize = size_t(end - start); + stream.close(); + + // You can change maxFileSize. + // Example: 'inf.maxFileSize = 256 * 1024 * 1024;'. + if (fileSize > maxFileSize) + quitf(_pe, "File size exceeds %d bytes, size is %d", int(maxFileSize), int(fileSize)); + } + + reset(); + skipBom(); +} + +void InStream::init(std::FILE *f, TMode mode) { + opened = false; + name = "untitled"; + this->mode = mode; + + if (f == stdin) + name = "stdin", stdfile = true; + if (f == stdout) + name = "stdout", stdfile = true; + if (f == stderr) + name = "stderr", stdfile = true; + + reset(f); + skipBom(); +} + +void InStream::skipBom() { + const std::string utf8Bom = "\xEF\xBB\xBF"; + size_t index = 0; + while (index < utf8Bom.size() && curChar() == utf8Bom[index]) { + index++; + skipChar(); + } + if (index < utf8Bom.size()) { + while (index != 0) { + unreadChar(utf8Bom[index - 1]); + index--; + } + } +} + +char InStream::curChar() { + return char(reader->curChar()); +} + +char InStream::nextChar() { + return char(reader->nextChar()); +} + +char InStream::readChar() { + return nextChar(); +} + +char InStream::readChar(char c) { + lastLine = reader->getLine(); + char found = readChar(); + if (c != found) { + if (!isEoln(found)) + quit(_pe, ("Unexpected character '" + std::string(1, found) + "', but '" + std::string(1, c) + + "' expected").c_str()); + else + quit(_pe, ("Unexpected character " + ("#" + vtos(int(found))) + ", but '" + std::string(1, c) + + "' expected").c_str()); + } + return found; +} + +char InStream::readSpace() { + return readChar(' '); +} + +void InStream::unreadChar(char c) { + reader->unreadChar(c); +} + +void InStream::skipChar() { + reader->skipChar(); +} + +void InStream::skipBlanks() { + while (isBlanks(reader->curChar())) + reader->skipChar(); +} + +std::string InStream::readWord() { + readWordTo(_tmpReadToken); + return _tmpReadToken; +} + +void InStream::readWordTo(std::string &result) { + if (!strict) + skipBlanks(); + + lastLine = reader->getLine(); + int cur = reader->nextChar(); + + if (cur == EOFC) + quit(_unexpected_eof, "Unexpected end of file - token expected"); + + if (isBlanks(cur)) + quit(_pe, "Unexpected white-space - token expected"); + + result.clear(); + + while (!(isBlanks(cur) || cur == EOFC)) { + result += char(cur); + + // You can change maxTokenLength. + // Example: 'inf.maxTokenLength = 128 * 1024 * 1024;'. + if (result.length() > maxTokenLength) + quitf(_pe, "Length of token exceeds %d, token is '%s...'", int(maxTokenLength), + __testlib_part(result).c_str()); + + cur = reader->nextChar(); + } + + reader->unreadChar(cur); + + if (result.length() == 0) + quit(_unexpected_eof, "Unexpected end of file or white-space - token expected"); +} + +std::string InStream::readToken() { + return readWord(); +} + +void InStream::readTokenTo(std::string &result) { + readWordTo(result); +} + +static std::string __testlib_part(const std::string &s) { + std::string t; + for (size_t i = 0; i < s.length(); i++) + if (s[i] != '\0') + t += s[i]; + else + t += '~'; + if (t.length() <= 64) + return t; + else + return t.substr(0, 30) + "..." + t.substr(s.length() - 31, 31); +} + +#define __testlib_readMany(readMany, readOne, typeName, space) \ + if (size < 0) \ + quit(_fail, #readMany ": size should be non-negative."); \ + if (size > 100000000) \ + quit(_fail, #readMany ": size should be at most 100000000."); \ + \ + std::vector result(size); \ + readManyIteration = indexBase; \ + \ + for (int i = 0; i < size; i++) \ + { \ + result[i] = readOne; \ + readManyIteration++; \ + if (strict && space && i + 1 < size) \ + readSpace(); \ + } \ + \ + readManyIteration = NO_INDEX; \ + return result; \ + + +std::string InStream::readWord(const pattern &p, const std::string &variableName) { + readWordTo(_tmpReadToken); + if (!p.matches(_tmpReadToken)) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, + ("Token \"" + __testlib_part(_tmpReadToken) + "\" doesn't correspond to pattern \"" + p.src() + + "\"").c_str()); + else + quit(_wa, ("Token parameter [name=" + variableName + "] equals to \"" + __testlib_part(_tmpReadToken) + + "\", doesn't correspond to pattern \"" + p.src() + "\"").c_str()); + } else { + if (variableName.empty()) + quit(_wa, ("Token element [index=" + vtos(readManyIteration) + "] equals to \"" + + __testlib_part(_tmpReadToken) + "\" doesn't correspond to pattern \"" + p.src() + + "\"").c_str()); + else + quit(_wa, ("Token element " + variableName + "[" + vtos(readManyIteration) + "] equals to \"" + + __testlib_part(_tmpReadToken) + "\", doesn't correspond to pattern \"" + p.src() + + "\"").c_str()); + } + } + return _tmpReadToken; +} + +std::vector +InStream::readWords(int size, const pattern &p, const std::string &variablesName, int indexBase) { + __testlib_readMany(readWords, readWord(p, variablesName), std::string, true); +} + +std::vector InStream::readWords(int size, int indexBase) { + __testlib_readMany(readWords, readWord(), std::string, true); +} + +std::string InStream::readWord(const std::string &ptrn, const std::string &variableName) { + return readWord(pattern(ptrn), variableName); +} + +std::vector +InStream::readWords(int size, const std::string &ptrn, const std::string &variablesName, int indexBase) { + pattern p(ptrn); + __testlib_readMany(readWords, readWord(p, variablesName), std::string, true); +} + +std::string InStream::readToken(const pattern &p, const std::string &variableName) { + return readWord(p, variableName); +} + +std::vector +InStream::readTokens(int size, const pattern &p, const std::string &variablesName, int indexBase) { + __testlib_readMany(readTokens, readToken(p, variablesName), std::string, true); +} + +std::vector InStream::readTokens(int size, int indexBase) { + __testlib_readMany(readTokens, readToken(), std::string, true); +} + +std::string InStream::readToken(const std::string &ptrn, const std::string &variableName) { + return readWord(ptrn, variableName); +} + +std::vector +InStream::readTokens(int size, const std::string &ptrn, const std::string &variablesName, int indexBase) { + pattern p(ptrn); + __testlib_readMany(readTokens, readWord(p, variablesName), std::string, true); +} + +void InStream::readWordTo(std::string &result, const pattern &p, const std::string &variableName) { + readWordTo(result); + if (!p.matches(result)) { + if (variableName.empty()) + quit(_wa, ("Token \"" + __testlib_part(result) + "\" doesn't correspond to pattern \"" + p.src() + + "\"").c_str()); + else + quit(_wa, ("Token parameter [name=" + variableName + "] equals to \"" + __testlib_part(result) + + "\", doesn't correspond to pattern \"" + p.src() + "\"").c_str()); + } +} + +void InStream::readWordTo(std::string &result, const std::string &ptrn, const std::string &variableName) { + return readWordTo(result, pattern(ptrn), variableName); +} + +void InStream::readTokenTo(std::string &result, const pattern &p, const std::string &variableName) { + return readWordTo(result, p, variableName); +} + +void InStream::readTokenTo(std::string &result, const std::string &ptrn, const std::string &variableName) { + return readWordTo(result, ptrn, variableName); +} + +#ifdef __GNUC__ +__attribute__((pure)) +#endif +static inline bool equals(long long integer, const char *s) { + if (integer == LLONG_MIN) + return strcmp(s, "-9223372036854775808") == 0; + + if (integer == 0LL) + return strcmp(s, "0") == 0; + + size_t length = strlen(s); + + if (length == 0) + return false; + + if (integer < 0 && s[0] != '-') + return false; + + if (integer < 0) + s++, length--, integer = -integer; + + if (length == 0) + return false; + + while (integer > 0) { + int digit = int(integer % 10); + + if (s[length - 1] != '0' + digit) + return false; + + length--; + integer /= 10; + } + + return length == 0; +} + +#ifdef __GNUC__ +__attribute__((pure)) +#endif +static inline bool equals(unsigned long long integer, const char *s) { + if (integer == ULLONG_MAX) + return strcmp(s, "18446744073709551615") == 0; + + if (integer == 0ULL) + return strcmp(s, "0") == 0; + + size_t length = strlen(s); + + if (length == 0) + return false; + + while (integer > 0) { + int digit = int(integer % 10); + + if (s[length - 1] != '0' + digit) + return false; + + length--; + integer /= 10; + } + + return length == 0; +} + +static inline double stringToDouble(InStream &in, const char *buffer) { + double retval; + + size_t length = strlen(buffer); + + int minusCount = 0; + int plusCount = 0; + int decimalPointCount = 0; + int digitCount = 0; + int eCount = 0; + + for (size_t i = 0; i < length; i++) { + if (('0' <= buffer[i] && buffer[i] <= '9') || buffer[i] == '.' + || buffer[i] == 'e' || buffer[i] == 'E' + || buffer[i] == '-' || buffer[i] == '+') { + if ('0' <= buffer[i] && buffer[i] <= '9') + digitCount++; + if (buffer[i] == 'e' || buffer[i] == 'E') + eCount++; + if (buffer[i] == '-') + minusCount++; + if (buffer[i] == '+') + plusCount++; + if (buffer[i] == '.') + decimalPointCount++; + } else + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + } + + // If for sure is not a number in standard notation or in e-notation. + if (digitCount == 0 || minusCount > 2 || plusCount > 2 || decimalPointCount > 1 || eCount > 1) + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + char *suffix = new char[length + 1]; + std::memset(suffix, 0, length + 1); + int scanned = std::sscanf(buffer, "%lf%s", &retval, suffix); + bool empty = strlen(suffix) == 0; + delete[] suffix; + + if (scanned == 1 || (scanned == 2 && empty)) { + if (__testlib_isNaN(retval)) + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + return retval; + } else + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found").c_str()); +} + +static inline double stringToDouble(InStream &in, const std::string& buffer) { + for (size_t i = 0; i < buffer.length(); i++) + if (buffer[i] == '\0') + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found (it contains \\0)").c_str()); + return stringToDouble(in, buffer.c_str()); +} + +static inline double stringToStrictDouble(InStream &in, const char *buffer, + int minAfterPointDigitCount, int maxAfterPointDigitCount) { + if (minAfterPointDigitCount < 0) + in.quit(_fail, "stringToStrictDouble: minAfterPointDigitCount should be non-negative."); + + if (minAfterPointDigitCount > maxAfterPointDigitCount) + in.quit(_fail, + "stringToStrictDouble: minAfterPointDigitCount should be less or equal to maxAfterPointDigitCount."); + + double retval; + + size_t length = strlen(buffer); + + if (length == 0 || length > 1000) + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + if (buffer[0] != '-' && (buffer[0] < '0' || buffer[0] > '9')) + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + int pointPos = -1; + for (size_t i = 1; i + 1 < length; i++) { + if (buffer[i] == '.') { + if (pointPos > -1) + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + pointPos = int(i); + } + if (buffer[i] != '.' && (buffer[i] < '0' || buffer[i] > '9')) + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + } + + if (buffer[length - 1] < '0' || buffer[length - 1] > '9') + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + int afterDigitsCount = (pointPos == -1 ? 0 : int(length) - pointPos - 1); + if (afterDigitsCount < minAfterPointDigitCount || afterDigitsCount > maxAfterPointDigitCount) + in.quit(_pe, ("Expected strict double with number of digits after point in range [" + + vtos(minAfterPointDigitCount) + + "," + + vtos(maxAfterPointDigitCount) + + "], but \"" + __testlib_part(buffer) + "\" found").c_str() + ); + + int firstDigitPos = -1; + for (size_t i = 0; i < length; i++) + if (buffer[i] >= '0' && buffer[i] <= '9') { + firstDigitPos = int(i); + break; + } + + if (firstDigitPos > 1 || firstDigitPos == -1) + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + if (buffer[firstDigitPos] == '0' && firstDigitPos + 1 < int(length) + && buffer[firstDigitPos + 1] >= '0' && buffer[firstDigitPos + 1] <= '9') + in.quit(_pe, ("Expected strict double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + char *suffix = new char[length + 1]; + std::memset(suffix, 0, length + 1); + int scanned = std::sscanf(buffer, "%lf%s", &retval, suffix); + bool empty = strlen(suffix) == 0; + delete[] suffix; + + if (scanned == 1 || (scanned == 2 && empty)) { + if (__testlib_isNaN(retval) || __testlib_isInfinite(retval)) + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found").c_str()); + if (buffer[0] == '-' && retval >= 0) + in.quit(_pe, ("Redundant minus in \"" + __testlib_part(buffer) + "\" found").c_str()); + return retval; + } else + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found").c_str()); +} + +static inline double stringToStrictDouble(InStream &in, const std::string& buffer, + int minAfterPointDigitCount, int maxAfterPointDigitCount) { + for (size_t i = 0; i < buffer.length(); i++) + if (buffer[i] == '\0') + in.quit(_pe, ("Expected double, but \"" + __testlib_part(buffer) + "\" found (it contains \\0)").c_str()); + return stringToStrictDouble(in, buffer.c_str(), minAfterPointDigitCount, maxAfterPointDigitCount); +} + +static inline long long stringToLongLong(InStream &in, const char *buffer) { + if (strcmp(buffer, "-9223372036854775808") == 0) + return LLONG_MIN; + + bool minus = false; + size_t length = strlen(buffer); + + if (length > 1 && buffer[0] == '-') + minus = true; + + if (length > 20) + in.quit(_pe, ("Expected integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + long long retval = 0LL; + + int zeroes = 0; + bool processingZeroes = true; + + for (int i = (minus ? 1 : 0); i < int(length); i++) { + if (buffer[i] == '0' && processingZeroes) + zeroes++; + else + processingZeroes = false; + + if (buffer[i] < '0' || buffer[i] > '9') + in.quit(_pe, ("Expected integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + retval = retval * 10 + (buffer[i] - '0'); + } + + if (retval < 0) + in.quit(_pe, ("Expected integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + if ((zeroes > 0 && (retval != 0 || minus)) || zeroes > 1) + in.quit(_pe, ("Expected integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + retval = (minus ? -retval : +retval); + + if (length < 19) + return retval; + + if (equals(retval, buffer)) + return retval; + else + in.quit(_pe, ("Expected int64, but \"" + __testlib_part(buffer) + "\" found").c_str()); +} + +static inline long long stringToLongLong(InStream &in, const std::string& buffer) { + for (size_t i = 0; i < buffer.length(); i++) + if (buffer[i] == '\0') + in.quit(_pe, ("Expected integer, but \"" + __testlib_part(buffer) + "\" found (it contains \\0)").c_str()); + return stringToLongLong(in, buffer.c_str()); +} + +static inline unsigned long long stringToUnsignedLongLong(InStream &in, const char *buffer) { + size_t length = strlen(buffer); + + if (length > 20) + in.quit(_pe, ("Expected unsigned integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + if (length > 1 && buffer[0] == '0') + in.quit(_pe, ("Expected unsigned integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + unsigned long long retval = 0LL; + for (int i = 0; i < int(length); i++) { + if (buffer[i] < '0' || buffer[i] > '9') + in.quit(_pe, ("Expected unsigned integer, but \"" + __testlib_part(buffer) + "\" found").c_str()); + retval = retval * 10 + (buffer[i] - '0'); + } + + if (length < 19) + return retval; + + if (length == 20 && strcmp(buffer, "18446744073709551615") > 0) + in.quit(_pe, ("Expected unsigned int64, but \"" + __testlib_part(buffer) + "\" found").c_str()); + + if (equals(retval, buffer)) + return retval; + else + in.quit(_pe, ("Expected unsigned int64, but \"" + __testlib_part(buffer) + "\" found").c_str()); +} + +static inline long long stringToUnsignedLongLong(InStream &in, const std::string& buffer) { + for (size_t i = 0; i < buffer.length(); i++) + if (buffer[i] == '\0') + in.quit(_pe, ("Expected unsigned integer, but \"" + __testlib_part(buffer) + "\" found (it contains \\0)").c_str()); + return stringToUnsignedLongLong(in, buffer.c_str()); +} + +int InStream::readInteger() { + if (!strict && seekEof()) + quit(_unexpected_eof, "Unexpected end of file - int32 expected"); + + readWordTo(_tmpReadToken); + + long long value = stringToLongLong(*this, _tmpReadToken); + if (value < INT_MIN || value > INT_MAX) + quit(_pe, ("Expected int32, but \"" + __testlib_part(_tmpReadToken) + "\" found").c_str()); + + return int(value); +} + +long long InStream::readLong() { + if (!strict && seekEof()) + quit(_unexpected_eof, "Unexpected end of file - int64 expected"); + + readWordTo(_tmpReadToken); + + return stringToLongLong(*this, _tmpReadToken); +} + +unsigned long long InStream::readUnsignedLong() { + if (!strict && seekEof()) + quit(_unexpected_eof, "Unexpected end of file - int64 expected"); + + readWordTo(_tmpReadToken); + + return stringToUnsignedLongLong(*this, _tmpReadToken); +} + +long long InStream::readLong(long long minv, long long maxv, const std::string &variableName) { + long long result = readLong(); + + if (result < minv || result > maxv) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, ("Integer " + vtos(result) + " violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + + "]").c_str()); + else + quit(_wa, ("Integer parameter [name=" + std::string(variableName) + "] equals to " + vtos(result) + + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + } else { + if (variableName.empty()) + quit(_wa, ("Integer element [index=" + vtos(readManyIteration) + "] equals to " + vtos(result) + + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + else + quit(_wa, + ("Integer element " + std::string(variableName) + "[" + vtos(readManyIteration) + "] equals to " + + vtos(result) + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + } + } + + if (strict && !variableName.empty()) + validator.addBoundsHit(variableName, ValidatorBoundsHit(minv == result, maxv == result)); + + return result; +} + +std::vector +InStream::readLongs(int size, long long minv, long long maxv, const std::string &variablesName, int indexBase) { + __testlib_readMany(readLongs, readLong(minv, maxv, variablesName), long long, true) +} + +std::vector InStream::readLongs(int size, int indexBase) { + __testlib_readMany(readLongs, readLong(), long long, true) +} + +unsigned long long +InStream::readUnsignedLong(unsigned long long minv, unsigned long long maxv, const std::string &variableName) { + unsigned long long result = readUnsignedLong(); + + if (result < minv || result > maxv) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, + ("Unsigned integer " + vtos(result) + " violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + + "]").c_str()); + else + quit(_wa, + ("Unsigned integer parameter [name=" + std::string(variableName) + "] equals to " + vtos(result) + + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + } else { + if (variableName.empty()) + quit(_wa, + ("Unsigned integer element [index=" + vtos(readManyIteration) + "] equals to " + vtos(result) + + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + else + quit(_wa, ("Unsigned integer element " + std::string(variableName) + "[" + vtos(readManyIteration) + + "] equals to " + vtos(result) + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + + "]").c_str()); + } + } + + if (strict && !variableName.empty()) + validator.addBoundsHit(variableName, ValidatorBoundsHit(minv == result, maxv == result)); + + return result; +} + +std::vector InStream::readUnsignedLongs(int size, unsigned long long minv, unsigned long long maxv, + const std::string &variablesName, int indexBase) { + __testlib_readMany(readUnsignedLongs, readUnsignedLong(minv, maxv, variablesName), unsigned long long, true) +} + +std::vector InStream::readUnsignedLongs(int size, int indexBase) { + __testlib_readMany(readUnsignedLongs, readUnsignedLong(), unsigned long long, true) +} + +unsigned long long +InStream::readLong(unsigned long long minv, unsigned long long maxv, const std::string &variableName) { + return readUnsignedLong(minv, maxv, variableName); +} + +int InStream::readInt() { + return readInteger(); +} + +int InStream::readInt(int minv, int maxv, const std::string &variableName) { + int result = readInt(); + + if (result < minv || result > maxv) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, ("Integer " + vtos(result) + " violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + + "]").c_str()); + else + quit(_wa, ("Integer parameter [name=" + std::string(variableName) + "] equals to " + vtos(result) + + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + } else { + if (variableName.empty()) + quit(_wa, ("Integer element [index=" + vtos(readManyIteration) + "] equals to " + vtos(result) + + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + else + quit(_wa, + ("Integer element " + std::string(variableName) + "[" + vtos(readManyIteration) + "] equals to " + + vtos(result) + ", violates the range [" + toHumanReadableString(minv) + ", " + toHumanReadableString(maxv) + "]").c_str()); + } + } + + if (strict && !variableName.empty()) + validator.addBoundsHit(variableName, ValidatorBoundsHit(minv == result, maxv == result)); + + return result; +} + +int InStream::readInteger(int minv, int maxv, const std::string &variableName) { + return readInt(minv, maxv, variableName); +} + +std::vector InStream::readInts(int size, int minv, int maxv, const std::string &variablesName, int indexBase) { + __testlib_readMany(readInts, readInt(minv, maxv, variablesName), int, true) +} + +std::vector InStream::readInts(int size, int indexBase) { + __testlib_readMany(readInts, readInt(), int, true) +} + +std::vector InStream::readIntegers(int size, int minv, int maxv, const std::string &variablesName, int indexBase) { + __testlib_readMany(readIntegers, readInt(minv, maxv, variablesName), int, true) +} + +std::vector InStream::readIntegers(int size, int indexBase) { + __testlib_readMany(readIntegers, readInt(), int, true) +} + +double InStream::readReal() { + if (!strict && seekEof()) + quit(_unexpected_eof, "Unexpected end of file - double expected"); + + return stringToDouble(*this, readWord()); +} + +double InStream::readDouble() { + return readReal(); +} + +double InStream::readReal(double minv, double maxv, const std::string &variableName) { + double result = readReal(); + + if (result < minv || result > maxv) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, ("Double " + vtos(result) + " violates the range [" + vtos(minv) + ", " + vtos(maxv) + + "]").c_str()); + else + quit(_wa, ("Double parameter [name=" + std::string(variableName) + "] equals to " + vtos(result) + + ", violates the range [" + vtos(minv) + ", " + vtos(maxv) + "]").c_str()); + } else { + if (variableName.empty()) + quit(_wa, ("Double element [index=" + vtos(readManyIteration) + "] equals to " + vtos(result) + + ", violates the range [" + vtos(minv) + ", " + vtos(maxv) + "]").c_str()); + else + quit(_wa, + ("Double element " + std::string(variableName) + "[" + vtos(readManyIteration) + "] equals to " + + vtos(result) + ", violates the range [" + vtos(minv) + ", " + vtos(maxv) + "]").c_str()); + } + } + + if (strict && !variableName.empty()) + validator.addBoundsHit(variableName, ValidatorBoundsHit( + doubleDelta(minv, result) < ValidatorBoundsHit::EPS, + doubleDelta(maxv, result) < ValidatorBoundsHit::EPS + )); + + return result; +} + +std::vector +InStream::readReals(int size, double minv, double maxv, const std::string &variablesName, int indexBase) { + __testlib_readMany(readReals, readReal(minv, maxv, variablesName), double, true) +} + +std::vector InStream::readReals(int size, int indexBase) { + __testlib_readMany(readReals, readReal(), double, true) +} + +double InStream::readDouble(double minv, double maxv, const std::string &variableName) { + return readReal(minv, maxv, variableName); +} + +std::vector +InStream::readDoubles(int size, double minv, double maxv, const std::string &variablesName, int indexBase) { + __testlib_readMany(readDoubles, readDouble(minv, maxv, variablesName), double, true) +} + +std::vector InStream::readDoubles(int size, int indexBase) { + __testlib_readMany(readDoubles, readDouble(), double, true) +} + +double InStream::readStrictReal(double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variableName) { + if (!strict && seekEof()) + quit(_unexpected_eof, "Unexpected end of file - strict double expected"); + + double result = stringToStrictDouble(*this, readWord(), minAfterPointDigitCount, maxAfterPointDigitCount); + + if (result < minv || result > maxv) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, ("Strict double " + vtos(result) + " violates the range [" + vtos(minv) + ", " + vtos(maxv) + + "]").c_str()); + else + quit(_wa, + ("Strict double parameter [name=" + std::string(variableName) + "] equals to " + vtos(result) + + ", violates the range [" + vtos(minv) + ", " + vtos(maxv) + "]").c_str()); + } else { + if (variableName.empty()) + quit(_wa, ("Strict double element [index=" + vtos(readManyIteration) + "] equals to " + vtos(result) + + ", violates the range [" + vtos(minv) + ", " + vtos(maxv) + "]").c_str()); + else + quit(_wa, ("Strict double element " + std::string(variableName) + "[" + vtos(readManyIteration) + + "] equals to " + vtos(result) + ", violates the range [" + vtos(minv) + ", " + vtos(maxv) + + "]").c_str()); + } + } + + if (strict && !variableName.empty()) + validator.addBoundsHit(variableName, ValidatorBoundsHit( + doubleDelta(minv, result) < ValidatorBoundsHit::EPS, + doubleDelta(maxv, result) < ValidatorBoundsHit::EPS + )); + + return result; +} + +std::vector InStream::readStrictReals(int size, double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variablesName, int indexBase) { + __testlib_readMany(readStrictReals, + readStrictReal(minv, maxv, minAfterPointDigitCount, maxAfterPointDigitCount, variablesName), + double, true) +} + +double InStream::readStrictDouble(double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variableName) { + return readStrictReal(minv, maxv, + minAfterPointDigitCount, maxAfterPointDigitCount, + variableName); +} + +std::vector InStream::readStrictDoubles(int size, double minv, double maxv, + int minAfterPointDigitCount, int maxAfterPointDigitCount, + const std::string &variablesName, int indexBase) { + __testlib_readMany(readStrictDoubles, + readStrictDouble(minv, maxv, minAfterPointDigitCount, maxAfterPointDigitCount, variablesName), + double, true) +} + +bool InStream::eof() { + if (!strict && NULL == reader) + return true; + + return reader->eof(); +} + +bool InStream::seekEof() { + if (!strict && NULL == reader) + return true; + skipBlanks(); + return eof(); +} + +bool InStream::eoln() { + if (!strict && NULL == reader) + return true; + + int c = reader->nextChar(); + + if (!strict) { + if (c == EOFC) + return true; + + if (c == CR) { + c = reader->nextChar(); + + if (c != LF) { + reader->unreadChar(c); + reader->unreadChar(CR); + return false; + } else + return true; + } + + if (c == LF) + return true; + + reader->unreadChar(c); + return false; + } else { + bool returnCr = false; + +#if (defined(ON_WINDOWS) && !defined(FOR_LINUX)) || defined(FOR_WINDOWS) + if (c != CR) { + reader->unreadChar(c); + return false; + } else { + if (!returnCr) + returnCr = true; + c = reader->nextChar(); + } +#endif + if (c != LF) { + reader->unreadChar(c); + if (returnCr) + reader->unreadChar(CR); + return false; + } + + return true; + } +} + +void InStream::readEoln() { + lastLine = reader->getLine(); + if (!eoln()) + quit(_pe, "Expected EOLN"); +} + +void InStream::readEof() { + lastLine = reader->getLine(); + if (!eof()) + quit(_pe, "Expected EOF"); + + if (TestlibFinalizeGuard::alive && this == &inf) + testlibFinalizeGuard.readEofCount++; +} + +bool InStream::seekEoln() { + if (!strict && NULL == reader) + return true; + + int cur; + do { + cur = reader->nextChar(); + } while (cur == SPACE || cur == TAB); + + reader->unreadChar(cur); + return eoln(); +} + +void InStream::nextLine() { + readLine(); +} + +void InStream::readStringTo(std::string &result) { + if (NULL == reader) + quit(_pe, "Expected line"); + + result.clear(); + + for (;;) { + int cur = reader->curChar(); + + if (cur == LF || cur == EOFC) + break; + + if (cur == CR) { + cur = reader->nextChar(); + if (reader->curChar() == LF) { + reader->unreadChar(cur); + break; + } + } + + lastLine = reader->getLine(); + result += char(reader->nextChar()); + } + + if (strict) + readEoln(); + else + eoln(); +} + +std::string InStream::readString() { + readStringTo(_tmpReadToken); + return _tmpReadToken; +} + +std::vector InStream::readStrings(int size, int indexBase) { + __testlib_readMany(readStrings, readString(), std::string, false) +} + +void InStream::readStringTo(std::string &result, const pattern &p, const std::string &variableName) { + readStringTo(result); + if (!p.matches(result)) { + if (readManyIteration == NO_INDEX) { + if (variableName.empty()) + quit(_wa, ("Line \"" + __testlib_part(result) + "\" doesn't correspond to pattern \"" + p.src() + + "\"").c_str()); + else + quit(_wa, ("Line [name=" + variableName + "] equals to \"" + __testlib_part(result) + + "\", doesn't correspond to pattern \"" + p.src() + "\"").c_str()); + } else { + if (variableName.empty()) + quit(_wa, + ("Line element [index=" + vtos(readManyIteration) + "] equals to \"" + __testlib_part(result) + + "\" doesn't correspond to pattern \"" + p.src() + "\"").c_str()); + else + quit(_wa, + ("Line element " + std::string(variableName) + "[" + vtos(readManyIteration) + "] equals to \"" + + __testlib_part(result) + "\", doesn't correspond to pattern \"" + p.src() + "\"").c_str()); + } + } +} + +void InStream::readStringTo(std::string &result, const std::string &ptrn, const std::string &variableName) { + readStringTo(result, pattern(ptrn), variableName); +} + +std::string InStream::readString(const pattern &p, const std::string &variableName) { + readStringTo(_tmpReadToken, p, variableName); + return _tmpReadToken; +} + +std::vector +InStream::readStrings(int size, const pattern &p, const std::string &variablesName, int indexBase) { + __testlib_readMany(readStrings, readString(p, variablesName), std::string, false) +} + +std::string InStream::readString(const std::string &ptrn, const std::string &variableName) { + readStringTo(_tmpReadToken, ptrn, variableName); + return _tmpReadToken; +} + +std::vector +InStream::readStrings(int size, const std::string &ptrn, const std::string &variablesName, int indexBase) { + pattern p(ptrn); + __testlib_readMany(readStrings, readString(p, variablesName), std::string, false) +} + +void InStream::readLineTo(std::string &result) { + readStringTo(result); +} + +std::string InStream::readLine() { + return readString(); +} + +std::vector InStream::readLines(int size, int indexBase) { + __testlib_readMany(readLines, readString(), std::string, false) +} + +void InStream::readLineTo(std::string &result, const pattern &p, const std::string &variableName) { + readStringTo(result, p, variableName); +} + +void InStream::readLineTo(std::string &result, const std::string &ptrn, const std::string &variableName) { + readStringTo(result, ptrn, variableName); +} + +std::string InStream::readLine(const pattern &p, const std::string &variableName) { + return readString(p, variableName); +} + +std::vector +InStream::readLines(int size, const pattern &p, const std::string &variablesName, int indexBase) { + __testlib_readMany(readLines, readString(p, variablesName), std::string, false) +} + +std::string InStream::readLine(const std::string &ptrn, const std::string &variableName) { + return readString(ptrn, variableName); +} + +std::vector +InStream::readLines(int size, const std::string &ptrn, const std::string &variablesName, int indexBase) { + pattern p(ptrn); + __testlib_readMany(readLines, readString(p, variablesName), std::string, false) +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 3, 4))) +#endif +void InStream::ensuref(bool cond, const char *format, ...) { + if (!cond) { + FMT_TO_RESULT(format, format, message); + this->__testlib_ensure(cond, message); + } +} + +void InStream::__testlib_ensure(bool cond, std::string message) { + if (!cond) + this->quit(_wa, message.c_str()); +} + +void InStream::close() { + if (NULL != reader) { + reader->close(); + delete reader; + reader = NULL; + } + + opened = false; +} + +NORETURN void quit(TResult result, const std::string &msg) { + ouf.quit(result, msg.c_str()); +} + +NORETURN void quit(TResult result, const char *msg) { + ouf.quit(result, msg); +} + +NORETURN void __testlib_quitp(double points, const char *message) { + __testlib_points = points; + std::string stringPoints = removeDoubleTrailingZeroes(format("%.10f", points)); + + std::string quitMessage; + if (NULL == message || 0 == strlen(message)) + quitMessage = stringPoints; + else + quitMessage = stringPoints + " " + message; + + quit(_points, quitMessage.c_str()); +} + +NORETURN void __testlib_quitp(int points, const char *message) { + __testlib_points = points; + std::string stringPoints = format("%d", points); + + std::string quitMessage; + if (NULL == message || 0 == strlen(message)) + quitMessage = stringPoints; + else + quitMessage = stringPoints + " " + message; + + quit(_points, quitMessage.c_str()); +} + +NORETURN void quitp(float points, const std::string &message = "") { + __testlib_quitp(double(points), message.c_str()); +} + +NORETURN void quitp(double points, const std::string &message = "") { + __testlib_quitp(points, message.c_str()); +} + +NORETURN void quitp(long double points, const std::string &message = "") { + __testlib_quitp(double(points), message.c_str()); +} + +NORETURN void quitp(int points, const std::string &message = "") { + __testlib_quitp(points, message.c_str()); +} + +NORETURN void quitpi(const std::string &points_info, const std::string &message = "") { + if (points_info.find(' ') != std::string::npos) + quit(_fail, "Parameter 'points_info' can't contain spaces"); + if (message.empty()) + quit(_points, ("points_info=" + points_info).c_str()); + else + quit(_points, ("points_info=" + points_info + " " + message).c_str()); +} + +template +#ifdef __GNUC__ +__attribute__ ((format (printf, 2, 3))) +#endif +NORETURN void quitp(F points, const char *format, ...) { + FMT_TO_RESULT(format, format, message); + quitp(points, message); +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 2, 3))) +#endif +NORETURN void quitf(TResult result, const char *format, ...) { + FMT_TO_RESULT(format, format, message); + quit(result, message); +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 3, 4))) +#endif +void quitif(bool condition, TResult result, const char *format, ...) { + if (condition) { + FMT_TO_RESULT(format, format, message); + quit(result, message); + } +} + +NORETURN void __testlib_help() { + InStream::textColor(InStream::LightCyan); + std::fprintf(stderr, "TESTLIB %s, https://github.com/MikeMirzayanov/testlib/ ", VERSION); + std::fprintf(stderr, "by Mike Mirzayanov, copyright(c) 2005-2020\n"); + std::fprintf(stderr, "Checker name: \"%s\"\n", checkerName.c_str()); + InStream::textColor(InStream::LightGray); + + std::fprintf(stderr, "\n"); + std::fprintf(stderr, "Latest features: \n"); + for (size_t i = 0; i < sizeof(latestFeatures) / sizeof(char *); i++) { + std::fprintf(stderr, "*) %s\n", latestFeatures[i]); + } + std::fprintf(stderr, "\n"); + + std::fprintf(stderr, "Program must be run with the following arguments: \n"); + std::fprintf(stderr, " [--testset testset] [--group group] [ [<-appes>]]\n\n"); + + __testlib_exitCode = FAIL_EXIT_CODE; + std::exit(FAIL_EXIT_CODE); +} + +static void __testlib_ensuresPreconditions() { + // testlib assumes: sizeof(int) = 4. + __TESTLIB_STATIC_ASSERT(sizeof(int) == 4); + + // testlib assumes: INT_MAX == 2147483647. + __TESTLIB_STATIC_ASSERT(INT_MAX == 2147483647); + + // testlib assumes: sizeof(long long) = 8. + __TESTLIB_STATIC_ASSERT(sizeof(long long) == 8); + + // testlib assumes: sizeof(double) = 8. + __TESTLIB_STATIC_ASSERT(sizeof(double) == 8); + + // testlib assumes: no -ffast-math. + if (!__testlib_isNaN(+__testlib_nan())) + quit(_fail, "Function __testlib_isNaN is not working correctly: possible reason is '-ffast-math'"); + if (!__testlib_isNaN(-__testlib_nan())) + quit(_fail, "Function __testlib_isNaN is not working correctly: possible reason is '-ffast-math'"); +} + +std::string __testlib_testset; + +std::string getTestset() { + return __testlib_testset; +} + +std::string __testlib_group; + +std::string getGroup() { + return __testlib_group; +} + +static void __testlib_set_testset_and_group(int argc, char* argv[]) { + for (int i = 1; i < argc; i++) { + if (!strcmp("--testset", argv[i])) { + if (i + 1 < argc && strlen(argv[i + 1]) > 0) + __testlib_testset = argv[++i]; + else + quit(_fail, std::string("Expected non-empty testset after --testset command line parameter")); + } else if (!strcmp("--group", argv[i])) { + if (i + 1 < argc) + __testlib_group = argv[++i]; + else + quit(_fail, std::string("Expected group after --group command line parameter")); + } + } +} + +void registerGen(int argc, char *argv[], int randomGeneratorVersion) { + if (randomGeneratorVersion < 0 || randomGeneratorVersion > 1) + quitf(_fail, "Random generator version is expected to be 0 or 1."); + random_t::version = randomGeneratorVersion; + + __testlib_ensuresPreconditions(); + TestlibFinalizeGuard::registered = true; + + testlibMode = _generator; + __testlib_set_binary(stdin); + rnd.setSeed(argc, argv); + +#if __cplusplus > 199711L || defined(_MSC_VER) + prepareOpts(argc, argv); +#endif +} + +#ifdef USE_RND_AS_BEFORE_087 +void registerGen(int argc, char* argv[]) +{ + registerGen(argc, argv, 0); +} +#else +#ifdef __GNUC__ +#if (__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 4)) +__attribute__ ((deprecated("Use registerGen(argc, argv, 0) or registerGen(argc, argv, 1)." +" The third parameter stands for the random generator version." +" If you are trying to compile old generator use macro -DUSE_RND_AS_BEFORE_087 or registerGen(argc, argv, 0)." +" Version 1 has been released on Spring, 2013. Use it to write new generators."))) +#else +__attribute__ ((deprecated)) +#endif +#endif +#ifdef _MSC_VER +__declspec(deprecated("Use registerGen(argc, argv, 0) or registerGen(argc, argv, 1)." + " The third parameter stands for the random generator version." + " If you are trying to compile old generator use macro -DUSE_RND_AS_BEFORE_087 or registerGen(argc, argv, 0)." + " Version 1 has been released on Spring, 2013. Use it to write new generators.")) +#endif +void registerGen(int argc, char *argv[]) { + std::fprintf(stderr, "Use registerGen(argc, argv, 0) or registerGen(argc, argv, 1)." + " The third parameter stands for the random generator version." + " If you are trying to compile old generator use macro -DUSE_RND_AS_BEFORE_087 or registerGen(argc, argv, 0)." + " Version 1 has been released on Spring, 2013. Use it to write new generators.\n\n"); + registerGen(argc, argv, 0); +} +#endif + +void registerInteraction(int argc, char *argv[]) { + __testlib_ensuresPreconditions(); + __testlib_set_testset_and_group(argc, argv); + TestlibFinalizeGuard::registered = true; + + testlibMode = _interactor; + __testlib_set_binary(stdin); + + if (argc > 1 && !strcmp("--help", argv[1])) + __testlib_help(); + + if (argc < 3 || argc > 6) { + quit(_fail, std::string("Program must be run with the following arguments: ") + + std::string(" [ [ [<-appes>]]]") + + "\nUse \"--help\" to get help information"); + } + + if (argc <= 4) { + resultName = ""; + appesMode = false; + } + +#ifndef EJUDGE + if (argc == 5) { + resultName = argv[4]; + appesMode = false; + } + + if (argc == 6) { + if (strcmp("-APPES", argv[5]) && strcmp("-appes", argv[5])) { + quit(_fail, std::string("Program must be run with the following arguments: ") + + " [ [<-appes>]]"); + } else { + resultName = argv[4]; + appesMode = true; + } + } +#endif + + inf.init(argv[1], _input); + + tout.open(argv[2], std::ios_base::out); + if (tout.fail() || !tout.is_open()) + quit(_fail, std::string("Can not write to the test-output-file '") + argv[2] + std::string("'")); + + ouf.init(stdin, _output); + + if (argc >= 4) + ans.init(argv[3], _answer); + else + ans.name = "unopened answer stream"; +} + +void registerValidation() { + __testlib_ensuresPreconditions(); + TestlibFinalizeGuard::registered = true; + + testlibMode = _validator; + + __testlib_set_binary(stdin); + __testlib_set_binary(stdout); + __testlib_set_binary(stderr); + + inf.init(stdin, _input); + inf.strict = true; +} + +void registerValidation(int argc, char *argv[]) { + registerValidation(); + __testlib_set_testset_and_group(argc, argv); + + validator.initialize(); + TestlibFinalizeGuard::registered = true; + + std::string comment = "Validator must be run with the following arguments:" + " [--testset testset]" + " [--group group]" + " [--testOverviewLogFileName fileName]" + " [--testMarkupFileName fileName]" + " [--testCase testCase]" + " [--testCaseFileName fileName]" + ; + + for (int i = 1; i < argc; i++) { + if (!strcmp("--testset", argv[i])) { + if (i + 1 < argc && strlen(argv[i + 1]) > 0) + validator.setTestset(argv[++i]); + else + quit(_fail, comment); + } + if (!strcmp("--group", argv[i])) { + if (i + 1 < argc) + validator.setGroup(argv[++i]); + else + quit(_fail, comment); + } + if (!strcmp("--testOverviewLogFileName", argv[i])) { + if (i + 1 < argc) + validator.setTestOverviewLogFileName(argv[++i]); + else + quit(_fail, comment); + } + if (!strcmp("--testMarkupFileName", argv[i])) { + if (i + 1 < argc) + validator.setTestMarkupFileName(argv[++i]); + else + quit(_fail, comment); + } + if (!strcmp("--testCase", argv[i])) { + if (i + 1 < argc) { + long long testCase = stringToLongLong(inf, argv[++i]); + if (testCase < 1 || testCase >= __TESTLIB_MAX_TEST_CASE) + quit(_fail, format("Argument testCase should be between 1 and %d, but ", __TESTLIB_MAX_TEST_CASE) + + toString(testCase) + " found"); + validator.setTestCase(int(testCase)); + } else + quit(_fail, comment); + } + if (!strcmp("--testCaseFileName", argv[i])) { + if (i + 1 < argc) { + validator.setTestCaseFileName(argv[++i]); + } else + quit(_fail, comment); + } + } +} + +void addFeature(const std::string &feature) { + if (testlibMode != _validator) + quit(_fail, "Features are supported in validators only."); + validator.addFeature(feature); +} + +void feature(const std::string &feature) { + if (testlibMode != _validator) + quit(_fail, "Features are supported in validators only."); + validator.feature(feature); +} + +class Checker { +private: + bool _initialized; + std::string _testset; + std::string _group; + +public: + Checker() : _initialized(false), _testset("tests"), _group() { + } + + void initialize() { + _initialized = true; + } + + std::string testset() const { + if (!_initialized) + __testlib_fail("Checker should be initialized with registerTestlibCmd(argc, argv) instead of registerTestlibCmd() to support checker.testset()"); + return _testset; + } + + std::string group() const { + if (!_initialized) + __testlib_fail("Checker should be initialized with registerTestlibCmd(argc, argv) instead of registerTestlibCmd() to support checker.group()"); + return _group; + } + + void setTestset(const char *const testset) { + _testset = testset; + } + + void setGroup(const char *const group) { + _group = group; + } +} checker; + +void registerTestlibCmd(int argc, char *argv[]) { + __testlib_ensuresPreconditions(); + __testlib_set_testset_and_group(argc, argv); + TestlibFinalizeGuard::registered = true; + + testlibMode = _checker; + __testlib_set_binary(stdin); + + std::vector args(1, argv[0]); + checker.initialize(); + + for (int i = 1; i < argc; i++) { + if (!strcmp("--testset", argv[i])) { + if (i + 1 < argc && strlen(argv[i + 1]) > 0) + checker.setTestset(argv[++i]); + else + quit(_fail, std::string("Expected testset after --testset command line parameter")); + } else if (!strcmp("--group", argv[i])) { + if (i + 1 < argc) + checker.setGroup(argv[++i]); + else + quit(_fail, std::string("Expected group after --group command line parameter")); + } else + args.push_back(argv[i]); + } + + argc = int(args.size()); + if (argc > 1 && "--help" == args[1]) + __testlib_help(); + + if (argc < 4 || argc > 6) { + quit(_fail, std::string("Program must be run with the following arguments: ") + + std::string("[--testset testset] [--group group] [ [<-appes>]]") + + "\nUse \"--help\" to get help information"); + } + + if (argc == 4) { + resultName = ""; + appesMode = false; + } + + if (argc == 5) { + resultName = args[4]; + appesMode = false; + } + + if (argc == 6) { + if ("-APPES" != args[5] && "-appes" != args[5]) { + quit(_fail, std::string("Program must be run with the following arguments: ") + + " [ [<-appes>]]"); + } else { + resultName = args[4]; + appesMode = true; + } + } + + #ifdef BOCA_SUPPORT + inf.init(argv[3], _input); + ouf.init(argv[1], _output); + ans.init(argv[2], _answer); + #else + inf.init(argv[1], _input); + ouf.init(argv[2], _output); + ans.init(argv[3], _answer); + #endif +} + +void registerTestlib(int argc, ...) { + if (argc < 3 || argc > 5) + quit(_fail, std::string("Program must be run with the following arguments: ") + + " [ [<-appes>]]"); + + char **argv = new char *[argc + 1]; + + va_list ap; + va_start(ap, argc); + argv[0] = NULL; + for (int i = 0; i < argc; i++) { + argv[i + 1] = va_arg(ap, char*); + } + va_end(ap); + + registerTestlibCmd(argc + 1, argv); + delete[] argv; +} + +static inline void __testlib_ensure(bool cond, const std::string &msg) { + if (!cond) + quit(_fail, msg.c_str()); +} + +#ifdef __GNUC__ +__attribute__((unused)) +#endif +static inline void __testlib_ensure(bool cond, const char *msg) { + if (!cond) + quit(_fail, msg); +} + +#define ensure(cond) __testlib_ensure(cond, "Condition failed: \"" #cond "\"") +#define STRINGIZE_DETAIL(x) #x +#define STRINGIZE(x) STRINGIZE_DETAIL(x) +#define ensure_ext(cond) __testlib_ensure(cond, "Line " STRINGIZE(__LINE__) ": Condition failed: \"" #cond "\"") + +#ifdef __GNUC__ +__attribute__ ((format (printf, 2, 3))) +#endif +inline void ensuref(bool cond, const char *format, ...) { + if (!cond) { + FMT_TO_RESULT(format, format, message); + __testlib_ensure(cond, message); + } +} + +NORETURN static void __testlib_fail(const std::string &message) { + quitf(_fail, "%s", message.c_str()); +} + +#ifdef __GNUC__ +__attribute__ ((format (printf, 1, 2))) +#endif +void setName(const char *format, ...) { + FMT_TO_RESULT(format, format, name); + checkerName = name; +} + +/* + * Do not use random_shuffle, because it will produce different result + * for different C++ compilers. + * + * This implementation uses testlib random_t to produce random numbers, so + * it is stable. + */ +template +void shuffle(_RandomAccessIter __first, _RandomAccessIter __last) { + if (__first == __last) return; + for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i) + std::iter_swap(__i, __first + rnd.next(int(__i - __first) + 1)); +} + + +template +#if defined(__GNUC__) && !defined(__clang__) +__attribute__ ((error("Don't use random_shuffle(), use shuffle() instead"))) +#endif +void random_shuffle(_RandomAccessIter, _RandomAccessIter) { + quitf(_fail, "Don't use random_shuffle(), use shuffle() instead"); +} + +#ifdef __GLIBC__ +# define RAND_THROW_STATEMENT throw() +#else +# define RAND_THROW_STATEMENT +#endif + +#if defined(__GNUC__) && !defined(__clang__) + +__attribute__ ((error("Don't use rand(), use rnd.next() instead"))) +#endif +#ifdef _MSC_VER +# pragma warning( disable : 4273 ) +#endif +int rand() RAND_THROW_STATEMENT +{ + quitf(_fail, "Don't use rand(), use rnd.next() instead"); + + /* This line never runs. */ + //throw "Don't use rand(), use rnd.next() instead"; +} + +#if defined(__GNUC__) && !defined(__clang__) + +__attribute__ ((error("Don't use srand(), you should use " +"'registerGen(argc, argv, 1);' to initialize generator seed " +"by hash code of the command line params. The third parameter " +"is randomGeneratorVersion (currently the latest is 1)."))) +#endif +#ifdef _MSC_VER +# pragma warning( disable : 4273 ) +#endif +void srand(unsigned int seed) RAND_THROW_STATEMENT +{ + quitf(_fail, "Don't use srand(), you should use " + "'registerGen(argc, argv, 1);' to initialize generator seed " + "by hash code of the command line params. The third parameter " + "is randomGeneratorVersion (currently the latest is 1) [ignored seed=%u].", seed); +} + +void startTest(int test) { + const std::string testFileName = vtos(test); + if (NULL == freopen(testFileName.c_str(), "wt", stdout)) + __testlib_fail("Unable to write file '" + testFileName + "'"); +} + +inline std::string upperCase(std::string s) { + for (size_t i = 0; i < s.length(); i++) + if ('a' <= s[i] && s[i] <= 'z') + s[i] = char(s[i] - 'a' + 'A'); + return s; +} + +inline std::string lowerCase(std::string s) { + for (size_t i = 0; i < s.length(); i++) + if ('A' <= s[i] && s[i] <= 'Z') + s[i] = char(s[i] - 'A' + 'a'); + return s; +} + +inline std::string compress(const std::string &s) { + return __testlib_part(s); +} + +inline std::string englishEnding(int x) { + x %= 100; + if (x / 10 == 1) + return "th"; + if (x % 10 == 1) + return "st"; + if (x % 10 == 2) + return "nd"; + if (x % 10 == 3) + return "rd"; + return "th"; +} + +template +std::string join(_ForwardIterator first, _ForwardIterator last, _Separator separator) { + std::stringstream ss; + bool repeated = false; + for (_ForwardIterator i = first; i != last; i++) { + if (repeated) + ss << separator; + else + repeated = true; + ss << *i; + } + return ss.str(); +} + +template +std::string join(_ForwardIterator first, _ForwardIterator last) { + return join(first, last, ' '); +} + +template +std::string join(const _Collection &collection, _Separator separator) { + return join(collection.begin(), collection.end(), separator); +} + +template +std::string join(const _Collection &collection) { + return join(collection, ' '); +} + +/** + * Splits string s by character separator returning exactly k+1 items, + * where k is the number of separator occurences. + */ +std::vector split(const std::string &s, char separator) { + std::vector result; + std::string item; + for (size_t i = 0; i < s.length(); i++) + if (s[i] == separator) { + result.push_back(item); + item = ""; + } else + item += s[i]; + result.push_back(item); + return result; +} + +/** + * Splits string s by character separators returning exactly k+1 items, + * where k is the number of separator occurences. + */ +std::vector split(const std::string &s, const std::string &separators) { + if (separators.empty()) + return std::vector(1, s); + + std::vector isSeparator(256); + for (size_t i = 0; i < separators.size(); i++) + isSeparator[(unsigned char) (separators[i])] = true; + + std::vector result; + std::string item; + for (size_t i = 0; i < s.length(); i++) + if (isSeparator[(unsigned char) (s[i])]) { + result.push_back(item); + item = ""; + } else + item += s[i]; + result.push_back(item); + return result; +} + +/** + * Splits string s by character separator returning non-empty items. + */ +std::vector tokenize(const std::string &s, char separator) { + std::vector result; + std::string item; + for (size_t i = 0; i < s.length(); i++) + if (s[i] == separator) { + if (!item.empty()) + result.push_back(item); + item = ""; + } else + item += s[i]; + if (!item.empty()) + result.push_back(item); + return result; +} + +/** + * Splits string s by character separators returning non-empty items. + */ +std::vector tokenize(const std::string &s, const std::string &separators) { + if (separators.empty()) + return std::vector(1, s); + + std::vector isSeparator(256); + for (size_t i = 0; i < separators.size(); i++) + isSeparator[(unsigned char) (separators[i])] = true; + + std::vector result; + std::string item; + for (size_t i = 0; i < s.length(); i++) + if (isSeparator[(unsigned char) (s[i])]) { + if (!item.empty()) + result.push_back(item); + item = ""; + } else + item += s[i]; + + if (!item.empty()) + result.push_back(item); + + return result; +} + +NORETURN void __testlib_expectedButFound(TResult result, std::string expected, std::string found, const char *prepend) { + std::string message; + if (strlen(prepend) != 0) + message = format("%s: expected '%s', but found '%s'", + compress(prepend).c_str(), compress(expected).c_str(), compress(found).c_str()); + else + message = format("expected '%s', but found '%s'", + compress(expected).c_str(), compress(found).c_str()); + quit(result, message); +} + +NORETURN void __testlib_expectedButFound(TResult result, double expected, double found, const char *prepend) { + std::string expectedString = removeDoubleTrailingZeroes(format("%.12f", expected)); + std::string foundString = removeDoubleTrailingZeroes(format("%.12f", found)); + __testlib_expectedButFound(result, expectedString, foundString, prepend); +} + +template +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +NORETURN void expectedButFound(TResult result, T expected, T found, const char *prependFormat = "", ...) { + FMT_TO_RESULT(prependFormat, prependFormat, prepend); + std::string expectedString = vtos(expected); + std::string foundString = vtos(found); + __testlib_expectedButFound(result, expectedString, foundString, prepend.c_str()); +} + +template<> +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +NORETURN void +expectedButFound(TResult result, std::string expected, std::string found, const char *prependFormat, ...) { + FMT_TO_RESULT(prependFormat, prependFormat, prepend); + __testlib_expectedButFound(result, expected, found, prepend.c_str()); +} + +template<> +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +NORETURN void expectedButFound(TResult result, double expected, double found, const char *prependFormat, ...) { + FMT_TO_RESULT(prependFormat, prependFormat, prepend); + std::string expectedString = removeDoubleTrailingZeroes(format("%.12f", expected)); + std::string foundString = removeDoubleTrailingZeroes(format("%.12f", found)); + __testlib_expectedButFound(result, expectedString, foundString, prepend.c_str()); +} + +template<> +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +NORETURN void +expectedButFound(TResult result, const char *expected, const char *found, const char *prependFormat, + ...) { + FMT_TO_RESULT(prependFormat, prependFormat, prepend); + __testlib_expectedButFound(result, std::string(expected), std::string(found), prepend.c_str()); +} + +template<> +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +NORETURN void expectedButFound(TResult result, float expected, float found, const char *prependFormat, ...) { + FMT_TO_RESULT(prependFormat, prependFormat, prepend); + __testlib_expectedButFound(result, double(expected), double(found), prepend.c_str()); +} + +template<> +#ifdef __GNUC__ +__attribute__ ((format (printf, 4, 5))) +#endif +NORETURN void +expectedButFound(TResult result, long double expected, long double found, const char *prependFormat, ...) { + FMT_TO_RESULT(prependFormat, prependFormat, prepend); + __testlib_expectedButFound(result, double(expected), double(found), prepend.c_str()); +} + +#if __cplusplus > 199711L || defined(_MSC_VER) +template +struct is_iterable { + template + static char test(typename U::iterator *x); + + template + static long test(U *x); + + static const bool value = sizeof(test(0)) == 1; +}; + +template +struct __testlib_enable_if { +}; + +template +struct __testlib_enable_if { + typedef T type; +}; + +template +typename __testlib_enable_if::value, void>::type __testlib_print_one(const T &t) { + std::cout << t; +} + +template +typename __testlib_enable_if::value, void>::type __testlib_print_one(const T &t) { + bool first = true; + for (typename T::const_iterator i = t.begin(); i != t.end(); i++) { + if (first) + first = false; + else + std::cout << " "; + std::cout << *i; + } +} + +template<> +typename __testlib_enable_if::value, void>::type +__testlib_print_one(const std::string &t) { + std::cout << t; +} + +template +void __println_range(A begin, B end) { + bool first = true; + for (B i = B(begin); i != end; i++) { + if (first) + first = false; + else + std::cout << " "; + __testlib_print_one(*i); + } + std::cout << std::endl; +} + +template +struct is_iterator { + static T makeT(); + + typedef void *twoptrs[2]; + + static twoptrs &test(...); + + template + static typename R::iterator_category *test(R); + + template + static void *test(R *); + + static const bool value = sizeof(test(makeT())) == sizeof(void *); +}; + +template +struct is_iterator::value>::type> { + static const bool value = false; +}; + +template +typename __testlib_enable_if::value, void>::type println(const A &a, const B &b) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << std::endl; +} + +template +typename __testlib_enable_if::value, void>::type println(const A &a, const B &b) { + __println_range(a, b); +} + +template +void println(const A *a, const A *b) { + __println_range(a, b); +} + +template<> +void println(const char *a, const char *b) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << std::endl; +} + +template +void println(const T &x) { + __testlib_print_one(x); + std::cout << std::endl; +} + +template +void println(const A &a, const B &b, const C &c) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << " "; + __testlib_print_one(c); + std::cout << std::endl; +} + +template +void println(const A &a, const B &b, const C &c, const D &d) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << " "; + __testlib_print_one(c); + std::cout << " "; + __testlib_print_one(d); + std::cout << std::endl; +} + +template +void println(const A &a, const B &b, const C &c, const D &d, const E &e) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << " "; + __testlib_print_one(c); + std::cout << " "; + __testlib_print_one(d); + std::cout << " "; + __testlib_print_one(e); + std::cout << std::endl; +} + +template +void println(const A &a, const B &b, const C &c, const D &d, const E &e, const F &f) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << " "; + __testlib_print_one(c); + std::cout << " "; + __testlib_print_one(d); + std::cout << " "; + __testlib_print_one(e); + std::cout << " "; + __testlib_print_one(f); + std::cout << std::endl; +} + +template +void println(const A &a, const B &b, const C &c, const D &d, const E &e, const F &f, const G &g) { + __testlib_print_one(a); + std::cout << " "; + __testlib_print_one(b); + std::cout << " "; + __testlib_print_one(c); + std::cout << " "; + __testlib_print_one(d); + std::cout << " "; + __testlib_print_one(e); + std::cout << " "; + __testlib_print_one(f); + std::cout << " "; + __testlib_print_one(g); + std::cout << std::endl; +} + +/* opts */ + +/** + * A struct for a singular testlib opt, containing the raw string value, + * and a boolean value for marking whether the opt is used. + */ +struct TestlibOpt { + std::string value; + bool used; + + TestlibOpt() : value(), used(false) {} +}; + +/** + * Get the type of opt based on the number of `-` at the beginning and the + * _validity_ of the key name. + * + * A valid key name must start with an alphabetical character. + * + * Returns: 1 if s has one `-` at the beginning, that is, "-keyName". + * 2 if s has two `-` at the beginning, that is, "--keyName". + * 0 otherwise. That is, if s has no `-` at the beginning, or has more + * than 2 at the beginning ("---keyName", "----keyName", ...), or the + * keyName is invalid (the first character is not an alphabetical + * character). + */ +size_t getOptType(char *s) { + if (!s || strlen(s) <= 1) + return 0; + + if (s[0] == '-') { + if (isalpha(s[1])) + return 1; + else if (s[1] == '-') + return isalpha(s[2]) ? 2 : 0; + } + + return 0; +} + +/** + * Parse the opt at a given index, and put it into the opts maps. + * + * An opt can has the following form: + * 1) -keyName=value or --keyName=value (ex. -n=10 --test-count=20) + * 2) -keyName value or --keyName value (ex. -n 10 --test-count 20) + * 3) -kNumval or --kNumval (ex. -n10 --t20) + * 4) -boolProperty or --boolProperty (ex. -sorted --tree-only) + * + * Only the second form consumes 2 arguments. The other consumes only 1 + * argument. + * + * In the third form, the key is a single character, and after the key is the + * value. The value _should_ be a number. + * + * In the forth form, the value is true. + * + * Params: + * - argc and argv: the number of command line arguments and the command line + * arguments themselves. + * - index: the starting index of the opts. + * - opts: the map containing the resulting opt. + * + * Returns: the number of consumed arguments to parse the opt. + * 0 if there is no arguments to parse. + * + * Algorithm details: + * TODO. Please refer to the implementation to see how the code handles the 3rd and 4th forms separately. + */ +size_t parseOpt(size_t argc, char *argv[], size_t index, std::map &opts) { + if (index >= argc) + return 0; + + size_t type = getOptType(argv[index]), inc = 1; + if (type > 0) { + std::string key(argv[index] + type), val; + size_t sep = key.find('='); + if (sep != std::string::npos) { + val = key.substr(sep + 1); + key = key.substr(0, sep); + } else { + if (index + 1 < argc && getOptType(argv[index + 1]) == 0) { + val = argv[index + 1]; + inc = 2; + } else { + if (key.length() > 1 && isdigit(key[1])) { + val = key.substr(1); + key = key.substr(0, 1); + } else { + val = "true"; + } + } + } + opts[key].value = val; + } else { + return inc; + } + + return inc; +} + +/** + * Global list containing all the arguments in the order given in the command line. + */ +std::vector __testlib_argv; + +/** + * Global dictionary containing all the parsed opts. + */ +std::map __testlib_opts; + +/** + * Whether automatic no unused opts ensurement should be done. This flag will + * be turned on when `has_opt` or `opt(key, default_value)` is called. + * + * The automatic ensurement can be suppressed when + * __testlib_ensureNoUnusedOptsSuppressed is true. + */ +bool __testlib_ensureNoUnusedOptsFlag = false; + +/** + * Suppress no unused opts automatic ensurement. Can be set to true with + * `suppressEnsureNoUnusedOpts()`. + */ +bool __testlib_ensureNoUnusedOptsSuppressed = false; + +/** + * Parse command line arguments into opts. + * The results are stored into __testlib_argv and __testlib_opts. + */ +void prepareOpts(int argc, char *argv[]) { + if (argc <= 0) + __testlib_fail("Opts: expected argc>=0 but found " + toString(argc)); + size_t n = static_cast(argc); // NOLINT(hicpp-use-auto,modernize-use-auto) + __testlib_opts = std::map(); + for (size_t index = 1; index < n; index += parseOpt(n, argv, index, __testlib_opts)); + __testlib_argv = std::vector(n); + for (size_t index = 0; index < n; index++) + __testlib_argv[index] = argv[index]; +} + +/** + * An utility function to get the argument with a given index. This function + * also print a readable message when no arguments are found. + */ +std::string __testlib_indexToArgv(int index) { + if (index < 0 || index >= int(__testlib_argv.size())) + __testlib_fail("Opts: index '" + toString(index) + "' is out of range [0," + + toString(__testlib_argv.size()) + ")"); + return __testlib_argv[size_t(index)]; +} + +/** + * An utility function to get the opt with a given key . This function + * also print a readable message when no opts are found. + */ +std::string __testlib_keyToOpts(const std::string &key) { + auto it = __testlib_opts.find(key); + if (it == __testlib_opts.end()) + __testlib_fail("Opts: unknown key '" + compress(key) + "'"); + it->second.used = true; + return it->second.value; +} + +template +T optValueToIntegral(const std::string &s, bool nonnegative); + +long double optValueToLongDouble(const std::string &s); + +std::string parseExponentialOptValue(const std::string &s) { + size_t pos = std::string::npos; + for (size_t i = 0; i < s.length(); i++) + if (s[i] == 'e' || s[i] == 'E') { + if (pos != std::string::npos) + __testlib_fail("Opts: expected typical exponential notation but '" + compress(s) + "' found"); + pos = i; + } + if (pos == std::string::npos) + return s; + std::string e = s.substr(pos + 1); + if (!e.empty() && e[0] == '+') + e = e.substr(1); + if (e.empty()) + __testlib_fail("Opts: expected typical exponential notation but '" + compress(s) + "' found"); + if (e.length() > 20) + __testlib_fail("Opts: expected typical exponential notation but '" + compress(s) + "' found"); + int ne = optValueToIntegral(e, false); + std::string num = s.substr(0, pos); + if (num.length() > 20) + __testlib_fail("Opts: expected typical exponential notation but '" + compress(s) + "' found"); + if (!num.empty() && num[0] == '+') + num = num.substr(1); + optValueToLongDouble(num); + bool minus = false; + if (num[0] == '-') { + minus = true; + num = num.substr(1); + } + for (int i = 0; i < +ne; i++) { + size_t sep = num.find('.'); + if (sep == std::string::npos) + num += '0'; + else { + if (sep + 1 == num.length()) + num[sep] = '0'; + else + std::swap(num[sep], num[sep + 1]); + } + } + for (int i = 0; i < -ne; i++) { + size_t sep = num.find('.'); + if (sep == std::string::npos) + num.insert(num.begin() + int(num.length()) - 1, '.'); + else { + if (sep == 0) + num.insert(num.begin() + 1, '0'); + else + std::swap(num[sep - 1], num[sep]); + } + } + while (!num.empty() && num[0] == '0') + num = num.substr(1); + while (num.find('.') != std::string::npos && num.back() == '0') + num = num.substr(0, num.length() - 1); + if (!num.empty() && num.back() == '.') + num = num.substr(0, num.length() - 1); + if ((!num.empty() && num[0] == '.') || num.empty()) + num.insert(num.begin(), '0'); + return (minus ? "-" : "") + num; +} + +template +T optValueToIntegral(const std::string &s_, bool nonnegative) { + std::string s(parseExponentialOptValue(s_)); + if (s.empty()) + __testlib_fail("Opts: expected integer but '" + compress(s_) + "' found"); + T value = 0; + long double about = 0.0; + signed char sign = +1; + size_t pos = 0; + if (s[pos] == '-') { + if (nonnegative) + __testlib_fail("Opts: expected non-negative integer but '" + compress(s_) + "' found"); + sign = -1; + pos++; + } + for (size_t i = pos; i < s.length(); i++) { + if (s[i] < '0' || s[i] > '9') + __testlib_fail("Opts: expected integer but '" + compress(s_) + "' found"); + value = value * 10 + s[i] - '0'; + about = about * 10 + s[i] - '0'; + } + value *= sign; + about *= sign; + if (fabsl(value - about) > 0.1) + __testlib_fail("Opts: integer overflow: expected integer but '" + compress(s_) + "' found"); + return value; +} + +long double optValueToLongDouble(const std::string &s_) { + std::string s(parseExponentialOptValue(s_)); + if (s.empty()) + __testlib_fail("Opts: expected float number but '" + compress(s_) + "' found"); + long double value = 0.0; + signed char sign = +1; + size_t pos = 0; + if (s[pos] == '-') { + sign = -1; + pos++; + } + bool period = false; + long double mul = 1.0; + for (size_t i = pos; i < s.length(); i++) { + if (s[i] == '.') { + if (period) + __testlib_fail("Opts: expected float number but '" + compress(s_) + "' found"); + else { + period = true; + continue; + } + } + if (period) + mul *= 10.0; + if (s[i] < '0' || s[i] > '9') + __testlib_fail("Opts: expected float number but '" + compress(s_) + "' found"); + if (period) + value += (s[i] - '0') / mul; + else + value = value * 10 + s[i] - '0'; + } + value *= sign; + return value; +} + +/** + * Return true if there is an opt with a given key. + * + * By calling this function, automatic ensurement for no unused opts will be + * done when the program is finalized. Call suppressEnsureNoUnusedOpts() to + * turn it off. + */ +bool has_opt(const std::string &key) { + __testlib_ensureNoUnusedOptsFlag = true; + return __testlib_opts.count(key) != 0; +} + +/* About the followings part for opt with 2 and 3 arguments. + * + * To parse the argv/opts correctly for a give type (integer, floating point or + * string), some meta programming must be done to determine the type of + * the type, and use the correct parsing function accordingly. + * + * The pseudo algorithm for determining the type of T and parse it accordingly + * is as follows: + * + * if (T is integral type) { + * if (T is unsigned) { + * parse the argv/opt as an **unsigned integer** of type T. + * } else { + * parse the argv/opt as an **signed integer** of type T. + * } else { + * if (T is floating point type) { + * parse the argv/opt as an **floating point** of type T. + * } else { + * // T should be std::string + * just the raw content of the argv/opts. + * } + * } + * + * To help with meta programming, some `opt` function with 2 or 3 arguments are + * defined. + * + * Opt with 3 arguments: T opt(true/false is_integral, true/false is_unsigned, index/key) + * + * + The first argument is for determining whether the type T is an integral + * type. That is, the result of std::is_integral() should be passed to + * this argument. When false, the type _should_ be either floating point or a + * std::string. + * + * + The second argument is for determining whether the signedness of the type + * T (if it is unsigned or signed). That is, the result of + * std::is_unsigned() should be passed to this argument. This argument can + * be ignored if the first one is false, because it only applies to integer. + * + * Opt with 2 arguments: T opt(true/false is_floating_point, index/key) + * + The first argument is for determining whether the type T is a floating + * point type. That is, the result of std::is_floating_point() should be + * passed to this argument. When false, the type _should_ be a std::string. + */ + +template +T opt(std::false_type is_floating_point, int index); + +template<> +std::string opt(std::false_type /*is_floating_point*/, int index) { + return __testlib_indexToArgv(index); +} + +template +T opt(std::true_type /*is_floating_point*/, int index) { + return T(optValueToLongDouble(__testlib_indexToArgv(index))); +} + +template +T opt(std::false_type /*is_integral*/, U /*is_unsigned*/, int index) { + return opt(std::is_floating_point(), index); +} + +template +T opt(std::true_type /*is_integral*/, std::false_type /*is_unsigned*/, int index) { + return optValueToIntegral(__testlib_indexToArgv(index), false); +} + +template +T opt(std::true_type /*is_integral*/, std::true_type /*is_unsigned*/, int index) { + return optValueToIntegral(__testlib_indexToArgv(index), true); +} + +template<> +bool opt(std::true_type /*is_integral*/, std::true_type /*is_unsigned*/, int index) { + std::string value = __testlib_indexToArgv(index); + if (value == "true" || value == "1") + return true; + if (value == "false" || value == "0") + return false; + __testlib_fail("Opts: opt by index '" + toString(index) + "': expected bool true/false or 0/1 but '" + + compress(value) + "' found"); +} + +/** + * Return the parsed argv by a given index. + */ +template +T opt(int index) { + return opt(std::is_integral(), std::is_unsigned(), index); +} + +/** + * Return the raw string value of an argv by a given index. + */ +std::string opt(int index) { + return opt(index); +} + +/** + * Return the parsed argv by a given index. If the index is bigger than + * the number of argv, return the given default_value. + */ +template +T opt(int index, const T &default_value) { + if (index >= int(__testlib_argv.size())) { + return default_value; + } + return opt(index); +} + +/** + * Return the raw string value of an argv by a given index. If the index is + * bigger than the number of argv, return the given default_value. + */ +std::string opt(int index, const std::string &default_value) { + return opt(index, default_value); +} + +template +T opt(std::false_type is_floating_point, const std::string &key); + +template<> +std::string opt(std::false_type /*is_floating_point*/, const std::string &key) { + return __testlib_keyToOpts(key); +} + +template +T opt(std::true_type /*is_integral*/, const std::string &key) { + return T(optValueToLongDouble(__testlib_keyToOpts(key))); +} + +template +T opt(std::false_type /*is_integral*/, U, const std::string &key) { + return opt(std::is_floating_point(), key); +} + +template +T opt(std::true_type /*is_integral*/, std::false_type /*is_unsigned*/, const std::string &key) { + return optValueToIntegral(__testlib_keyToOpts(key), false); +} + +template +T opt(std::true_type /*is_integral*/, std::true_type /*is_unsigned*/, const std::string &key) { + return optValueToIntegral(__testlib_keyToOpts(key), true); +} + +template<> +bool opt(std::true_type /*is_integral*/, std::true_type /*is_unsigned*/, const std::string &key) { + if (!has_opt(key)) + return false; + std::string value = __testlib_keyToOpts(key); + if (value == "true" || value == "1") + return true; + if (value == "false" || value == "0") + return false; + __testlib_fail("Opts: key '" + compress(key) + "': expected bool true/false or 0/1 but '" + + compress(value) + "' found"); +} + +/** + * Return the parsed opt by a given key. + */ +template +T opt(const std::string &key) { + return opt(std::is_integral(), std::is_unsigned(), key); +} + +/** + * Return the raw string value of an opt by a given key + */ +std::string opt(const std::string &key) { + return opt(key); +} + +/* Scorer started. */ + +enum TestResultVerdict { + SKIPPED, + OK, + WRONG_ANSWER, + RUNTIME_ERROR, + TIME_LIMIT_EXCEEDED, + IDLENESS_LIMIT_EXCEEDED, + MEMORY_LIMIT_EXCEEDED, + COMPILATION_ERROR, + CRASHED, + FAILED +}; + +std::string serializeVerdict(TestResultVerdict verdict) { + switch (verdict) { + case SKIPPED: return "SKIPPED"; + case OK: return "OK"; + case WRONG_ANSWER: return "WRONG_ANSWER"; + case RUNTIME_ERROR: return "RUNTIME_ERROR"; + case TIME_LIMIT_EXCEEDED: return "TIME_LIMIT_EXCEEDED"; + case IDLENESS_LIMIT_EXCEEDED: return "IDLENESS_LIMIT_EXCEEDED"; + case MEMORY_LIMIT_EXCEEDED: return "MEMORY_LIMIT_EXCEEDED"; + case COMPILATION_ERROR: return "COMPILATION_ERROR"; + case CRASHED: return "CRASHED"; + case FAILED: return "FAILED"; + } + throw "Unexpected verdict"; +} + +TestResultVerdict deserializeTestResultVerdict(std::string s) { + if (s == "SKIPPED") + return SKIPPED; + else if (s == "OK") + return OK; + else if (s == "WRONG_ANSWER") + return WRONG_ANSWER; + else if (s == "RUNTIME_ERROR") + return RUNTIME_ERROR; + else if (s == "TIME_LIMIT_EXCEEDED") + return TIME_LIMIT_EXCEEDED; + else if (s == "IDLENESS_LIMIT_EXCEEDED") + return IDLENESS_LIMIT_EXCEEDED; + else if (s == "MEMORY_LIMIT_EXCEEDED") + return MEMORY_LIMIT_EXCEEDED; + else if (s == "COMPILATION_ERROR") + return COMPILATION_ERROR; + else if (s == "CRASHED") + return CRASHED; + else if (s == "FAILED") + return FAILED; + ensuref(false, "Unexpected serialized TestResultVerdict"); + // No return actually. + return FAILED; +} + +struct TestResult { + int testIndex; + std::string testset; + std::string group; + TestResultVerdict verdict; + double points; + long long timeConsumed; + long long memoryConsumed; + std::string input; + std::string output; + std::string answer; + int exitCode; + std::string checkerComment; +}; + +std::string serializePoints(double points) { + if (std::isnan(points)) + return ""; + else { + char c[64]; + sprintf(c, "%.03lf", points); + return c; + } +} + +double deserializePoints(std::string s) { + if (s.empty()) + return std::numeric_limits::quiet_NaN(); + else { + double result; + ensuref(sscanf(s.c_str(), "%lf", &result) == 1, "Invalid serialized points"); + return result; + } +} + +std::string escapeTestResultString(std::string s) { + std::string result; + for (size_t i = 0; i < s.length(); i++) { + if (s[i] == '\r') + continue; + if (s[i] == '\n') { + result += "\\n"; + continue; + } + if (s[i] == '\\' || s[i] == ';') + result += '\\'; + result += s[i]; + } + return result; +} + +std::string unescapeTestResultString(std::string s) { + std::string result; + for (size_t i = 0; i < s.length(); i++) { + if (s[i] == '\\' && i + 1 < s.length()) { + if (s[i + 1] == 'n') { + result += '\n'; + i++; + continue; + } else if (s[i + 1] == ';' || s[i + 1] == '\\') { + result += s[i + 1]; + i++; + continue; + } + } + result += s[i]; + } + return result; +} + +std::string serializeTestResult(TestResult tr) { + std::string result; + result += std::to_string(tr.testIndex); + result += ";"; + result += escapeTestResultString(tr.testset); + result += ";"; + result += escapeTestResultString(tr.group); + result += ";"; + result += serializeVerdict(tr.verdict); + result += ";"; + result += serializePoints(tr.points); + result += ";"; + result += std::to_string(tr.timeConsumed); + result += ";"; + result += std::to_string(tr.memoryConsumed); + result += ";"; + result += escapeTestResultString(tr.input); + result += ";"; + result += escapeTestResultString(tr.output); + result += ";"; + result += escapeTestResultString(tr.answer); + result += ";"; + result += std::to_string(tr.exitCode); + result += ";"; + result += escapeTestResultString(tr.checkerComment); + return result; +} + +TestResult deserializeTestResult(std::string s) { + std::vector items; + std::string t; + for (size_t i = 0; i < s.length(); i++) { + if (s[i] == '\\') { + t += s[i]; + if (i + 1 < s.length()) + t += s[i + 1]; + i++; + continue; + } else { + if (s[i] == ';') { + items.push_back(t); + t = ""; + } else + t += s[i]; + } + } + items.push_back(t); + + ensuref(items.size() == 12, "Invalid TestResult serialization: expected exactly 12 items"); + + TestResult tr; + size_t pos = 0; + tr.testIndex = stoi(items[pos++]); + tr.testset = unescapeTestResultString(items[pos++]); + tr.group = unescapeTestResultString(items[pos++]); + tr.verdict = deserializeTestResultVerdict(items[pos++]); + tr.points = deserializePoints(items[pos++]); + tr.timeConsumed = stoll(items[pos++]); + tr.memoryConsumed = stoll(items[pos++]); + tr.input = unescapeTestResultString(items[pos++]); + tr.output = unescapeTestResultString(items[pos++]); + tr.answer = unescapeTestResultString(items[pos++]); + tr.exitCode = stoi(items[pos++]); + tr.checkerComment = unescapeTestResultString(items[pos++]); + + return tr; +} + +std::vector readTestResults(std::string fileName) { + std::ifstream stream; + stream.open(fileName.c_str(), std::ios::in); + ensuref(stream.is_open(), "Can't read test results file '%s'", fileName.c_str()); + std::vector result; + std::string line; + while (getline(stream, line)) + if (!line.empty()) + result.push_back(deserializeTestResult(line)); + stream.close(); + return result; +} + +std::function)> __testlib_scorer; + +struct TestlibScorerGuard { + ~TestlibScorerGuard() { + if (testlibMode == _scorer) { + std::vector testResults; + while (!inf.eof()) { + std::string line = inf.readLine(); + if (!line.empty()) + testResults.push_back(deserializeTestResult(line)); + } + inf.readEof(); + printf("%.3f\n", __testlib_scorer(testResults)); + } + } +} __testlib_scorer_guard; + +void registerScorer(int argc, char *argv[], std::function)> scorer) { + /* Supress unused. */ + (void)(argc), (void)(argv); + + __testlib_ensuresPreconditions(); + + testlibMode = _scorer; + __testlib_set_binary(stdin); + + inf.init(stdin, _input); + inf.strict = false; + + __testlib_scorer = scorer; +} + +/* Scorer ended. */ + +/** + * Return the parsed opt by a given key. If no opts with the given key are + * found, return the given default_value. + * + * By calling this function, automatic ensurement for no unused opts will be + * done when the program is finalized. Call suppressEnsureNoUnusedOpts() to + * turn it off. + */ +template +T opt(const std::string &key, const T &default_value) { + if (!has_opt(key)) { + return default_value; + } + return opt(key); +} + +/** + * Return the raw string value of an opt by a given key. If no opts with the + * given key are found, return the given default_value. + * + * By calling this function, automatic ensurement for no unused opts will be + * done when the program is finalized. Call suppressEnsureNoUnusedOpts() to + * turn it off. + */ +std::string opt(const std::string &key, const std::string &default_value) { + return opt(key, default_value); +} + +/** + * Check if all opts are used. If not, __testlib_fail is called. + * Should be used after calling all opt() function calls. + * + * This function is useful when opt() with default_value for checking typos + * in the opt's key. + */ +void ensureNoUnusedOpts() { + for (const auto &opt: __testlib_opts) { + if (!opt.second.used) { + __testlib_fail(format("Opts: unused key '%s'", compress(opt.first).c_str())); + } + } +} + +void suppressEnsureNoUnusedOpts() { + __testlib_ensureNoUnusedOptsSuppressed = true; +} + +void TestlibFinalizeGuard::autoEnsureNoUnusedOpts() { + if (__testlib_ensureNoUnusedOptsFlag && !__testlib_ensureNoUnusedOptsSuppressed) { + ensureNoUnusedOpts(); + } +} + +TestlibFinalizeGuard testlibFinalizeGuard; + +#endif +#endif diff --git a/longest-common-subsequence/src/validator.cpp b/longest-common-subsequence/src/validator.cpp new file mode 100644 index 0000000..237c9cf --- /dev/null +++ b/longest-common-subsequence/src/validator.cpp @@ -0,0 +1,15 @@ +#include "testlib.h" +#include + +using namespace std; + + +int main(int argc, char* argv[]) { + registerValidation(argc, argv); + inf.readToken("[a-z]{1, 1000}", "s1"); + inf.readSpace(); + inf.readToken("[a-z]{1, 1000}", "s2"); + inf.readEoln(); + inf.readEof(); + return 0; +} \ No newline at end of file diff --git a/longest-common-subsequence/statement/description.tex b/longest-common-subsequence/statement/description.tex new file mode 100644 index 0000000..e69de29 diff --git a/longest-common-subsequence/statement/input.tex b/longest-common-subsequence/statement/input.tex new file mode 100644 index 0000000..e69de29 diff --git a/longest-common-subsequence/statement/notes.tex b/longest-common-subsequence/statement/notes.tex new file mode 100644 index 0000000..e69de29 diff --git a/longest-common-subsequence/statement/output.tex b/longest-common-subsequence/statement/output.tex new file mode 100644 index 0000000..e69de29 diff --git a/longest-common-subsequence/statement/preamble.tex b/longest-common-subsequence/statement/preamble.tex new file mode 100644 index 0000000..e69de29 diff --git a/longest-common-subsequence/statement/tutorial.tex b/longest-common-subsequence/statement/tutorial.tex new file mode 100644 index 0000000..e69de29