From 2842e9ef52d61fb52228ef4d7bc45f5aeb954ab3 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Thu, 30 Mar 2023 23:38:17 +0200 Subject: Solved a couple of problem on codeforces --- codeforces/Yes-Yes/main | Bin 0 -> 25608 bytes codeforces/Yes-Yes/main.cpp | 148 ++++++++++++++++++++++++++++++++++++ codeforces/Yes-Yes/main.py | 12 +++ codeforces/Yes-Yes/main_input0.txt | 13 ++++ codeforces/Yes-Yes/main_input1.txt | 13 ++++ codeforces/Yes-Yes/main_output0.txt | 12 +++ codeforces/Yes-Yes/main_output1.txt | 12 +++ 7 files changed, 210 insertions(+) create mode 100755 codeforces/Yes-Yes/main create mode 100755 codeforces/Yes-Yes/main.cpp create mode 100644 codeforces/Yes-Yes/main.py create mode 100644 codeforces/Yes-Yes/main_input0.txt create mode 100644 codeforces/Yes-Yes/main_input1.txt create mode 100644 codeforces/Yes-Yes/main_output0.txt create mode 100644 codeforces/Yes-Yes/main_output1.txt (limited to 'codeforces/Yes-Yes') diff --git a/codeforces/Yes-Yes/main b/codeforces/Yes-Yes/main new file mode 100755 index 0000000..2447a9c Binary files /dev/null and b/codeforces/Yes-Yes/main differ diff --git a/codeforces/Yes-Yes/main.cpp b/codeforces/Yes-Yes/main.cpp new file mode 100755 index 0000000..0598977 --- /dev/null +++ b/codeforces/Yes-Yes/main.cpp @@ -0,0 +1,148 @@ +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b) - 1) / (b)) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template ostream& operator<<(ostream& os, const pair& p); +template ostream& operator<<(ostream& os, const vector& vec); +template ostream& operator<<(ostream& os, const map& m); +template ostream& operator<<(ostream& os, const unordered_map& m); +template ostream& operator<<(ostream& os, const set& s); +template ostream& operator<<(ostream& os, const unordered_set& s); + +template +ostream& operator<<(ostream& os, const pair& p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template +ostream& operator<<(ostream& os, const vector& vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + + +template +ostream& operator<<(ostream& os, const map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_map& m) { + os << "{"; + for (const auto& p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream& operator<<(ostream& os, const unordered_set& s) { + int i = 0; + os << "{"; + for (const auto& e : s) { + if (i > 0) os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void print() { + cerr << "\n"; +} + +template +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + string s; + cin >> s; + int n = s.size(); + string yes = "Yes"; + int pos = yes.find(s[0]); + if (pos == string:: npos) { + cout << "NO\n"; + return; + } + for (int i = 0; i < n; i++) { + if (s[i] != yes[pos]) { + cout << "NO\n"; + return; + } + pos = (pos + 1) % 3; + } + cout << "YES\n"; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + diff --git a/codeforces/Yes-Yes/main.py b/codeforces/Yes-Yes/main.py new file mode 100644 index 0000000..1592898 --- /dev/null +++ b/codeforces/Yes-Yes/main.py @@ -0,0 +1,12 @@ + +tt = int(input()) +for _ in range(tt): + s = input() + new_s = "Yes" * 20 + if s in new_s: + print("YES") + else: + print("NO") + + + diff --git a/codeforces/Yes-Yes/main_input0.txt b/codeforces/Yes-Yes/main_input0.txt new file mode 100644 index 0000000..c414842 --- /dev/null +++ b/codeforces/Yes-Yes/main_input0.txt @@ -0,0 +1,13 @@ +12 +YES +esYes +codeforces +es +se +YesY +esYesYesYesYesYesYe +seY +Yess +sY +o +Yes diff --git a/codeforces/Yes-Yes/main_input1.txt b/codeforces/Yes-Yes/main_input1.txt new file mode 100644 index 0000000..e7266e5 --- /dev/null +++ b/codeforces/Yes-Yes/main_input1.txt @@ -0,0 +1,13 @@ +12 +YES +esYes +codeforces +es +se +YesY +esYesYesYesYesYesYe +seY +Yess +sY +o +Yes \ No newline at end of file diff --git a/codeforces/Yes-Yes/main_output0.txt b/codeforces/Yes-Yes/main_output0.txt new file mode 100644 index 0000000..ecc7c29 --- /dev/null +++ b/codeforces/Yes-Yes/main_output0.txt @@ -0,0 +1,12 @@ +NO +YES +NO +YES +NO +YES +YES +NO +NO +YES +NO +YES diff --git a/codeforces/Yes-Yes/main_output1.txt b/codeforces/Yes-Yes/main_output1.txt new file mode 100644 index 0000000..ecc7c29 --- /dev/null +++ b/codeforces/Yes-Yes/main_output1.txt @@ -0,0 +1,12 @@ +NO +YES +NO +YES +NO +YES +YES +NO +NO +YES +NO +YES -- cgit v1.2.3