Cod sursa(job #679482)
| Utilizator | Data | 13 februarie 2012 12:47:23 | |
|---|---|---|---|
| Problema | Divk | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#define NR 500001
using namespace std;
int v[NR],k2,a,b,n,div2;
void citire()
{
ifstream fin("divk.in");
fin>>n>>k2>>a>>b;
for(int i=1;i<=n;i++)
{
int x;
fin>>v[i];
//v[i]=(v[i-1]+x%k)%k;
}
}
int main()
{
citire();
for(int i=1;i<=n-a+1;i++)
{
int s=0;
for(int k=0;k<a-1;k++)
s+=v[i+k];
for(int j=a;j<=b && i+j-1<=n;j++)
{
s+=v[i+j-1];
if(s%k2==0) div2++;
}
}
ofstream fout("divk.out");
fout<<div2;
return 0;
}