zoukankan      html  css  js  c++  java
  • Uva 846 Steps

    Steps

    One steps through integer points of the straight line.  The length of a step must be nonnegative and can be by one bigger than, equal to, or  by one smaller than the length of the previous step.

    What is the minimum number of steps in order to get from x to y?       

    The length of the first and the last step must be 1.

    Input and Output

    Input consists of a line containing n, the number of test cases.  For each test case, a line follows with two integers:  0$ \le$x$ \le$y < 231. For each test case, print a line giving the minimum number of steps to get from x to y.

    Sample Input

    3
    45 48
    45 49
    45 50
    

    Sample Output

    3
    3
    4
    

    Miguel Revilla 2002-06-15
     
    #include<stdio.h>
    #include<string.h>
    #include<math.h>
    int main()
    {
        int T, start, end, mid, leave, n, temp, sum;
        scanf("%d", &T);
        while(T--)
        {
            scanf("%d%d", &start, &end);
            leave = (end-start)%2;
            mid = (end-start)/2;
            n = (int)floor(sqrt(2.0*mid));
            if(n*(n+1)/2 - mid != 0) 
            {
                if(n*(n+1)/2 - mid > 0) n--;
                temp = mid - n*(n+1)/2;
                sum = 2*n;
                if(leave)
                {
                    if(temp*2+1 <= n+1) sum++;
                    else if(temp+1 <= n+1 || temp*2 <= n+1 ) sum += 2;
                    else sum += 3;
                }
                else
                {
                    if(temp*2 <= n+1) sum++;
                    else sum += 2;
                }
            } 
            else sum = 2*n+leave;
            printf("%d\n", sum);
        }
        return 0;
    }

    解题报告:

  • 相关阅读:
    基于NodeJS的全栈式开发
    Android 反编译apk 详解
    AngularJS 中文资料+工具+库+Demo 大搜集
    Mongodb集群搭建的三种方式
    Ubuntu下解决bash 没有那个文件或目录的方法
    ubuntu12.04 安装配置jdk1.7
    CentOS怎样查看系统信息
    Ubuntu 安装 Redis
    Redis快速入门
    js去掉双引号
  • 原文地址:https://www.cnblogs.com/liaoguifa/p/2941657.html
Copyright © 2011-2022 走看看