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;
int main(){
int n, p, q;
cin >> n >> p >> q;
long long ans, tol[n + 5];
for(int i = 1; i <= n; i++){
cin >> tol[i - 1];
tol[i] += tol[i - 1];
}
for(int i = 2; i < n; i++){
if(p >= n || q >= n || p + (q * 1) >= n){
cout << 1 << endl;
break;
}
else{
ans = (p * i) + (q * i * 2);
if(ans >= n){
cout << i << endl;
break;
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |