Cod sursa(job #3207478)
Utilizator | Paraoanu Fabian Andrei FabianAndrei | Data | 26 februarie 2024 11:27:35 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
long long nr,n,i,k,a,b,j,sum,s[500005];
struct val
{
int vl,vs;
}v[500005];
int main()
{
cin>>n>>k>>a>>b;
for(i=1; i<=n; i++)
{
cin>>v[i].vl;
v[i].vs=v[i-1].vs+v[i].vl;
}
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if((v[i].vs-v[j].vs)%k==0)
{
nr++;
}
}
}
cout<<nr;
return 0;
}