12 files changed, 183 insertions, 0 deletions
diff --git a/contests/EduRound145/B/main b/contests/EduRound145/B/main
new file mode 100755
index 0000000..2b608e5
--- /dev/null
+++ b/contests/EduRound145/B/main
diff --git a/contests/EduRound145/B/main.cpp b/contests/EduRound145/B/main.cpp
new file mode 100755
index 0000000..f95b893
--- /dev/null
+++ b/contests/EduRound145/B/main.cpp
@@ -0,0 +1,150 @@
+#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
+ */
+
+ll mySqrt(ll a) {
+  ll l = 0, r = 1e9 + 1;
+  while (l + 1 < r) {
+    ll m = (l + r) / 2;
+    if (m * m <= a) {
+      l = m;
+    } else {
+      r = m;
+    }
+  }
+  return l;
+}
+
+void solve() {
+  ll n;
+  cin >> n;
+  cout << (ll)sqrt(n - 1) << '\n';
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/EduRound145/B/main_input0.txt b/contests/EduRound145/B/main_input0.txt
new file mode 100644
index 0000000..e383f1f
--- /dev/null
+++ b/contests/EduRound145/B/main_input0.txt
@@ -0,0 +1,5 @@
+4
+1
+3
+5
+975461057789971042
diff --git a/contests/EduRound145/B/main_input1.txt b/contests/EduRound145/B/main_input1.txt
new file mode 100644
index 0000000..42a2f8b
--- /dev/null
+++ b/contests/EduRound145/B/main_input1.txt
@@ -0,0 +1,2 @@
+1
+6
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_input2.txt b/contests/EduRound145/B/main_input2.txt
new file mode 100644
index 0000000..051f23d
--- /dev/null
+++ b/contests/EduRound145/B/main_input2.txt
@@ -0,0 +1,4 @@
+3
+2
+4
+16
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_input3.txt b/contests/EduRound145/B/main_input3.txt
new file mode 100644
index 0000000..ee95794
--- /dev/null
+++ b/contests/EduRound145/B/main_input3.txt
@@ -0,0 +1,6 @@
+5
+9
+10
+12
+15
+16
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_input4.txt b/contests/EduRound145/B/main_input4.txt
new file mode 100644
index 0000000..ccb572c
--- /dev/null
+++ b/contests/EduRound145/B/main_input4.txt
@@ -0,0 +1,2 @@
+1
+1000000000000000000
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output0.txt b/contests/EduRound145/B/main_output0.txt
new file mode 100644
index 0000000..00eb37d
--- /dev/null
+++ b/contests/EduRound145/B/main_output0.txt
@@ -0,0 +1,4 @@
+0
+1
+2
+987654321
diff --git a/contests/EduRound145/B/main_output1.txt b/contests/EduRound145/B/main_output1.txt
new file mode 100644
index 0000000..d8263ee
--- /dev/null
+++ b/contests/EduRound145/B/main_output1.txt
@@ -0,0 +1 @@
+2
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output2.txt b/contests/EduRound145/B/main_output2.txt
new file mode 100644
index 0000000..da8092b
--- /dev/null
+++ b/contests/EduRound145/B/main_output2.txt
@@ -0,0 +1,3 @@
+1
+2
+4
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output3.txt b/contests/EduRound145/B/main_output3.txt
new file mode 100644
index 0000000..d78555d
--- /dev/null
+++ b/contests/EduRound145/B/main_output3.txt
@@ -0,0 +1,5 @@
+3
+3
+3
+3
+4
+\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output4.txt b/contests/EduRound145/B/main_output4.txt
new file mode 100644
index 0000000..21ce28a
--- /dev/null
+++ b/contests/EduRound145/B/main_output4.txt
@@ -0,0 +1 @@
+1000000000
+\ No newline at end of file