You are on page 1of 2

#include <iostream>

#include <iomanip>

using namespace std;

int cauta(int v[1025], int p1, int p2, int x)


{
for(int i=p1; i<=p2; i++)
if(v[i]==x)
return 1;

return 0;

int main()
{
int v[1025],c1[1500],c0[1500],n1,n0,i,j,n,k,p1,p2;

cin>>n>>k;

for(i=0; i<n; i++)


cin>>v[i];

n0=n1=0;

c0[n0]=0;
n0++;

c1[n1]=1;
n1++;

for(i=0; i<n; i=i+k)


{ if((i+k-1) > n)
{p1=i;
p2=n-1;}

else

{ p1=i;
p2=i+k-1;}

if(cauta(v,p1,p2,1)==0)
{ c0[n0]=0;
n0++;
}

else

{
c0[n0++]=1;
for(j=p1; j<=p2; j++)
{c0[n0]=v[j];
n0++;}

if(cauta(v,p1,p2,0)==0)
{c1[n1]=1;
n1++;
}
else

{
c1[n1++]=0;
for(j=p1; j<=p2; j++)
c1[n1++]=v[j];

if(float(n)/n0>=float(n)/n1)
{
cout<<fixed<<setprecision(2)<<float(n)/n0<<endl;
for(i=0; i<n0; i++)
cout<<c0[i]<<endl;

else

{
cout<<fixed<<setprecision(2)<<float(n)/n1<<endl;
for(i=0;i<n1;i++)
cout<<c1[i]<<endl;

return 0;

You might also like