🔒 Closed Need help simple code about Emu8086

[Darkted]

Mga sir panu po gawin to Needko. lang sa Study nmin pa help po mga kuys...
Ganito po out put niya sa picture using loop

 

[fireclouu]

eto abstract:
1. determine mo yung line na may pinakamaraming asterisk (line 6) then calculate hanggang ilang asterisk meron para mabuo yung "head" ng arrow, gagamitin mo yung maximum count ng line 6 para sa placement ng asterisk ng line 1.
2 . from line 1 - 3, normal incrementation pero line 4-6, add up ka ng +5 iteration para sa "tail" ng arrow.
3. reverse mo lang yung step 2

note: fill mo na lang ng spaces para ma-align ng tama yung asterisk, pwede mo rin gamitan ng while loop 'yun para automatic nang mag fill ng space good luck!

 

[fireclouu]

Phew, eto ts, mamatay matay rin ako sa kakaisip pero eto version ko, baka sakali maimprove mo pa kung may gusto ka baguhin, salamat din sa konting brain twister hehe

        ///  Ilan ang lines na ginamit  ///
        int occupiedLines = 11;

       ///  Arrow  ///
        final int HEAD_MAX = 6;  //  Mas ok pala kung tawagin 'tong CENTER_POINT :)
        final int TAIL_MAX = 5;

       ///  Arrow Tail  ///
        final int TAIL_HI_MAX = 4;
        final int TAIL_LO_MAX = 8;

        for(int i = 1; i <= occupiedLines; i++){
            //  Pyramid shape arithmetics
            if (i <= HEAD_MAX)
            {
                for (int j = 1; j <= HEAD_MAX - i; j++)
                {
                    System.out.print(" ");
                }

                for(int k = 1; k <= i; k++) {
                    System.out.print("*");
                }
                //  Adding of tails (kung saang line dapat maikabit 'yung tail)
                if((i >= TAIL_HI_MAX)) {
                    for(int l = 1; l <= TAIL_MAX; l++) {
                        System.out.print("*");
                    }
                }
            } else {
                for (int j = 1; j <= i - HEAD_MAX; j++)
                {
                    System.out.print(" ");
                }

                for(int k = 1; k <= HEAD_MAX - (i - HEAD_MAX); k++) {
                    System.out.print("*");
                }
           
                if((i <= TAIL_LO_MAX)) {
                    for(int l = 1; l <= TAIL_MAX; l++) {
                        System.out.print("*");
                    }
                }
            }
        
            // Print new line kada matapos ang arithmetics
            System.out.println();

        }

Output:

/*
                Output:                  

                             *
                            **
                           ***
                          *********
                         **********
                        ***********
                         **********
                          *********
                           ***
                            **
                             *

*/

 

[Darkted]

Phew, eto ts, mamatay matay rin ako sa kakaisip pero eto version ko, baka sakali maimprove mo pa kung may gusto ka baguhin, salamat din sa konting brain twister hehe

        ///  Ilan ang lines na ginamit  ///
        int occupiedLines = 11;

       ///  Arrow  ///
        final int HEAD_MAX = 6;
        final int TAIL_MAX = 5;

       ///  Arrow Tail  ///
        final int TAIL_HI_MAX = 4;
        final int TAIL_LO_MAX = 8;

        for(int i = 1; i <= occupiedLines; i++){
            //  Pyramid shape arithmetics
            if (i <= HEAD_MAX)
            {
                for (int j = 1; j <= HEAD_MAX - i; j++)
                {
                    System.out.print(" ");
                }

                for(int k = 1; k <= i; k++) {
                    System.out.print("*");
                }
                //  Adding of tails (kung saang line dapat maikabit 'yung tail)
                if((i >= TAIL_HI_MAX)) {
                    for(int l = 1; l <= TAIL_MAX; l++) {
                        System.out.print("*");
                    }
                }
            } else {
                for (int j = 1; j <= i - HEAD_MAX; j++)
                {
                    System.out.print(" ");
                }

                for(int k = 1; k <= HEAD_MAX - (i - HEAD_MAX); k++) {
                    System.out.print("*");
                }
          
                if((i <= TAIL_LO_MAX)) {
                    for(int l = 1; l <= TAIL_MAX; l++) {
                        System.out.print("*");
                    }
                }
            }
       
            // Print new line kada matapos ang arithmetics
            System.out.println();

        }

Output:

/*
                Output:                 

                             *
                            **
                           ***
                          *********
                         **********
                        ***********
                         **********
                          *********
                           ***
                            **
                             *

*/

EMUU8086 ba gamit mo kuya ? cge tryko atleast my idea nko sa mga codes

 

[fireclouu]

Nope, java, pero 8086? nagbasa ako ng kaunti, assembly? may kaunting alam ako sa intel 8080, kung related man silang dalawa, kasi ito side project emulation ko

 

[Darkted]

Nope, java, pero 8086? nagbasa ako ng kaunti, assembly? may kaunting alam ako sa intel 8080, kung related man silang dalawa, kasi ito side project emulation ko

hehe Thanks kuya