rbx.cp 0.5.42__py3-none-any.whl → 0.5.45__py3-none-any.whl

rbx/testdata/interactive/sols/af_inf_cout_without_flush.cpp

@@ -1,78 +0,0 @@
-#include <algorithm>
-#include <cassert>
-#include <cmath>
-#include <cstdio>
-#include <cstring>
-#include <ctime>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <queue>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#define forn(i, n) for (int i = 0; i < n; ++i)
-#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
-#define sz(v) int(v.size())
-#define all(v) v.begin(), v.end()
-#define pb push_back
-#define mp make_pair
-#define x first
-#define y1 ________y1
-#define y second
-#define ft first
-#define sc second
-#define pt pair<int, int>
-
-template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
-template <typename X> inline X sqr(const X &a) { return a * a; }
-
-typedef long long li;
-typedef long double ld;
-
-using namespace std;
-
-const int INF = 1000 * 1000 * 1000;
-const ld EPS = 1e-9;
-const ld PI = acos(-1.0);
-
-int n;
-int lf, rg;
-
-bool read() {
-  cin >> n;
-  return true;
-}
-
-void solve() {
-  lf = 1, rg = n;
-  int it = 0;
-  while (rg - lf > 0) {
-    it++;
-    int mid = (lf + rg + 1) / 2;
-    cout << mid << endl;
-    fflush(stdout);
-    string s;
-    cin >> s;
-    if (s == "<")
-      rg = mid - 1;
-    else
-      lf = mid;
-    if (it > 5) {
-      while (true) {
-        cout << rand() % n + 1;
-      }
-    }
-  }
-  cout << "! " << lf << endl;
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}

rbx/testdata/interactive/sols/af_ml.cpp

@@ -1,78 +0,0 @@
-#include <algorithm>
-#include <cassert>
-#include <cmath>
-#include <cstdio>
-#include <cstring>
-#include <ctime>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <queue>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#define forn(i, n) for (int i = 0; i < n; ++i)
-#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
-#define sz(v) int(v.size())
-#define all(v) v.begin(), v.end()
-#define pb push_back
-#define mp make_pair
-#define x first
-#define y1 ________y1
-#define y second
-#define ft first
-#define sc second
-#define pt pair<int, int>
-
-template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
-template <typename X> inline X sqr(const X &a) { return a * a; }
-
-typedef long long li;
-typedef long double ld;
-
-using namespace std;
-
-const int INF = 1000 * 1000 * 1000;
-const ld EPS = 1e-9;
-const ld PI = acos(-1.0);
-
-int n;
-int lf, rg;
-
-bool read() {
-  cin >> n;
-  return true;
-}
-
-void solve() {
-  lf = 1, rg = n;
-  vector<int> was;
-  int it = 0;
-  while (lf != rg) {
-    it++;
-    int mid = (lf + rg + 1) / 2;
-    if (it > 5)
-      for (int i = 0; i < 10000000; i++)
-        was.pb(rand());
-    cout << mid << endl;
-    fflush(stdout);
-    string s;
-    cin >> s;
-    if (s == "<")
-      rg = mid - 1;
-    else
-      lf = mid;
-  }
-
-  cout << "! " << lf << endl;
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}

rbx/testdata/interactive/sols/af_tl_after_ans.cpp

@@ -1,74 +0,0 @@
-#include <algorithm>
-#include <cassert>
-#include <cmath>
-#include <cstdio>
-#include <cstring>
-#include <ctime>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <queue>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#define forn(i, n) for (int i = 0; i < n; ++i)
-#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
-#define sz(v) int(v.size())
-#define all(v) v.begin(), v.end()
-#define pb push_back
-#define mp make_pair
-#define x first
-#define y1 ________y1
-#define y second
-#define ft first
-#define sc second
-#define pt pair<int, int>
-
-template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
-template <typename X> inline X sqr(const X &a) { return a * a; }
-
-typedef long long li;
-typedef long double ld;
-
-using namespace std;
-
-const int INF = 1000 * 1000 * 1000;
-const ld EPS = 1e-9;
-const ld PI = acos(-1.0);
-
-int n;
-int lf, rg;
-
-bool read() {
-  cin >> n;
-  return true;
-}
-
-void solve() {
-  lf = 1, rg = n;
-  while (lf != rg) {
-    int mid = (lf + rg + 1) / 2;
-    cout << mid << endl;
-    fflush(stdout);
-    string s;
-    cin >> s;
-    if (s == "<")
-      rg = mid - 1;
-    else
-      lf = mid;
-  }
-
-  cout << "! " << lf << endl;
-  while (true) {
-  }
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}

rbx/testdata/interactive/sols/af_wa.cpp

@@ -1,74 +0,0 @@
-#include <algorithm>
-#include <cassert>
-#include <cmath>
-#include <cstdio>
-#include <cstring>
-#include <ctime>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <queue>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#define forn(i, n) for (int i = 0; i < n; ++i)
-#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
-#define sz(v) int(v.size())
-#define all(v) v.begin(), v.end()
-#define pb push_back
-#define mp make_pair
-#define x first
-#define y1 ________y1
-#define y second
-#define ft first
-#define sc second
-#define pt pair<int, int>
-
-template <typename X> inline X abs(const X &a) { return a < 0 ? -a : a; }
-template <typename X> inline X sqr(const X &a) { return a * a; }
-
-typedef long long li;
-typedef long double ld;
-
-using namespace std;
-
-const int INF = 1000 * 1000 * 1000;
-const ld EPS = 1e-9;
-const ld PI = acos(-1.0);
-
-int n;
-int lf, rg;
-
-bool read() {
-  cin >> n;
-  return true;
-}
-
-void solve() {
-  lf = 1, rg = n;
-  while (rg - lf > 1) {
-    int mid = (lf + rg + 1) / 2;
-    cout << mid << endl;
-    fflush(stdout);
-    string s;
-    cin >> s;
-    if (s == "<")
-      rg = mid - 1;
-    else
-      lf = mid;
-  }
-  int ans = lf;
-  if (rand() % 2)
-    ans = rg;
-  cout << "! " << ans << endl;
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}

rbx/testdata/interactive/sols/interactive-binary-search_mm_naive_cin.cpp

@@ -1,17 +0,0 @@
-#include <iostream>
-
-using namespace std;
-
-int main() {
-  int n;
-  cin >> n;
-  for (int i = n; i >= 1; i--) {
-    cout << i << endl << flush;
-    string response;
-    cin >> response;
-    if (response == ">=") {
-      cout << "! " << i << endl << flush;
-      return 0;
-    }
-  }
-}

rbx/testdata/interactive/sols/main.cpp

@@ -1,26 +0,0 @@
-#include <cstdio>
-#include <cstring>
-
-using namespace std;
-
-int main() {
-  int n;
-  scanf("%d", &n);
-
-  int l = 1, r = n;
-  while (l != r) {
-    int mid = (l + r + 1) / 2;
-    printf("%d\n", mid);
-    fflush(stdout);
-
-    char response[3];
-    scanf("%s", response);
-    if (strcmp(response, "<") == 0)
-      r = mid - 1;
-    else
-      l = mid;
-  }
-
-  printf("! %d\n", l);
-  fflush(stdout);
-}

rbx/testdata/interactive/testplan.txt

@@ -1,6 +0,0 @@
-gen 10 0
-gen 100 0
-gen 1000 0
-gen 10000 0
-gen 100000 0
-gen 1000000 0

rbx/testdata/interactive/validator.cpp

@@ -1,16 +0,0 @@
-#include "testlib.h"
-#include <bits/stdc++.h>
-
-using namespace std;
-
-int main(int argc, char *argv[]) {
-  registerValidation(argc, argv);
-
-  int x = inf.readInt(1, 1000 * 1000, "x");
-  inf.readSpace();
-  int n = inf.readInt(1, 1000 * 1000, "n");
-  inf.readEoln();
-  ensure(x <= n);
-
-  inf.readEof();
-}