# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299951 | T0p_ | Watching (JOI13_watching) | C++14 | 1 ms | 384 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>
using namespace std;
long long arr[2020];
int main()
{
int n, p, q;
scanf(" %d %d %d",&n,&p,&q);
for(int i=1 ; i<=n ; i++)
scanf(" %lld",&arr[i]);
if(p+q >= n) printf("1\n");
else
{
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |