GH-169: Solve codeforces 1794A, 1795A

collections/codeforces/README.md

@@ -17942,7 +17942,7 @@
 </tr>
 <tr>
 <tr>
-<td>1794A</td>
+<td>🟢&nbsp<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/codeforces1794A'>1794A</a></td>
 <td>1794B</td>
 <td>1794C</td>
 <td>1794D</td>
@@ -17952,7 +17952,7 @@
 </tr>
 <tr>
 <tr>
-<td>1795A</td>
+<td>🟢&nbsp<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/codeforces1795A'>1795A</a></td>
 <td>1795B</td>
 <td>1795C</td>
 <td>1795D</td>

collections/codeforces/data.yaml

@@ -71,6 +71,12 @@ problems:
 - name: 492B
   languages: cpp
   score: 1200
+- name: 1794A
+  languages: cpp
+  score: 800
+- name: 1795A
+  languages: cpp
+  score: 800
 - name: 1796A
   languages: cpp
   score: 800

problems/codeforces1794A/.gitignore

@@ -0,0 +1,2 @@
+solution
+*.dSYM

problems/codeforces1794A/README.md

@@ -0,0 +1,19 @@
+# Codeforces Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run cpp/main:solution < data/1.in
+```
+
+Test program
+
+```
+# Run all tests
+bazel test --test_output=all tests:solution_test
+bazel test --test_output=all --cache_test_results=no tests:solution_test
+# Run test with pecific test id
+bazel test --test_output=all tests:solution_test --test_arg=1
+```

problems/codeforces1794A/cpp/main/BUILD

@@ -0,0 +1,7 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "solution",
+    srcs = ["solution.cpp"],
+    visibility = ["//visibility:public"],
+)

problems/codeforces1794A/cpp/main/solution.cpp

@@ -0,0 +1,51 @@
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <unordered_map>
+#include <vector>
+// #include <fstream>
+
+using namespace std;
+
+void solve(){
+  int n;
+  cin >> n;
+  vector<string> sub;
+  string s;
+  for(int i=0; i<2 * n - 2; i++){
+    cin >> s;
+    if(s.size() == n - 1){
+      sub.push_back(s);
+    }
+  }
+  string s1 = sub[0];
+  string s2 = sub[1];
+  for(int i=0; i<n-1; i++){
+    if(s1[i] != s2[n-2-i]){
+      cout << "NO" << endl;
+      return;
+    }
+  }
+  cout << "YES" << endl;
+}
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+
+  // filesystem::path filepath =
+  //     filesystem::current_path().parent_path().parent_path() / "data" /
+  //     "1.in";
+  // ifstream file(filepath);
+  //   cin.rdbuf(file.rdbuf());  // redirect cin to file
+
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+  return 0;
+}

problems/codeforces1794A/cpp/tests/BUILD

@@ -0,0 +1,11 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary", "cc_test")
+
+cc_test(
+    name = "solution_test",
+    srcs = ["solution_test.cpp"],
+    deps = [
+      "//problems/codeforces2A/src/main:solution",
+      "@com_google_googletest//:gtest_main",
+    ],
+    data = ["data"]
+)

problems/codeforces1794A/cpp/tests/solution_test.cpp

@@ -0,0 +1,97 @@
+#include <cstdlib>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <string>
+#include <string_view>
+#include <vector>
+
+#include "gtest/gtest.h"
+
+namespace fs = std::filesystem;
+
+using namespace std;
+
+std::string TEST_ID = "";
+
+vector<string> split(string s, string delimiter) {
+  size_t pos_start = 0, pos_end, delim_len = delimiter.length();
+  string token;
+  vector<string> res;
+
+  while ((pos_end = s.find(delimiter, pos_start)) != string::npos) {
+    token = s.substr(pos_start, pos_end - pos_start);
+    pos_start = pos_end + delim_len;
+    res.push_back(token);
+  }
+
+  res.push_back(s.substr(pos_start));
+  return res;
+}
+
+std::string GetHello(std::string_view in) {
+  if (in.size() == 0) {
+    return std::string("hello, word");
+  } else {
+    return std::string("Hello, ") + in.data();
+  }
+}
+
+string ReadFile(const std::string &filename) {
+  std::ifstream f(filename);
+  string s((std::istreambuf_iterator<char>(f)),
+           std::istreambuf_iterator<char>());
+  return s;
+}
+
+vector<string> RunProgram(string fileid) {
+  vector<string> v;
+  string program = "problems/codeforces2A/src/main/solution";
+  string test_folder = "problems/codeforces2A/tests/data/";
+  string command = program + " < " + test_folder + fileid + ".in > output.txt";
+  std::system(command.c_str());
+  string actual = ReadFile("output.txt");
+  string expectedOutputFile = test_folder + fileid + ".out";
+  string expected = ReadFile(expectedOutputFile);
+  v.push_back(actual);
+  v.push_back(expected);
+  return v;
+}
+
+TEST(RunTest, AllTestCases) {
+  if (TEST_ID != "") {
+    std::cout << "TEST_ID = " << TEST_ID << std::endl;
+  } else {
+    std::cout << "RUN ALL TESTS" << std::endl;
+  }
+
+  std::string test_data_folder = "problems/codeforces2A/tests/data";
+  for (const auto &entry : fs::directory_iterator(test_data_folder)) {
+    string filename = split(entry.path(), "/").back();
+    vector<string> v = split(filename, ".");
+    string fileid = v[0];
+    string extension = v[1];
+    if (extension != "in"){
+      continue;
+    }
+    if (TEST_ID != ""){
+      if (fileid != TEST_ID){
+        continue;
+      }
+    }
+    // Run Test Case
+    vector<string> output = RunProgram(fileid);
+    string actual = output[0];
+    string expected = output[1];
+    string message = "❌ FAIL CASE: " + fileid;
+    ASSERT_EQ(actual, expected) << message;
+  }
+}
+
+int main(int argc, char **argv) {
+  ::testing::InitGoogleTest(&argc, argv);
+  if (argc == 2) {
+    TEST_ID = argv[1];
+  }
+  return RUN_ALL_TESTS();
+}

problems/codeforces1794A/data/1.in

@@ -0,0 +1,11 @@
+5
+4
+bcd cd a d abc ab
+3
+i io i oi
+2
+g g
+3
+t al lt a
+4
+bba a ab a abb ba

problems/codeforces1794A/data/1.out

@@ -0,0 +1,5 @@
+4
+3
+2
+1
+0

problems/codeforces1794A/data/2.in

@@ -0,0 +1 @@
+10

problems/codeforces1794A/data/2.out

@@ -0,0 +1,10 @@
+9
+8
+7
+6
+5
+4
+3
+2
+1
+0

problems/codeforces1795A/.gitignore

@@ -0,0 +1,2 @@
+solution
+*.dSYM

problems/codeforces1795A/README.md

@@ -0,0 +1,19 @@
+# Codeforces Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run cpp/main:solution < data/1.in
+```
+
+Test program
+
+```
+# Run all tests
+bazel test --test_output=all tests:solution_test
+bazel test --test_output=all --cache_test_results=no tests:solution_test
+# Run test with pecific test id
+bazel test --test_output=all tests:solution_test --test_arg=1
+```

