Solve problems 263D and 363C from codeforces

Author: AliOsm

CodeForces/263D. Cycle in Graph.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 2e5 + 10;
+int n, m, k;
+bool vis[N];
+vector<vector<int> > g;
+vector<int> sol;
+
+void DFS(int v, int src) {
+  vis[v] = true;
+  sol.push_back(v);
+  
+  for(int i = 0; i < (int)g[v].size(); ++i) {
+    int u = g[v][i];
+    if(u == src && sol.size() >= k + 1) {
+      printf("%d\n", (int)sol.size());
+      for(int j = 0; j < (int)sol.size(); ++j)
+        printf("%d ", sol[j]);
+      puts("");
+      exit(0);
+    }
+    if(!vis[u])
+      DFS(u, src);
+  }
+  
+  sol.pop_back();
+}
+
+int main() {
+  scanf("%d %d %d", &n, &m, &k);
+  g.resize(n + 10);
+  for(int i = 0, a, b; i < m; ++i) {
+    scanf("%d %d", &a, &b);
+    g[a].push_back(b);
+    swap(a, b);
+    g[a].push_back(b);
+  }
+  for(int i = 0; i < (int)g.size(); ++i)
+    sort(g[i].begin(), g[i].end());
+  
+  for(int i = 1; i < n; ++i) {
+    memset(vis, false, sizeof vis);
+    DFS(i, i);
+  }
+  
+  return 0;
+}

CodeForces/363C. Fixing Typos.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+char in[int(2e5 + 10)], out[int(2e5 + 10)];
+
+int main() {
+  scanf("%s", in + 5);
+  int len = strlen(in + 5), cnt = 5;
+  for(int i = 0; i < 5; ++i)
+    out[i] = char(i + '0');
+  for(int i = 5; i < len + 5; ++i) {
+    if(out[cnt - 1] == in[i] && out[cnt - 2] == in[i])
+      continue;
+    if(out[cnt - 3] == out[cnt - 2] && out[cnt - 1] == in[i])
+      continue;
+    out[cnt++] = in[i];
+  }
+  out[cnt] = '\0';
+  printf("%s\n", out + 5);
+  
+  return 0;
+}

CodeForces/README.md

@@ -75,6 +75,7 @@
 - [257A. Sockets](http://codeforces.com/contest/257/problem/A)
 - [262A. Roma and Lucky Numbers](http://codeforces.com/problemset/problem/262/A)
 - [263A. Beautiful Matrix](http://codeforces.com/problemset/problem/263/A)
+- [263D. Cycle in Graph](http://codeforces.com/contest/263/problem/D)
 - [266A. Stones on the Table](http://codeforces.com/problemset/problem/266/A)
 - [266B. Queue at the School](http://codeforces.com/problemset/problem/266/B)
 - [268A. Games](http://codeforces.com/problemset/problem/268/A)
@@ -96,6 +97,7 @@
 - [358A. Dima and Continuous Line](http://codeforces.com/problemset/problem/358/A)
 - [359D. Pair of Numbers](http://codeforces.com/contest/359/problem/D)
 - [363B. Fence](http://codeforces.com/contest/363/problem/B)
+- [363C. Fixing Typos](http://codeforces.com/contest/363/problem/C)
 - [368A. Sereja and Coat Rack](http://codeforces.com/problemset/problem/368/A)
 - [368B. Sereja and Suffixes](http://codeforces.com/problemset/problem/368/B)
 - [378A. Playing with Dice](http://codeforces.com/problemset/problem/378/A)