Cod sursa(job #953359)
| Utilizator | Data | 25 mai 2013 20:30:51 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{
int n,k,a,b,s=0;
vector<int> r,sm(1,0);
f>>n>>k>>a>>b;
r.insert(r.begin(),k,0);
long long sol=0;
for(int i=1;i<=n;i++){
int x;
f>>x;
s=(s+x)%k;
sm.push_back(s);
if(i-a>=0)
r[sm[i-a]]++;
if(i-b>0)
r[sm[i-b-1]]--;
sol+=r[s];
}
g<<sol;
return 0;
}
