zoukankan      html  css  js  c++  java
  • hdu 5587 Array 数学题

    Array

    Time Limit: 20 Sec

    Memory Limit: 256 MB

    题目连接

    http://acm.hdu.edu.cn/showproblem.php?pid=5587

    Description

    Vicky is a magician who loves math. She has great power in copying and creating.
    One day she gets an array {1}。 After that, every day she copies all the numbers in the arrays she has, and puts them into the tail of the array, with a signle '0' to separat.
    Vicky wants to make difference. So every number which is made today (include the 0) will be plused by one.
    Vicky wonders after 100 days, what is the sum of the first M numbers.

    Input

    There are multiple test cases.
    First line contains a single integer T, means the number of test cases.(1T2103)
    Next T line contains, each line contains one interger M. (1M1016)

    Output

    For each test case,output the answer in a line.

    Sample Input

    3 1 3 5

    Sample Output

    1 4 7

    HINT

    题意

    题解:

    数学题(:

    首先我们先用找规律算出第i天一共能得到的和是多少:g(i)=g(i-1)+2^(i-1)

    然后我们就可以递归求解了,不断地利用2的幂来进行递归

    代码:

    #include<iostream>
    #include<stdio.h>
    #include<vector>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    
    vector<long long>Q;
    long long ans = 0;
    long long g[230];
    void solve(long long k)
    {
        if(k<=0)return;
        int p = --upper_bound(Q.begin(),Q.end(),k)-Q.begin();
        ans+=g[p]+k-Q[p];
        solve(k-Q[p]-1);
    }
    int main()
    {
    
        long long T=2;
        Q.push_back(0);
        for(int i=1;i<=59;i++)
        {
            Q.push_back(T-1);//2^i-1
            T*=2;
        }
        g[1]=1;long long tmp=2;
        for(int i=2;i<=Q.size();i++)
        {
            g[i]=2*g[i-1]+tmp;//存的是第i天的答案
            tmp=tmp*2;
        }
        int t;scanf("%d",&t);
        for(int i=1;i<=t;i++)
        {
            long long x;scanf("%I64d",&x);
            ans = 0;
            solve(x);
            printf("%I64d
    ",ans);
        }
    }
  • 相关阅读:
    5Hibernate入门----青软S2SH(笔记)
    5Hibernate配置及使用方法----青软S2SH(笔记)
    4Struts2标签库----青软S2SH(笔记)
    3Struts2进阶----青软S2SH(笔记)
    Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) M
    Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) A
    Codeforces Round #418 (Div. 2) D
    Codeforces Round #418 (Div. 2) C
    Codeforces Round #418 (Div. 2) B
    Codeforces Round #418 (Div. 2) A
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5005369.html
Copyright © 2011-2022 走看看