Cod sursa(job #689630)
| Utilizator | Data | 24 februarie 2012 18:18:57 | |
|---|---|---|---|
| Problema | Divk | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("divk.in");
ofstream out("divk.out");
const int N=500001;
const int K=100000;
int k,a,b,n;
int s[N];
long long rez;
vector <int> v[K];
int main(){
int i,j,k,x;
in>>n>>k>>a>>b;
for(i=1;i<=n;++i){
in>>x;
s[i]=(s[i-1]+x)%k;
if(s[i]==0 && i>=a && i<=b )
rez++;
}
for(i=a;i<=b;++i){
for(j=1;j<=n-i;++j){
if(s[j]==s[i+j])
rez++;
}
}
out<<rez;
return 0;
}
