From 7eb94ca7d1a7891d75918030cc47c88852ed5920 Mon Sep 17 00:00:00 2001
From: AnuragBarfa <mohanlalbarfa998@gmail.com>
Date: Mon, 30 Oct 2017 22:00:49 +0530
Subject: [PATCH] created solution for the question

solved the problem and written the code
---
 .../The Last Word\r\n/solutions/solution1"    | 45 +++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 "GoogleCodeJam/2016/Round 1 A/The Last Word\r\n/solutions/solution1"

diff --git "a/GoogleCodeJam/2016/Round 1 A/The Last Word\r\n/solutions/solution1" "b/GoogleCodeJam/2016/Round 1 A/The Last Word\r\n/solutions/solution1"
new file mode 100644
index 0000000..3c944f3
--- /dev/null
+++ "b/GoogleCodeJam/2016/Round 1 A/The Last Word\r\n/solutions/solution1"	
@@ -0,0 +1,45 @@
+#include <cstdio>
+#include <cstdlib>
+#include <cmath>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <map>
+#include <set>
+#include <algorithm>
+#include <queue>
+#include <sstream>
+using namespace std;
+typedef long long ll;
+typedef pair<int,int> pii;
+#define SZ(x) (int)(x.size())
+#define F0(i,n) for(int i=0;i<n;i++)
+#define F1(i,n) for(int i=1;i<=n;i++)
+const int MOD = 1000002013;
+const double pi = atan(1.0)*4.0;
+const double eps = 1e-8;
+ll gcd(ll x, ll y) { return y ? gcd(y, x%y) : x; }
+int bc(int n) { return n ? bc((n-1)&n)+1 : 0; }
+
+int i, j, k, m, n, l;
+
+int main() {
+    //freopen("x.in", "r", stdin);
+
+	freopen("A-small-attempt0.in", "r", stdin);
+	freopen("A-small-attempt0.out", "w", stdout);
+
+	//freopen("A-large.in", "r", stdin);
+	//freopen("A-large.out", "w", stdout);
+
+	int tt, tn; cin >> tn;
+
+	F1(tt,tn) {
+		//cerr << tt << endl;
+		string s; cin >> s;
+		string q; F0(i, SZ(s)) q = max(s[i] + q, q + s[i]);
+  		printf("Case #%d: ", tt);
+		cout << q << endl;
+	}
+	return 0;
+}