Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "testlib.h"
- #include <algorithm>
- #include <cassert>
- #include <cmath>
- #include <deque>
- #include <iomanip>
- #include <iostream>
- #include <map>
- #include <queue>
- #include <set>
- #include <string>
- #include <time.h>
- #include <vector>
- using namespace std;
- const int INF = 1e9 + 228;
- const int MAXLEN = 62;
- vector<int> toBin(long long x)
- {
- vector<int> result;
- while (x)
- {
- result.push_back(x % 2);
- x /= 2;
- }
- reverse(result.begin(), result.end());
- return result;
- }
- void solve(int argc, char* argv[])
- {
- registerGen(argc, argv, 1);
- vector<int> A, B;
- long long a, b;
- a = rnd.next(0LL, (long long) 1e9);
- b = rnd.next(0LL, (long long) 1e9);
- cout << a << " " << b << endl;
- }
- int main(int argc, char* argv[])
- {
- #ifdef _DEBUG
- freopen("input.txt", "r", stdin);
- //freopen("output.txt", "w", stdout);
- #endif
- //srand(time(NULL));
- solve(argc, argv);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement