Programming questions (continuously updated)

 

One 、 Xiaoming is hijacked by unknown forces . After being thrown to x There's no more space for star stations . Xiao Ming learned that every day there are spaceships flying to the earth , But you need 108 A ticket for $1 , And he's broke .

He decided to be in x Star Wars work . The kind-hearted boss promised to pay for food and accommodation , The first 1 God give it to him 1 Yuan .

also , Every day after that is better than the previous one - More days 2 Yuan , Until he has enough money to buy the ticket .

Please program to calculate how many days Xiaoming will be able to make up 108 element , Back to earth .

 

 

javascript Familiar with , Use javascript, In fact, it's almost the same in any language

【 The question 】

 //   Need to save  108 A ticket for $1

        //   The first day     1 element

        //   the second day     1+2

        //   On the third day     1+2+2

        //   On the third day     1+2+2+2

        //   How many days can I save 108 element ( Every day's money adds up )

 

 

 【 Code 】

var m = 1;
        var sum = 0;
        for (let i = 1; sum < 108; i++) {
            if (i > 1) {
                m = m + 2;  // More money per day 2 element 
            }

            sum = m + sum;  // The money accumulated every day 

            console.log(" How many days does it take ：", i, " Money per day ：", m, " What's the total cost? ", sum)

            //  console.log(i)
            if (sum >= 108) {
                // console.log(i)
            }

        }

 

 

【 analysis 】

 

if (i > 1) {

                m = m + 2;  // More money per day 2 element      //  Note that there   Don't go on the first day +2  , The first day 1, otherwise , Calculate the i Namely 10 You can save enough money in a day , That is to say, only one yuan on the first day counts as one day

            }

【 result 】

 

Ongoing update , I've been learning some basics recently , And some simple algorithms , Brush up on logic