Anyone help me to solve this one.... 0 909 89098 7890987 678909876 56789098765 4567890987654 345678909876543 23445679098765432 1234567890987654321

Answer 1

/**
@date 03-10-2016
@author Hector Sulbaran
*/

#include <iostream>
using namespace std;

int main()
{
int num=9, max=9; //change these for more
int i,j,k,l;
int aux=0;

for (i=0;i<max;i++)
{
if(i == 0)
cout<<0<<endl;

for (j=0;j<1;j++)
{
for(l=num;l<=max;++l)
{
cout<<l;
}

cout<<0;

for(k=max;k>=(max-aux);k--)
{
cout<<k;
}
}
num--;
aux++;
cout<<endl;
}

return 0;
}

Answer 2

Beautiful pattern

Answer 3

https://code.sololearn.com/cf4D30fGdIZU/?ref=app

Answer 4

to