# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
458033 | ZaZo_ | Vudu (COCI15_vudu) | C++17 | 1093 ms | 17664 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.
//Sorry but iam targeting IOI :))
//NEVER LOSE HOPE
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#define endl "\n"
#define ceil(a,b) (a+(b-1))/b
#define all(v) v.begin(),v.end()
#define int long long int
#define Hidden ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const int N=3e4+10,mod = 1e9+7;
int32_t main(){
int n;
cin>>n;
int arr[n];
int ans=0;
for(int i = 0 ; i < n ; i ++)
{
cin>>arr[i];
}
int p;
cin>>p;
for(int i = 0 ; i < n ; i ++)
{
int you=0,cnt=0;
for(int j = i ; j < n ;j ++)
{
you+=arr[j];
cnt++;
if(you/cnt>=p)
ans++;
}
}
cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |