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

rbx/testdata/box1/gen2.cpp

@@ -1,9 +0,0 @@
-#include "testlib.h"
-
-using namespace std;
-
-int main(int argc, char *argv[]) {
-    registerGen(argc, argv, 1);
-
-    println(opt<int>(1));
-}

rbx/testdata/box1/genScript.py

@@ -1,2 +0,0 @@
-print('gen2 25')
-print('gen2 1000000000')

rbx/testdata/box1/hard-tle.sol.cpp

@@ -1,26 +0,0 @@
-#include <bits/stdc++.h>
-#include <ctime>
-
-using namespace std;
-
-void busy_loop() {
-  double wait = 5.0;
-  int start = clock();
-  int end = clock();
-  while (((double) (end - start)) / CLOCKS_PER_SEC < wait)
-  {
-    end = clock();
-  }
-}
-
-int32_t main() {
-    ios::sync_with_stdio(false);
-    cin.tie(0);
-
-    int n; cin >> n;
-
-    busy_loop();
-
-    cout << "hard" << endl;
-    return 0;
-}

rbx/testdata/box1/ole.cpp

@@ -1,17 +0,0 @@
-
-#include <bits/stdc++.h>
-
-using namespace std;
-
-int32_t main() {
-  ios::sync_with_stdio(false);
-  cin.tie(0);
-
-  int n;
-  cin >> n;
-
-  for (int i = 1; i <= 100000; i++) { // more than output limit of 100kb
-    cout << 123456 << "\n";
-  }
-  return 0;
-}

rbx/testdata/box1/problem.rbx.yml

@@ -1,39 +0,0 @@
----
-name: "test-problem"
-timeLimit: 1000
-memoryLimit: 256
-outputLimit: 100 # 100 kb
-generators:
-  - name: "gen1"
-    path: "gen1.cpp"
-  - name: "gen2"
-    path: "gen2.cpp"
-validator:
-  path: "validator.cpp"
-testcases:
-  - name: "gen1"
-    testcaseGlob: "tests/*.in"
-    subgroups:
-      - name: "gen"
-        generators:
-          - name: "gen1"
-          - name: "gen2"
-            args: "424242"
-      - name: "genScript"
-        generatorScript:
-          path: "genScript.py"
-solutions:
-  - path: "sol.cpp"
-    outcome: "ac"
-  - path: "wa.sol.cpp"
-    outcome: "fail"
-  - path: "re.sol.cpp"
-    outcome: "rte"
-  - path: "tle.sol.cpp"
-    outcome: "tle"
-  - path: "tle-and-incorrect.sol.cpp"
-    outcome: "tle"
-  - path: "hard-tle.sol.cpp"
-    outcome: "tle"
-  - path: "ole.cpp"
-    outcome: "ole"

rbx/testdata/box1/re.sol.cpp

@@ -1,23 +0,0 @@
-#include <bits/stdc++.h>
-
-using namespace std;
-
-int32_t main() {
-    ios::sync_with_stdio(false);
-    cin.tie(0);
-
-    int n; cin >> n;
-
-    vector<int> divisors;
-    assert(false);
-    for(int i = 0; i*i <= n; i++) {
-      if (n % i == 0) {
-        divisors.push_back(i);
-        divisors.push_back(n/i);
-      }
-    }
-
-    sort(divisors.begin(), divisors.end());
-    for (int x : divisors) cout << x << '\n';
-    return 0;
-}

rbx/testdata/box1/sol.cpp

@@ -1,22 +0,0 @@
-#include <bits/stdc++.h>
-
-using namespace std;
-
-int32_t main() {
-    ios::sync_with_stdio(false);
-    cin.tie(0);
-
-    int n; cin >> n;
-
-    vector<int> divisors;
-    for(int i = 1; i*i <= n; i++) {
-      if (n % i == 0) {
-        divisors.push_back(i);
-        if (i != n/i) divisors.push_back(n/i);
-      }
-    }
-
-    sort(divisors.begin(), divisors.end());
-    for (int x : divisors) cout << x << '\n';
-    return 0;
-}

rbx/testdata/box1/tests/1.in

@@ -1 +0,0 @@
-777

rbx/testdata/box1/tle-and-incorrect.sol.cpp

@@ -1,33 +0,0 @@
-#include <bits/stdc++.h>
-#include <ctime>
-
-using namespace std;
-
-void busy_loop() {
-  double wait = 1.0;
-  int start = clock();
-  int end = clock();
-  while (((double) (end - start)) / CLOCKS_PER_SEC < wait)
-  {
-    end = clock();
-  }
-}
-
-int32_t main() {
-    ios::sync_with_stdio(false);
-    cin.tie(0);
-
-    int n; cin >> n;
-    busy_loop();
-
-    vector<int> divisors;
-    for(int i = 1; i*i <= n; i++) {
-      if (n % i == 0) {
-        divisors.push_back(i);
-      }
-    }
-
-    sort(divisors.begin(), divisors.end());
-    for (int x : divisors) cout << x << '\n';
-    return 0;
-}

rbx/testdata/box1/tle.sol.cpp

@@ -1,35 +0,0 @@
-#include <bits/stdc++.h>
-#include <ctime>
-
-using namespace std;
-
-void busy_loop() {
-  double wait = 1.0;
-  int start = clock();
-  int end = clock();
-  while (((double) (end - start)) / CLOCKS_PER_SEC < wait)
-  {
-    end = clock();
-  }
-}
-
-int32_t main() {
-    ios::sync_with_stdio(false);
-    cin.tie(0);
-
-    int n; cin >> n;
-
-    busy_loop();
-
-    vector<int> divisors;
-    for(int i = 1; i*i <= n; i++) {
-      if (n % i == 0) {
-        divisors.push_back(i);
-        if (i != n/i) divisors.push_back(n/i);
-      }
-    }
-
-    sort(divisors.begin(), divisors.end());
-    for (int x : divisors) cout << x << '\n';
-    return 0;
-}

rbx/testdata/box1/validator.cpp

@@ -1,11 +0,0 @@
-#include "testlib.h"
-
-using namespace std;
-
-int main(int argc, char *argv[]) {
-    registerValidation(argc, argv);
-
-    inf.readInt(1, 1'000'000'000, "n");
-    inf.readEoln();
-    inf.readEof();
-}

rbx/testdata/box1/wa.sol.cpp

@@ -1,22 +0,0 @@
-#include <bits/stdc++.h>
-
-using namespace std;
-
-int32_t main() {
-    ios::sync_with_stdio(false);
-    cin.tie(0);
-
-    int n; cin >> n;
-
-    vector<int> divisors;
-    for(int i = 1; i*i <= n; i++) {
-      if (n % i == 0) {
-        divisors.push_back(i);
-        divisors.push_back(n/i);
-      }
-    }
-
-    sort(divisors.begin(), divisors.end());
-    for (int x : divisors) cout << x << '\n';
-    return 0;
-}

rbx/testdata/caching/executable.py

@@ -1 +0,0 @@
-print(42)

rbx/testdata/interactive/checker.cpp

@@ -1,21 +0,0 @@
-#include "testlib.h"
-
-int main(int argc, char *argv[]) {
-  registerTestlibCmd(argc, argv);
-
-  int oufq = ouf.readInt();
-  int ansq = ans.readInt();
-
-  if (ansq > 25)
-    quitf(_fail, "Limit is %d, but main solution have made %d queries", 25,
-          ansq);
-
-  if (oufq > 25)
-    quitf(_wa, "Limit is %d, but solution have made %d queries", 25, oufq);
-
-  int n = inf.readInt();
-  int m = inf.readInt();
-  quitf(_ok,
-        "Number %d is guessed successfully (range [1..%d]) with %d queries", n,
-        m, oufq);
-}

rbx/testdata/interactive/gen.cpp

@@ -1,11 +0,0 @@
-#include "testlib.h"
-#include <bits/stdc++.h>
-
-using namespace std;
-
-int main(int argc, char *argv[]) {
-  registerGen(argc, argv, 1);
-  int n = atoi(argv[1]);
-  int t = atoi(argv[2]);
-  cout << rnd.wnext(1, n, t) << ' ' << n << endl;
-}

rbx/testdata/interactive/interactor.cpp

@@ -1,63 +0,0 @@
-#include "testlib.h"
-#include <bits/stdc++.h>
-
-using namespace std;
-
-void upd(int &lf, int &rg, int x, int y) {
-  if (x > y)
-    return;
-  lf = max(lf, x);
-  rg = min(rg, y);
-}
-
-void send(string x) {
-  cout << x << endl;
-  fflush(stdout);
-}
-
-const int INF = 1000'000'000;
-
-int main(int argc, char *argv[]) {
-  registerInteraction(argc, argv);
-
-  int x = inf.readInt();
-  int n = inf.readInt();
-  cout << n << endl << flush;
-  int lf = 1, rg = n;
-
-  int queries = 0;
-  while (true) {
-    bool is_answer = false;
-    string cur = ouf.readToken("!|[1-9][0-9]{0,8}");
-    int last;
-    if (cur != "!") {
-      InStream tmp(ouf, cur);
-      last = tmp.readInt(-INF, INF);
-      queries++;
-    } else {
-      is_answer = true;
-      last = ouf.readInt(-INF, INF);
-    }
-
-    if (last < 1 || last > n)
-      quitf(_pe, "number %d from stdin is out of range [%d, %d]", last, 1, n);
-
-    if (is_answer) {
-      if (last == x && lf == rg) {
-        tout << queries << endl;
-        quitf(_ok, "number is guessed.");
-      } else if (last == x && lf != rg)
-        quitf(_wa, "number is but it was made in a random way");
-      else
-        quitf(_wa, "guessed number is incorrect");
-    }
-
-    if (x < last) {
-      send("<");
-      upd(lf, rg, 1, last - 1);
-    } else {
-      send(">=");
-      upd(lf, rg, last, n);
-    }
-  }
-}

rbx/testdata/interactive/problem.rbx.yml

@@ -1,40 +0,0 @@
----
-name: "test-problem"
-type: communication
-timeLimit: 1000
-memoryLimit: 256
-outputLimit: 100 # 100 kb
-checker:
-  path: "checker.cpp"
-interactor:
-  path: "interactor.cpp"
-generators:
-  - name: "gen"
-    path: "gen.cpp"
-validator:
-  path: "validator.cpp"
-testcases:
-  - name: "tests"
-    generatorScript:
-      path: "testplan.txt"
-solutions:
-  - path: "sols/main.cpp"
-    outcome: AC
-  - path: "sols/interactive-binary-search_mm_naive_cin.cpp"
-    outcome: INCORRECT
-  - path: "sols/af_tl_after_ans.cpp"
-    outcome: TLE
-  - path: "sols/af_wa.cpp"
-    outcome: WA
-  - path: "sols/af_ac_pe.cpp"
-    outcome: WA
-  - path: "sols/af_ac_re.cpp"
-    outcome: RE
-  - path: "sols/af_ml.cpp"
-    outcome: ML
-  - path: "sols/af_inf_cout_without_flush.cpp"
-    outcome: TLE
-  - path: "sols/af_inf_cout_with_flush.cpp"
-    outcome: TLE
-  - path: "sols/af_ac_too_many_iter.cpp"
-    outcome: INCORRECT

rbx/testdata/interactive/sols/af_ac_pe.cpp

@@ -1,75 +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 (lf != rg) {
-    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 > 15)
-    cout << "!!";
-  cout << "! " << lf << endl;
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}

rbx/testdata/interactive/sols/af_ac_re.cpp

@@ -1,76 +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 (lf != rg) {
-    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 > 15)
-      assert(false);
-  }
-
-  cout << "! " << lf << endl;
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}

rbx/testdata/interactive/sols/af_ac_too_many_iter.cpp

@@ -1,72 +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--;
-    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_inf_cout_with_flush.cpp

@@ -1,79 +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;
-        fflush(stdout);
-      }
-    }
-  }
-  cout << "! " << lf << endl;
-}
-
-int main() {
-  srand(time(NULL));
-  cerr << setprecision(10) << fixed;
-  assert(read());
-  solve();
-  return 0;
-}