/// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n;
map < pair <int, int>, bool> ok;
int get(int x) {
return rand() % x + 1;
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "w", stdout);
#endif
srand(time(0));
n = 9;
cout << n << nl;
for (int i = 2; i <= n; i++) {
int v = get(i - 1);
ok[{v, i}] = ok[{i, v}] = 1;
cout << v << ' ' << i << nl;
}
while (1) {
int v = get(n), u = get(n);
while (v == u || ok.count({v, u})) {
v = get(n), u = get(n);
}
cout << v << ' ' << u, ioi
}
ioi
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
