# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375932 | ponytail | Boxes with souvenirs (IOI15_boxes) | C++17 | 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 "boxes.h"
#define int long long
using namespace std;
int delivery(int N,int K,int L,int positions[]){
if(K==1){
return 0;
}
}
void solve(int test_case){
int N,K,L;
cin >> N >> K >> L;
int positions[N];
for(int i=0;i<N;i++)cin >> positions[i];
cout << delivery(N,K,L,positions) << "\n";
}
signed main(){
}