Cod sursa(job #730368)
| Utilizator | Data | 6 aprilie 2012 10:55:37 | |
|---|---|---|---|
| Problema | Divk | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int n,k,a,b,i,s,v1[500],v2[500],v3[500];
int main ()
{
ifstream fin("divk.in");
fin>>n>>k>>a>>b;
for(i=0;i<n;i++)
fin>>v1[i];
fin.close();
for(i=0;i<n;i++)
v2[i]=(v2[i-1]+v1[i])%k;
for(i=0;i<n;i++)
{
if((i+1)-a>=0)
++v3[v2[(i+1)-a]];
if((i+1)-b>0)
--v3[v2[(i+1)-b-1]];
s=s+v3[v2[i]];
}
ofstream fout("divk.out");
fout<<s;
fout.close();
return 0;
}