From 77d58f165dde9c74e3eb17bcf450d33360d972b1 Mon Sep 17 00:00:00 2001
From: Richard Liu <liuzhenglaichn@gmail.com>
Date: Mon, 25 May 2020 16:37:54 -0700
Subject: [PATCH] stdc++.h

---
 .gitignore                         |  6 +++++-
 codeforces/Fox And Names/README.md | 28 ++--------------------------
 codeforces/Fox And Names/out       |  6 +++---
 3 files changed, 10 insertions(+), 30 deletions(-)

diff --git a/.gitignore b/.gitignore
index 19735332..68f32f8e 100644
--- a/.gitignore
+++ b/.gitignore
@@ -3,4 +3,8 @@
 Book/
 *.sublime-workspace
 .vscode
-test/
\ No newline at end of file
+test/
+# Codeforces
+run.sh
+main.cpp
+exe
\ No newline at end of file
diff --git a/codeforces/Fox And Names/README.md b/codeforces/Fox And Names/README.md
index 837d127f..b0223b0a 100644
--- a/codeforces/Fox And Names/README.md	
+++ b/codeforces/Fox And Names/README.md	
@@ -5,19 +5,7 @@
 ## Solution 1. Topological Sort (BFS)
 
 ```cpp
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-#include <iostream>
-#include <vector>
-#include <string>
-#include <map>
-#include <unordered_map>
-#include <set>
-#include <stack>
-#include <queue>
-#include <unordered_set>
-#include <algorithm>
+#include <bits/stdc++.h>
 using namespace std;
 #define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
 #define PRINTCASE printf("Case #%d: ",case_n++)
@@ -80,19 +68,7 @@ int main() {
 ## Solution 2. Topological Sort (DFS)
 
 ```cpp
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-#include <iostream>
-#include <vector>
-#include <string>
-#include <map>
-#include <unordered_map>
-#include <set>
-#include <stack>
-#include <queue>
-#include <unordered_set>
-#include <algorithm>
+#include <bits/stdc++.h>
 using namespace std;
 #define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
 #define PRINTCASE printf("Case #%d: ",case_n++)
diff --git a/codeforces/Fox And Names/out b/codeforces/Fox And Names/out
index 32da5984..85a4247c 100644
--- a/codeforces/Fox And Names/out	
+++ b/codeforces/Fox And Names/out	
@@ -1,4 +1,4 @@
-Case #1: zyxwvutrsqponmlkjihgfedcba
+Case #1: bcdefghijklmnopqrtuvwxyzsa
 Case #2: Impossible
-Case #3: zyxwvutsrqpoljhgnefikdmbca
-Case #4: zyxwvutsrqpnmlkjihfedcboga
+Case #3: aghjlopqrstuvwxyznefikdmbc
+Case #4: acdefhijklmnpqrstuvwxyzbog