Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- ▄███████▀▀▀▀▀▀███████▄
- ░▐████▀▒ЗАПУСКАЕМ▒▀██████▄
- ░███▀▒▒▒▒▒ДЯДЮ▒▒▒▒▒▒▀█████
- ░▐██▒▒▒▒▒▒БОГДАНА▒▒▒▒▒████▌
- ░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
- ░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
- ░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
- ░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
- ░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
- ░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
- ░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
- ░░░░▄██████████████▒▒▐▌
- ░░░▀███▀▀████▀█████▀▒▌
- ░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
- ░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
- */
- #include <iostream>
- #include <vector>
- #include <string>
- #include <algorithm>
- #include <cstdio>
- #include <numeric>
- #include <cstring>
- #include <ctime>
- #include <cstdlib>
- #include <set>
- #include <map>
- #include <unordered_map>
- #include <unordered_set>
- #include <list>
- #include <cmath>
- #include <bitset>
- #include <cassert>
- #include <queue>
- #include <stack>
- #include <deque>
- #include <cassert>
- #include <iomanip>
- #include <random>
- using namespace std;
- #define ll long long
- #define ld long double
- #define null NULL
- #define prev prev228
- #define count count228
- #define index index228
- #define left left228
- #define right right228
- #define hash hash228
- #define cost cost228
- random_device kek;
- int a[1000001], b[1000001], c[1000001];
- signed main() {
- int n = 100 * 1000;
- int m = 100 * 1000;
- for (int i = 1; i <= n; ++i) {
- a[i] = kek() % 100;
- }
- for (int i = 1; i <= m; ++i) {
- b[i] = kek() % 100;
- }
- cout << n << " " << m << endl;
- for (int i = 1; i <= n; ++i) {
- cout << a[i] << " ";
- }
- cout << endl;
- for (int i = 1; i <= m; ++i) {
- cout << b[i] << ' ';
- }
- cout << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment