Code forces problem A. Elephant : C++ Problem-Solving
An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.
Input
The first line of the input contains an integer x The coordinate of the friend's house.
Output
Print the minimum number of steps that elephant needs to make to get from point 0 to point x.
----------------------------------------------------------------
problem #elephant 💡
Subscribe to see more ✔
Problem link 🔗
https://judge.beecrowd.com/en/problem...
LinkedIn account 🔗
/ ahmad-joba-772a61201
Facebook page 🔗
/ profile.phpid=61555793325064&viewas=&show_...
---------------------------------------------------------------------------------------------------------------
#code #codeforcessolutions #beecrowd #solution #programming #computerscience #problemsolving
In questa pagina del sito puoi guardare il video online Code forces problem A. Elephant : C++ Problem-Solving della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Ahmad Code 27 febbraio 2024, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 72 volte e gli è piaciuto 0 spettatori. Buona visione!
