Cod sursa(job #2877937)
Utilizator | Data | 25 martie 2022 17:08:57 | |
---|---|---|---|
Problema | Secventa 5 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Teme Pregatire ACM Unibuc 2014, Anul I | Marime | 0.29 kb |
#include<iostream>
using namespace std;
int main(){
int N,L,U,v[1000],i;
int sol=0,c;
cin>>N>>L>>U;
for(i=0;i<N;i++)
cin>>v[i];
for(i=-1;i<N-1;i++){
for(int k=i+2;k<N;k++){
c=1;
if(v[k]!=v[i+1])
c++;
if(L<=c && c<=U)
sol++;
}
}
cout<<sol;
return 0;
}