Nu aveti permisiuni pentru a descarca fisierul shift2.jpg
Cod sursa(job #46952)
Utilizator | Data | 3 aprilie 2007 11:28:13 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.91 kb |
#include<fstream>
using namespace std;
long int n,a,b,k,t;
long int s[500005];
int main()
{
ifstream in("divk.in");
in>>n>>k>>a>>b;
int i,ok,j;
long int x;
ofstream out("divk.out");
for (i=1;i<=n;i++)
{
in>>x;
s[i]=s[i-1]+x;
ok=0;
if (i-b+1>0)
x=i-b+1;
else
x=n;
for (j=x;j<i;j++)
if ((s[i]-s[j])%k==0)// && j-i>=a && j-i<=b)
{
t++;
out<<j<<" "<<i<<" "<<s[i]-s[j]<<"\n";
}
if (s[i]%k==0 && i<=b)
{
t++;
out<<i<<" - "<<s[i]<<"\n";
}
}
in.close();
//ofstream out("divk.out");
out<<t;
out.close();
return 0;
}