Cod sursa(job #2173636)
| Utilizator | Data | 15 martie 2018 23:16:42 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int K , A , B , N , T , i , j , t , v[100000] , s;
ifstream f("divk.in");
ofstream g("divk.out");
f>>N>>K>>A>>B;
T=0;
for(i=0;i<N;i++)
f>>v[i];
for(i=0;i<N;i++)
{
s=0;
for(j=i;j<N;j++)
{
if(j-i+1>=A&&j-i+1<=B)
s=s+v[j];
}
if(s%K==0&&s!=0)
T++;
}
g<<T;
f.close();
g.close();
return 0;
}
