zoukankan      html  css  js  c++  java
  • Codeforces Round #340 (Div. 2) A. Elephant 水题

    A. Elephant

    题目连接:

    http://www.codeforces.com/contest/617/problem/A

    Descriptionww.co

    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(x > 0) 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 (1 ≤ x ≤ 1 000 000) — 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.

    Sample Input

    6

    Sample Output

    2

    Hint

    题意

    给你一个数x,然后让你输出x/5的向上取整

    题解:

    输出(x+4)/5就好了

    代码

    #include<bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        long long x;
        cin>>x;
        cout<<(x+4)/5<<endl;
    }
  • 相关阅读:
    读取xml文件到实体
    dev常用控件的属性
    委托和事件
    GridControl应用
    关于DataTable的处理
    SQL2
    xaml地址写法
    sql临时表的创建及赋值
    wpf 图片缩放
    NIO简介
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5156286.html
Copyright © 2011-2022 走看看