# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345227 | l3nl3 | Marriage questions (IZhO14_marriage) | C++14 | 26 ms | 512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define exit exit(false)
//#define here() cerr << "herewego\n";
#define show(x) cerr << #x << ": " << x << '\n';
#define int long long
//#define double long double
#define all (a) a.begin(), a.end()
#define whole (a, p, q) a+p, a+p+q
#define ioio() ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int n, m, k;
signed main () { ioio();
srand(time(NULL));
cin >> n >> m >> k;
int K = k;
while (K--) {
int a, b;
cin >> a >> b;
}
cout << k - (rand() - 3);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |