# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
746077 | MuntherCarrot | Rainforest Jumps (APIO21_jumps) | C++14 | 0 ms | 0 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 "jumps.h"
// using namespace std;
// #define ll long long
// #define endl '\n'
// #define all(x) x.begin(),x.end()
// const int MOD = 1e9 + 7, SZ = 1e5 + 10, MX = 1e9;
void init(int n, int arr[]){
}
int minimum_jumps(int a, int b, int c, int d){
return c - b;
}
// int32_t main(){
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// int n, q;
// cin >> n >> q;
// int arr[n];
// for(int &i : arr)
// cin >> i;
// init(n, arr);
// while(q--){
// int a, b, c, d;
// cin >> a >> b >> c >> d;
// cout << minimum_jumps(a, b, c, d) << endl;
// }
// return 0;
// }