Cod sursa(job #2101508)
Utilizator | Data | 7 ianuarie 2018 17:04:46 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int N, K, A, B, nr, V[500010],i,j;
int main()
{
f>>N>>K>>A>>B;
for (i = 1; i <= N; i++)
{
f>>V[i];
V[i]=(V[i] + V[i - 1])%pK;
}
for (i=A;i<=B;i++)
{
for (j=i;j<=N;j++)
{
if (V[j]==V[j-i])
nr++;
}
}
g<<nr<< '\n';
return 0;
}