# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345248 | pragmatist | Marriage questions (IZhO14_marriage) | C++14 | 28 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.
// turmak-_-
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define sz(a) a.size()
#define nl "\n"
#define IOI return 0;
#define pb push_back
#define ppb pop_back()
#define ll long long
#define ull unsigned long long
#define ld long double
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define X first
#define Y second
using namespace std;
const int N = (int)1e5 + 7 ;
const ll MOD = (ll)998244353;
const ll INF = (ll)1e18 + 7;
const int inf = (int)1e9 + 7;
pii dx[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
void solve() {
int n,m,k;
cin>>n>>m>>k;
for(int i=1; i<=k; ++i) {
int x,y;
cin>>x>>y;
}
int h = n*(n+1)/2;
cout<<rand() % h;
}
int main() {
IOS
srand(time(0));
//freopen("cinema.in", "r", stdin);
//freopen("cinema.out", "w", stdout);
int tt=1;
//cin>>tt;
while(tt--) {
solve();
}
IOI
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |