Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int main(){
- long int N,K,T,i,j,contador,contadorr=0,minimo;
- scanf("%ld %ld %ld",&N,&K,&T);
- long int vec[N];
- for(i=0;i<N;i++){
- scanf("%ld",&vec[i]);
- }
- if(K%2==0){
- minimo=(K/2);
- }
- else{
- minimo=(K+1)/2;
- }
- for(i=0;i<N-K+1;i++){
- contador=0;
- for(j=i;j<i+K;j++){
- if(vec[j]>=T){
- contador++;
- }
- }
- if(contador>=minimo){
- contadorr++;
- }
- }
- printf("%ld\n",contadorr);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement