Update show.h

Author: Zhenghao-Liu

0000.test_project/show.h

@@ -8,6 +8,7 @@
 #include <map>
 #include <unordered_set>
 #include <set>
+#include <bitset>
 #include <iostream>
 using namespace std;
 
@@ -37,7 +38,7 @@ void show(vector<vector<T>> answer)
 	int single_answer_size;
 	cout << "-------" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (int i = 0; i < answer_size; ++i)
 	{
 		single_answer_size = answer.at(i).size();
@@ -47,33 +48,33 @@ void show(vector<vector<T>> answer)
 	}
 	cout << "-------" << endl;
 }
-template <typename T>
-void show(vector<T> answer)
+void show(vector<pair<int,int>> answer)
 {
 	cout << "----" << endl;
 	int answer_size = answer.size();
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (int i = 0; i < answer_size; ++i)
-		cout << answer.at(i) << endl;
+		cout << answer.at(i).first << ' ' << answer.at(i).second << endl;
 	cout << "----" << endl;
 }
-void show(vector<pair<int,int>> answer)
+template <typename T>
+void show(vector<T> answer)
 {
 	cout << "----" << endl;
 	int answer_size = answer.size();
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (int i = 0; i < answer_size; ++i)
-		cout << answer.at(i).first << ' ' << answer.at(i).second << endl;
+		cout << answer.at(i) << endl;
 	cout << "----" << endl;
 }
 template <typename T>
 void show(list<T> answer)
 {
 	cout << "----" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (auto p=answer.begin();p!=answer.end();++p)
 		cout << *p << endl;
 	cout << "----" << endl;
@@ -93,7 +94,7 @@ void show(unordered_map<K,V> answer)
 {
 	cout << "----" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (auto p=answer.begin();p!=answer.end();++p)
 		cout << p->first << ' ' << p->second << endl;
 	cout << "----" << endl;
@@ -103,7 +104,7 @@ void show(map<K,V> answer)
 {
 	cout << "----" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (auto p=answer.begin();p!=answer.end();++p)
 		cout << p->first << ' ' << p->second << endl;
 	cout << "----" << endl;
@@ -113,7 +114,7 @@ void show(unordered_set<T> answer)
 {
 	cout << "----" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (auto p=answer.begin();p!=answer.end();++p)
 		cout << *p << endl;
 	cout << "----" << endl;
@@ -123,7 +124,7 @@ void show(set<T> answer)
 {
 	cout << "----" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (auto p=answer.begin();p!=answer.end();++p)
 		cout << *p << endl;
 	cout << "----" << endl;
@@ -133,29 +134,41 @@ void show(multimap<K,V> answer)
 {
 	cout << "----" << endl;
 	cout << "size=" << answer.size() << endl
-		 << "~~~~" << endl;
+		<< "~~~~" << endl;
 	for (auto p=answer.begin();p!=answer.end();++p)
 		cout << p->first << ' ' << p->second << endl;
 	cout << "----" << endl;
 }
-
-
-int base=1e9+7;
-int quick_pow(int a,int n)
+void show_in_binary(int x)
 {
-    //a^n
-    if (a==0)
-        return 0;
-    if (n==0)
-        return 1;
-    a%=base;
-    if ((n&1)==1)
-        return a*quick_pow(a,n-1)%base;
-    else
-    {
-        int half=quick_pow(a,n/2);
-        return (long long)half*half%base;
-    }
+	cout << "----" << endl;
+	cout << bitset<32>(x).to_string() << endl;
+	cout << "----" << endl;
+}
+template <typename T>
+void show(priority_queue<T> answer)
+{
+	cout << "----" << endl;
+	cout << "size=" << answer.size() << endl
+		<< "~~~~" << endl;
+	while (!answer.empty())
+	{
+		cout << answer.top() << endl;
+		answer.pop();
+	}
+	cout << "----" << endl;
+}
+template <typename A,typename B>
+void show(priority_queue<pair<A,B>> answer)
+{
+	cout << "----" << endl;
+	cout << "size=" << answer.size() << endl
+		<< "~~~~" << endl;
+	while (!answer.empty())
+	{
+		cout << answer.top().first << ' '  << answer.top().second << endl;
+		answer.pop();
+	}
+	cout << "----" << endl;
 }
-
 #endif