zoukankan      html  css  js  c++  java
  • codeforces 723A : The New Year: Meeting Friends

    Description

    There are three friend living on the straight line Ox in Lineland. The first friend lives at the point x1, the second friend lives at the point x2, and the third friend lives at the point x3. They plan to celebrate the New Year together, so they need to meet at one point. What is the minimum total distance they have to travel in order to meet at some point and celebrate the New Year?

    It's guaranteed that the optimal answer is always integer.

    Input

    The first line of the input contains three distinct integers x1, x2 and x3 (1 ≤ x1, x2, x3 ≤ 100) — the coordinates of the houses of the first, the second and the third friends respectively.

    Output

    Print one integer — the minimum total distance the friends need to travel in order to meet together.

    Examples
    Input
    7 1 4
    Output
    6
    Input
    30 20 10
    Output
    20
    Note

    In the first sample, friends should meet at the point 4. Thus, the first friend has to travel the distance of 3 (from the point 7 to the point 4), the second friend also has to travel the distance of 3 (from the point 1 to the point 4), while the third friend should not go anywhere because he lives at the point 4.

     

    正解:模拟

    解题报告:

      水题,模拟即可。

     1 //It is made by jump~
     2 #include <iostream>
     3 #include <cstdlib>
     4 #include <cstring>
     5 #include <cstdio>
     6 #include <cmath>
     7 #include <algorithm>
     8 #include <ctime>
     9 #include <vector>
    10 #include <queue>
    11 #include <map>
    12 #include <set>
    13 using namespace std;
    14 typedef long long LL;
    15 const int inf = (1<<30);
    16 int a[4];
    17 int pos;
    18 int ans;
    19 
    20 inline int getint()
    21 {
    22     int w=0,q=0; char c=getchar();
    23     while((c<'0' || c>'9') && c!='-') c=getchar(); if(c=='-') q=1,c=getchar(); 
    24     while (c>='0' && c<='9') w=w*10+c-'0', c=getchar(); return q ? -w : w;
    25 }
    26 
    27 inline void work(){
    28     for(int i=1;i<=3;i++) a[i]=getint();
    29     sort(a+1,a+4); ans+=a[2]-a[1]; ans+=a[3]-a[2];
    30     printf("%d",ans);
    31 }
    32 
    33 int main()
    34 {
    35     work();
    36     return 0;
    37 }
  • 相关阅读:
    2,进程----multiprocessing模块介绍
    1,进程----进程理论知识
    对ORM的理解
    对queryset的理解
    个人总结-10-代码测试整合
    个人总结-9-session的使用,十天免登陆
    个人总结-8-重新写注册和登录界面
    个人总结-7- 实现图片在MySQL数据库中的存储,取出以及显示在jsp页面上
    从人机交互看对搜狗输入法的使用感受
    个人总结6-验证码制作总结
  • 原文地址:https://www.cnblogs.com/ljh2000-jump/p/5933823.html
Copyright © 2011-2022 走看看