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;
    }

    解题报告:

  • 相关阅读:
    laravel 5.5 仓库模式 文件之间接口与实现操作
    php 无线分类 根据子级找父级
    php 无限极分类,根据父级 找子级
    laravel5.4 中 dd和dump的区别。
    laravel hash密码生成和密码验证
    oracle建表详细信息
    关于组件的认识
    java的Thread Dump诊断工具
    weblogic连接池
    详解Oracle数据字典
  • 原文地址:https://www.cnblogs.com/liaoguifa/p/2941657.html
Copyright © 2011-2022 走看看