# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146584 | tatas07 | Pizza (COCI21_pizza) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int n;
bool binsearch(int x){
int l=0;
int r=n-1;
while (l<=r)
{
int mid=(l+r)/2;
if(a[mid]<x){
l=mid+1;
}else if(a[mid]>x){
r=mid-1;
}else{
return false;
}
}
return true;
}
int main(){
cin>>n;
for (int i = 0; i < n; i++)
{
cin>>a[i];
}
int m;
cin>>m;
vector<int> bingkisan[m];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |