Cod sursa(job #2168659)
Utilizator | Data | 14 martie 2018 11:53:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("aiacucmmdc.in");
ofstream g("aiacucmmdc.out");
long long s[1000010];
long long p, n, nr, i, l;
int main()
{
f>>n>>p;
for (i=1; i<=n; i++)
f>>s[i];
for (i=1; i<=n; i++){
if (s[i]%p==0){
l++;
nr+=l;
} else {
l=0;
}
}
g<<nr;
return 0;
}