Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <algorithm>
- #include <iostream>
- #include <cstdlib>
- #include <cstring>
- #include <cassert>
- #include <complex>
- #include <cstdio>
- #include <vector>
- #include <cctype>
- #include <string>
- #include <ctime>
- #include <cmath>
- #include <set>
- #include <map>
- typedef long double LD;
- typedef long long LL;
- using namespace std;
- #define sz(A) (int)(A).size()
- #define mp make_pair
- #define pb push_back
- const int GROUP = 3, N = int(1e6), START = 7;
- bool used[N];
- vector<string> gens;
- int prev = 0;
- int main() {
- srand(time(NULL));
- string name;
- while (cin >> name)
- gens.pb(name);
- for (int i = 0; i < sz(gens); i++) {
- for (int j = 0; j < GROUP; j++) {
- int r = rand();
- while (used[r]) r = rand();
- cout << gens[i] << " " << r << " > " << prev + j + START << endl;
- }
- prev += GROUP;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement