Cod sursa(job #673365)
Utilizator | Data | 4 februarie 2012 12:45:37 | |
---|---|---|---|
Problema | Divk | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
main()
{long N,K,A,B,v[500001],i,j,k=0,t,p;
f>>N>>K>>A>>B;
for(i=1;i<=N;i++)
{f>>v[i];}
for(i=A;i<=B;i++)
{for(j=1;j<=N-i+1;j++)
{t=0;
for(p=j;p<=j+i-1;p++)
{t=(t+v[p])%K;}
if(t==0)
k=k+1;
}}
g<<k;
return 0;
}