zoukankan      html  css  js  c++  java
  • ZOJ 3498 Javabeans

    Javabeans
    Time Limit: 2 Seconds Memory Limit: 65536 KB
    Javabeans are delicious. Javaman likes to eat javabeans very much.

    Javaman has n boxes of javabeans. There are exactly i javabeans in the i-th box (i = 1, 2, 3,…n). Everyday Javaman chooses an integer x. He also chooses several boxes where the numbers of javabeans are all at least x. Then he eats x javabeans in each box he has just chosen. Javaman wants to eat all the javabeans up as soon as possible. So how many days it costs for him to eat all the javabeans?

    Input

    There are multiple test cases. The first line of input is an integer T ≈ 100 indicating the number of test cases.

    Each test case is a line of a positive integer 0 < n < 231.

    Output

    For each test case output the result in a single line.

    Sample Input

    4
    1
    2
    3
    4
    Sample Output

    1
    2
    2
    3

    找规律

    #include<cstdio>
    #include<cmath>
    #include<cstring>
    #include<iostream>
    using namespace std;
    
    int main(){
        int n;
        int flag;
        long long int a[40];
        a[0]=1;
        for(int i=1;i<32;i++){
            a[i]=a[i-1]*2;
        }
        scanf("%d",&n);
        while(n--){
            long long int t;
            scanf("%lld",&t);
            for(int i=1;i<32;i++){
                if(t>=a[i-1]&&t<a[i]){
                    printf("%d
    ",i);
                    break;
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    SQL SERVER 2005添加用户和编辑sa
    数组型参数和数组的区别
    Oracle数据库建库、建表空间,建用户
    oracle表空间操作详解
    Oracle10g的完全卸载(转载)
    Delphi format的用法
    AnImateWindow用法
    文本文件操作
    TStringList的用法
    Delphi网络函数
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228696.html
Copyright © 2011-2022 走看看