Cod sursa(job #586789)
| Utilizator |  Matei Vlad thelas |
Data | 2 mai 2011 21:52:48 |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int main()
{int n,k,a,b,v[100],i,p,s;
ifstream f("divk.in");
ofstream g("divk.out");
p=0;
s=0;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f>>v[i];
if ( a>b)
{i=a;
a=b;
b=i;}
i=1;
do
{s=v[i];
if (s%k!=0)
{s+=v[i+1];
i++;}
else
{p++;
a++;
i=a;}
}
while (a!=b);
g<<p;
f.close();
g.close();
}