Solve a problem from codeforces

4 files changed, 174 insertions, 0 deletions

diff --git a/codeforces/ForbiddenInteger/main b/codeforces/ForbiddenInteger/main
new file mode 100755
index 0000000..d9bcc05
--- /dev/null
+++ b/codeforces/ForbiddenInteger/main
diff --git a/codeforces/ForbiddenInteger/main.cpp b/codeforces/ForbiddenInteger/main.cpp
new file mode 100755
index 0000000..1dda88e
--- /dev/null
+++ b/codeforces/ForbiddenInteger/main.cpp
@@ -0,0 +1,157 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+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 <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p);
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m);
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s);
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s);
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p) {
+  os << "(" << p.first << ", " << p.second << ")";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
+  os << "{";
+  for (size_t i = 0; i < vec.size(); ++i) {
+    if (i > 0)
+      os << ", ";
+    os << vec[i];
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+void dbg() { cerr << "\n"; }
+
+template <typename T, typename... TS> void dbg(T val, TS... vals) {
+  cerr << val << " ";
+  dbg(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() {
+  int n, k, x;
+  cin >> n >> k >> x;
+  if (k == 1 && x == 1 || (n % 2 == 1 && k == 2 && x == 1)) {
+    cout << "NO\n";
+  } else {
+    cout << "YES\n";
+    if (x != 1) {
+      cout << n << "\n";
+      for (int i = 0; i < n; i++) {
+        cout << 1 << " \n"[i == n - 1];
+      }
+    } else {
+      if (n % 2 == 0) {
+        cout << n / 2 << '\n';
+        for (int i = 0; i * 2 < n; i++) {
+          cout << 2 << " ";
+        }
+        cout << '\n';
+      } else {
+        cout << ((n - 3) / 2) + 1 << '\n';
+        for (int i = 0; i < (n - 3) / 2; i++) {
+          cout << 2 << " ";
+        }
+        cout << 3 << '\n';
+      }
+    }
+  }
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/ForbiddenInteger/main_input0.txt b/codeforces/ForbiddenInteger/main_input0.txt
new file mode 100644
index 0000000..1b3d214
--- /dev/null
+++ b/codeforces/ForbiddenInteger/main_input0.txt
@@ -0,0 +1,6 @@
+5
+10 3 2
+5 2 1
+4 2 1
+7 7 3
+6 1 1
diff --git a/codeforces/ForbiddenInteger/main_output0.txt b/codeforces/ForbiddenInteger/main_output0.txt
new file mode 100644
index 0000000..27737a1
--- /dev/null
+++ b/codeforces/ForbiddenInteger/main_output0.txt
@@ -0,0 +1,11 @@
+YES
+6
+3 1 1 1 1 3
+NO
+YES
+2
+2 2
+YES
+1
+7
+NO