Assignment 0.

13307130355/assignment0/src/Add.cc

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+namespace Solve {
+
+	template<class T> inline vector<T>& operator<< (vector<T> &storage, const T& data) {
+		storage.push_back(data);
+		return storage;
+	}
+
+	template<class T> inline void operator!(const vector<T>& vect) {
+		for(const T& data : vect) {
+			cout << data << " ";
+		}
+	}
+
+	template<class T> inline queue<T>& operator<< (queue<T> &storage, const T& data) {
+		storage.push(data);
+		return storage;
+	}
+
+	template<class T> inline stack<T>& operator<< (stack<T> &storage, const T& data) {
+		storage.push(data);
+		return storage;
+	}
+
+	template<class T> inline queue<T>& operator>> (queue<T> &storage, T& data) {
+		data = storage.front();
+		storage.pop();
+		return storage;
+	}
+
+	template<class T> inline stack<T>& operator>> (stack<T> &storage, T& data) {
+		data = storage.top();
+		storage.pop();
+		return storage;
+	}
+
+	void main(void) {
+		ios::sync_with_stdio(false);
+		register int i, j;
+		long long a, b;
+		cin >> a >> b;
+		cout << a + b << endl;
+	}
+}
+
+int main(void) {
+	Solve::main();
+}