problems/codeforces1795A/cpp/main/BUILD

@@ -0,0 +1,7 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "solution",
+    srcs = ["solution.cpp"],
+    visibility = ["//visibility:public"],
+)

problems/codeforces1795A/cpp/main/solution.cpp

@@ -0,0 +1,52 @@
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <unordered_map>
+#include <vector>
+// #include <fstream>
+
+using namespace std;
+
+void solve(){
+  int n, m;
+  cin >> n >> m;
+  string s, t;
+  cin >> s;
+  cin >> t;
+  reverse(t.begin(), t.end());
+  string merge = s + t;
+  int count = 0;
+  // cout << "merge: " << merge << endl;
+  for(int i=1; i<merge.size(); i++){
+    if(merge[i] == merge[i-1]){
+      count++;
+    }
+  }
+  if(count > 1){
+    cout << "NO" << endl;
+  } else {
+    cout << "YES" << endl;
+  }
+
+}
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+
+  // filesystem::path filepath =
+  //     filesystem::current_path().parent_path().parent_path() / "data" /
+  //     "1.in";
+  // ifstream file(filepath);
+  //   cin.rdbuf(file.rdbuf());  // redirect cin to file
+
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+  return 0;
+}

problems/codeforces1795A/cpp/tests/BUILD

@@ -0,0 +1,11 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary", "cc_test")
+
+cc_test(
+    name = "solution_test",
+    srcs = ["solution_test.cpp"],
+    deps = [
+      "//problems/codeforces2A/src/main:solution",
+      "@com_google_googletest//:gtest_main",
+    ],
+    data = ["data"]
+)