Pagini recente » Cod sursa (job #1433082) | Cod sursa (job #1320763) | Cod sursa (job #2636265) | Cod sursa (job #1358472) | Cod sursa (job #830788)
Cod sursa(job #830788)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int v[500001];
int n,k,a,b,p1,p2,nr;
int main()
{
fin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{fin>>v[i];
if(v[i]==a&&p1==0)
p1=i;
}
for(int i=n;i>0;i--)
if(v[i]==b&&p2==0)
p2=i;
int suma=0;
for(int i=p1;i<p2;i++)
{
suma=v[i];
for(int j=i+1;j<=p2;j++)
{
suma+=v[j];
if(i==p1&&j==p2);
else
if(suma%5==0)
{fout<<v[i]<<" "<<v[j]<<endl; nr++;
}
}
}
fout<<nr;
return 0;
}