# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626654 | Elnady | Vudu (COCI15_vudu) | C++17 | 1079 ms | 25536 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;
#define endl '\n'
#define int long long
#define all(pr1) pr1.begin(),pr1.end()
#define alr(pr1) pr1.rbegin(),pr1.rend()
#define CEIL(pr1, pr2) (pr1 + pr2 - 1) / pr2
#define IOS std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sz(s) (long long)(s.size())
const long long N = 45 + 9, M = 1e9 + 9, MOD = 1e9 + 7, OO = 0x3f3f3f3f, MAX = 2147483647, LOO = 0x3f3f3f3f3f3f3f3f;
int32_t main()
{
IOS;
int n, k;
cin >> n;
vector<int> a(n), pre(n + 1);
pre[0] = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
pre[i + 1] = pre[i] + a[i];
}
cin >> k;
int ans = 0;
for (int i = 0; i < n; i++)
{
for (int j = i; j < n; j++)
{
int x = (pre[j + 1] - pre[i]) / (j - i + 1);
if (x >= k)
ans++;
}
}
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |