zoukankan      html  css  js  c++  java
  • hdu 4956 Poor Hanamichi BestCoder Round #5(数学题)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4956


    Poor Hanamichi

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 7    Accepted Submission(s): 4

    Problem Description
    Hanamichi is taking part in a programming contest, and he is assigned to solve a special problem as follow: Given a range [l, r] (including l and r), find out how many numbers in this range have the property: the sum of its odd digits is smaller than the sum of its even digits and the difference is 3.

    A integer X can be represented in decimal as:
    X=An×10n+An1×10n1++A2×102+A1×101+A0
    The odd dights are A1,A3,A5 and A0,A2,A4 are even digits.

    Hanamichi comes up with a solution, He notices that:
    102k+1 mod 11 = -1 (or 10), 102k mod 11 = 1,
    So X mod 11
    = (An×10n+An1×10n1++A2×102+A1×101+A0)mod11
    = An×(1)n+An1×(1)n1++A2A1+A0
    = sum_of_even_digits – sum_of_odd_digits
    So he claimed that the answer is the number of numbers X in the range which satisfy the function: X mod 11 = 3. He calculate the answer in this way :
    Answer = (r + 8) / 11 – (l – 1 + 8) / 11.

    Rukaw heard of Hanamichi’s solution from you and he proved there is something wrong with Hanamichi’s solution. So he decided to change the test data so that Hanamichi’s solution can not pass any single test. And he asks you to do that for him.
     
    Input
    You are given a integer T (1 ≤ T ≤ 100), which tells how many single tests the final test data has. And for the following T lines, each line contains two integers l and r, which are the original test data. (1 ≤ l ≤ r ≤ 1018)
     
    Output
    You are only allowed to change the value of r to a integer R which is not greater than the original r (and R ≥ l should be satisfied) and make Hanamichi’s solution fails this test data. If you can do that, output a single number each line, which is the smallest R you find. If not, just output -1 instead.
     
    Sample Input
    3 3 4 2 50 7 83
     
    Sample Output
    -1 -1 80
     

    Source


    题意:

    首先给出一个范围 [l, r],问是否能从中找到一个数证明 Hanamichi’s solution 的解法(对于某个数 X,偶数位的数字之和 -  奇数位的数字之和  = 3  并且 这个 X 满足 X mod 11 = 3 )是错的。

    也就是在范围里寻找是否存在不能同一时候满足:①偶数位的数字之和 -  奇数位的数字之和  = 3。 ②X mod 11 = 3。


    代码例如以下:

    #include <cstdio>
    typedef __int64 LL;
    
    bool Judge(LL tt)
    {
        LL sumo = 0, sume = 0;
        LL i = -1;
        while(tt)
        {
            i++;
            LL t = tt%10;
            if(i%2)
                sumo += t;
            else
                sume += t;
            tt /= 10;
        }
        if(sume - sumo == 3)
            return true;
        return false;
    }
    int main()
    {
        int T;
        LL l, r;
        LL i, j;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%I64d%I64d",&l,&r);
            for(i = l; ; i++)
            {
                if(i%11 == 3)
                    break;
            }
            for(j = i; j <= r; j+=11)
            {
                if(!Judge(j))
                    break;
            }
            if(j > r)
                printf("-1
    ");
            else
                printf("%I64d
    ",j);
        }
        return 0;
    }
    


  • 相关阅读:
    supervisord 小记
    linux 查找文件与进程常用命令
    旷世奇坑!!!spring 不能自动注入
    RPM方式安装MySQL5.6
    linux 常见问题&解决方案
    linux下的守护进程
    java 读写properties
    良好的编码规范
    良好的日志记录规范
    两种方式实现适配器
  • 原文地址:https://www.cnblogs.com/jzssuanfa/p/6755337.html
Copyright © 2011-2022 走看看