zoukankan      html  css  js  c++  java
  • HDUOJ 1099——Lottery

    Lottery

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

    Problem Description
    Eddy's company publishes a kind of lottery.This set of lottery which are numbered 1 to n, and a set of one of each is required for a prize .With one number per lottery, how many lottery on average are required to make a complete set of n coupons?
     
    Input
    Input consists of a sequence of lines each containing a single positive integer n, 1<=n<=22, giving the size of the set of coupons.
     
    Output
    For each input line, output the average number of lottery required to collect the complete set of n coupons. If the answer is an integer number, output the number. If the answer is not integer, then output the integer part of the answer followed by a space and then by the proper fraction in the format shown below. The fractional part should be irreducible. There should be no trailing spaces in any line of ouput.
     
    Sample Input
    2 5 17
     
    Sample Output
    3 5 11 -- 12 340463 58 ------ 720720
     
    Author
    eddy
     
    Recommend
    JGShining
     


    sum=n*∑(1/i);----->n*(1+1/2+1/3+.....+1/n);

    题意不好懂.....表示看来白天没明白....之后看了别人的讲的题意才懂的.....

    之后的就不难了!

    代码:

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<cstdlib>
     5 using namespace std;
     6 int gcd(_int64 a,_int64 b)
     7 {
     8     if(b==0)
     9         return a;
    10     gcd(b,a%b);
    11 };
    12 
    13 void swap(_int64 *a,_int64 *b)
    14 {
    15     *a^=*b,
    16     *b^=*a,
    17     *a^=*b;
    18 }
    19 int main()
    20 {
    21     int n,i;
    22     char str[20]={''},num[20]={''};
    23     _int64 a,b,c,real;
    24     while(scanf("%d",&n)!=EOF)
    25     {    
    26         a=b=1;
    27         for(i=2;i<=n;i++)
    28         {
    29             a=a*i+b;
    30             b*=i;
    31          if(a<b) swap(a,b);
    32            c=gcd(a,b);
    33            a/=c;
    34            b/=c;
    35         }
    36     if((n*a)%b)
    37     {
    38        real=(a/b)*n;
    39           a%=b;
    40           a*=n;
    41         real+=a/b;
    42            a%=b;
    43          c=gcd(a,b);
    44           a/=c;
    45           b/=c;
    46     itoa(b,str,10); 
    47     itoa(real,num,10);
    48     for(i=0;i<=strlen(num);i++)
    49         printf(" ");
    50         printf("%I64d
    %I64d ",a,real);
    51     for(i=0;i<strlen(str);i++)
    52         printf("-");
    53         puts("");
    54     for(i=0;i<=strlen(num);i++)
    55         printf(" ");
    56         printf("%I64d
    ",b);
    57     }
    58     else
    59         printf("%I64d
    ",n*a/b);
    60     }
    61     return 0;
    62 }
    View Code
  • 相关阅读:
    【剑指offer】不使用新变量,交换两个变量的值,C++实现
    【剑指offer】不用加减乘除做加法,C++实现
    【剑指offer】求1+2+…+n,C++实现
    【剑指offer】左旋转字符串,C+实现
    给记事本添加接口,并通过菜单来执行自定义的功能
    修改PE文件的入口函数OEP
    360搜集隐私程序员级分析,供方舟子及大众参考
    Android窃取用户信息新思路
    如何整治那些敢偷用你Wi-Fi的人
    保护WIFI无线网络的安全
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3300463.html
Copyright © 2011-2022 走看看