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
Sur cette page du site, vous pouvez voir la vidéo en ligne Code forces problem A. Elephant : C++ Problem-Solving durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Ahmad Code 27 février 2024, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 72 fois et il a aimé 0 téléspectateurs. Bon visionnage!
