Solve some problems

11 files changed, 183 insertions, 0 deletions

diff --git a/codeforces/Nirvana/main b/codeforces/Nirvana/main
new file mode 100755
index 0000000..fbcca77
--- /dev/null
+++ b/codeforces/Nirvana/main
diff --git a/codeforces/Nirvana/main.cpp b/codeforces/Nirvana/main.cpp
new file mode 100755
index 0000000..4f12e44
--- /dev/null
+++ b/codeforces/Nirvana/main.cpp
@@ -0,0 +1,146 @@
+#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 print() {
+  cerr << "\n";
+}
+
+template<typename T, typename... TS>
+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
+ */
+pair<int, int> helper(int n) {
+  stack<int> st;
+  int cnt = 0;
+  while(n) {
+    n /= 10;
+    cnt++;
+    st.push(n);
+  }
+  return {st.top(),cnt};
+}
+
+void solve() {
+  ll n;
+  cin >> n;
+  pii p = helper(n);
+  ll res = 1;
+  for (int i = 0; i < p.second; i++) {
+    res *= 9;
+  }
+
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  solve();
+}
+
+
diff --git a/codeforces/Nirvana/main_input0.txt b/codeforces/Nirvana/main_input0.txt
new file mode 100644
index 0000000..6f8a8c5
--- /dev/null
+++ b/codeforces/Nirvana/main_input0.txt
@@ -0,0 +1 @@
+390
diff --git a/codeforces/Nirvana/main_input1.txt b/codeforces/Nirvana/main_input1.txt
new file mode 100644
index 0000000..7f8f011
--- /dev/null
+++ b/codeforces/Nirvana/main_input1.txt
@@ -0,0 +1 @@
+7
diff --git a/codeforces/Nirvana/main_input2.txt b/codeforces/Nirvana/main_input2.txt
new file mode 100644
index 0000000..770fdcf
--- /dev/null
+++ b/codeforces/Nirvana/main_input2.txt
@@ -0,0 +1 @@
+1000000000
diff --git a/codeforces/Nirvana/main_input3.txt b/codeforces/Nirvana/main_input3.txt
new file mode 100644
index 0000000..8371327
--- /dev/null
+++ b/codeforces/Nirvana/main_input3.txt
@@ -0,0 +1 @@
+889878787
\ No newline at end of file
diff --git a/codeforces/Nirvana/main_output0.txt b/codeforces/Nirvana/main_output0.txt
new file mode 100644
index 0000000..a817176
--- /dev/null
+++ b/codeforces/Nirvana/main_output0.txt
@@ -0,0 +1 @@
+216
diff --git a/codeforces/Nirvana/main_output1.txt b/codeforces/Nirvana/main_output1.txt
new file mode 100644
index 0000000..7f8f011
--- /dev/null
+++ b/codeforces/Nirvana/main_output1.txt
@@ -0,0 +1 @@
+7
diff --git a/codeforces/Nirvana/main_output2.txt b/codeforces/Nirvana/main_output2.txt
new file mode 100644
index 0000000..47a3414
--- /dev/null
+++ b/codeforces/Nirvana/main_output2.txt
@@ -0,0 +1 @@
+387420489
diff --git a/codeforces/Nirvana/main_output3.txt b/codeforces/Nirvana/main_output3.txt
new file mode 100644
index 0000000..8a901d1
--- /dev/null
+++ b/codeforces/Nirvana/main_output3.txt
@@ -0,0 +1 @@
+301327047
\ No newline at end of file
diff --git a/codeforces/Nirvana/test.py b/codeforces/Nirvana/test.py
new file mode 100755
index 0000000..688531e
--- /dev/null
+++ b/codeforces/Nirvana/test.py
@@ -0,0 +1,29 @@
+
+def prod(n):
+    prod = 1
+    while n > 0:
+        prod *= n % 10
+        n //= 10
+    return prod
+
+
+def main():
+    mp = {}
+    for i in range(1, 1001):
+        mx = 0
+        for j in range(1, i + 1):
+            mx = max(mx, prod(j))
+        mp[mx] = j
+        print(i, mp[mx])
+    
+
+
+if __name__ == "__main__":
+    main()
+
+
+        
+
+
+
+