zoukankan      html  css  js  c++  java
  • Buy the Ticket

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 4981    Accepted Submission(s): 2085


    Problem Description
    The "Harry Potter and the Goblet of Fire" will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight, won’t you?

    Suppose the cinema only has one ticket-office and the price for per-ticket is 50 dollars. The queue for buying the tickets is consisted of m + n persons (m persons each only has the 50-dollar bill and n persons each only has the 100-dollar bill).

    Now the problem for you is to calculate the number of different ways of the queue that the buying process won't be stopped from the first person till the last person. 
    Note: initially the ticket-office has no money. 

    The buying process will be stopped on the occasion that the ticket-office has no 50-dollar bill but the first person of the queue only has the 100-dollar bill.
     
    Input
    The input file contains several test cases. Each test case is made up of two integer numbers: m and n. It is terminated by m = n = 0. Otherwise, m, n <=100.
     
    Output
    For each test case, first print the test number (counting from 1) in one line, then output the number of different ways in another line.
     
    Sample Input
    3 0 3 1 3 3 0 0
     
    Sample Output
    Test #1: 6 Test #2: 18 Test #3: 180
     
    Author
    #include<cstdio>
    #include<cstring>
    int a[390];
    int n,m,leap;
    void bfact(int n)
    {
        int i,j;
        for(i=2; i<=n; i++)
        {
            if(leap&&i==m+1) continue;
            int c=0,s;
            for(j=0; j<380; j++)
            {
                s=i*a[j]+c;
                a[j]=s%10;
                c=s/10;
            }
        }
    
    }
    
    void bx(int n)
    {
        int j;
        int s,c=0;
        for(j=0; j<380; j++)
        {
            s=n*a[j]+c;
            a[j]=s%10;
            c=s/10;
        }
    
    }
    int main()
    {
        //freopen("case.in","r",stdin);
        int i,j,c=1;
        while(scanf("%d%d",&m,&n)!=-1)
        {
            if(!m&&!n) break;
            leap=0;
            memset(a,0,sizeof(a));
            a[0]=1;
            printf("Test #%d:
    ",c);
            if(m<n)
            {
                printf("0
    ");
                c++;
                continue;
            }
            if((m-n+1)%(m+1)==0)
                bx((m-n+1)/(m+1));
            else
            {
                bx(m-n+1);
                leap=1;
            }
            bfact(n+m);
            for(i=380; i>=0; i--)
                if(a[i]) break;
            for(j=i; j>=0; j--)
                printf("%d",a[j]);
            printf("
    ");
            c++;
        }
    }
    //从网上找到了公式  即:结果等于 (m+n)!*(m-n+1)/(m+1)
    //那么这题就是高精度问题了
    

      

  • 相关阅读:
    一文带你看清HTTP所有概念
    程序员不得不了解的硬核知识大全
    看完这篇HTTP,跟面试官扯皮就没问题了
    ReentrantLock 源码分析从入门到入土
    计算机网络的核心概念
    Kafka 的这些原理你知道吗
    2019 我是怎么熬过来的?
    不懂什么是锁?看看这篇你就明白了
    机器学习——方差、协方差与皮尔逊值
    最小生成树的本质是什么?Prim算法道破天机
  • 原文地址:https://www.cnblogs.com/orchidzjl/p/4314408.html
Copyright © 2011-2022 走看看