Solve problem 709C from codeforces

Author: AliOsm

CodeForces/709C. Letters Cyclic Shift.cpp

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+int const N = 1e5 + 1;
+char s[N];
+
+int main() {
+	scanf("%s", s);
+
+	int len = strlen(s), idx = -1;
+	for(int i = 0; i < len; ++i)
+		if(s[i] != 'a') {
+			idx = i;
+			break;
+		}
+
+	if(idx == -1) {
+		s[len - 1] = 'z';
+		puts(s);
+		return 0;
+	}
+
+	while(idx < len && s[idx] != 'a') {
+		s[idx] = char(int(s[idx]) - 1);
+		++idx;
+	}
+	puts(s);
+
+	return 0;
+}
+

CodeForces/863C. 1-2-3.cpp

@@ -5,8 +5,8 @@ using namespace std;
 typedef long long ll;
 
 int const N = 4;
-long long k, a, b, aa[N][N], bb[N][N], ra, rb, tmpa, tmpb, loops, c1, c2;
-bool vis1[N][N], vis2[N][N];
+ll k, a, b, aa[N][N], bb[N][N], ra, rb, tmpa, tmpb, loops, c1, c2;
+bool vis[N][N];
 vector<int> all;
 
 int main() {
@@ -18,15 +18,15 @@ int main() {
 		for(int j = 1; j < N; ++j)
 			scanf("%lld", &bb[i][j]);
 
-	while(k > 0 && !vis1[a][b]) {
+	while(k > 0 && !vis[a][b]) {
 		if(a != b) {
 			if((a == 3 && b == 2) || (a == 2 && b == 1) || (a == 1 && b == 3))
 				++ra;
 			else
 				++rb;
 		}
 
-		vis1[a][b] = true;
+		vis[a][b] = true;
 
 		tmpa = aa[a][b];
 		tmpb = bb[a][b];
@@ -38,15 +38,17 @@ int main() {
 	}
 
 	if(k > 0) {
-		while(!vis2[a][b]) {
+		memset(vis, false, sizeof vis);
+
+		while(!vis[a][b]) {
 			if(a == b)
 				all.push_back(0);
 			else if((a == 3 && b == 2) || (a == 2 && b == 1) || (a == 1 && b == 3))
 				all.push_back(1);
 			else
 				all.push_back(2);
 
-			vis2[a][b] = true;
+			vis[a][b] = true;
 
 			tmpa = aa[a][b];
 			tmpb = bb[a][b];

CodeForces/README.md

@@ -186,6 +186,7 @@
 - [706D. Vasiliy's Multiset](http://codeforces.com/contest/706/problem/D)
 - [707A. Brain's Photos](http://codeforces.com/problemset/problem/707/A)
 - [709B. Checkpoints](http://codeforces.com/problemset/problem/709/C)
+- [709C. Letters Cyclic Shift](http://codeforces.com/contest/709/problem/C)
 - [719A. Vitya in the Countryside](http://codeforces.com/problemset/problem/719/A)
 - [722A. Broken Clock](http://codeforces.com/problemset/problem/722/A)
 - [721A. One-dimensional Japanese Crossword](http://codeforces.com/problemset/problem/721/A)