Cod sursa(job #1104310)
| Utilizator | Data | 10 februarie 2014 18:06:06 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long long v[500001];
int n,k,a,b;
void sol(void)
{
int i,j,y;
long long nr=0;
f>>n>>k>>a>>b;
for(i=1;i<b;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
}
for(int i=b;i<=n;i++)
{
f>>v[i];
v[i]=v[i]+v[i-1];
for(j=b;j>=a;j--)
{
y=v[i]-v[i-j];
if(y%k==0)
nr++;
}
}
g<<nr;
}
int main()
{
sol();
return 0;
}
