zoukankan      html  css  js  c++  java
  • Gym

    B. New Job

     

    This is the first day for you at your new job and your boss asks you to copy some files from one computer to other computers in an informatics laboratory. He wants you to finish this task as fast as possible. You can copy the files from one computer to another using only one Ethernet cable. Bear in mind that any File-copying process takes one hour, and you can do more than one copying process at a time as long as you have enough cables. But you can connect any computer to one computer only at the same time. At the beginning, the files are on one computer (other than the computers you want to copy them to) and you want to copy files to all computers using a limited number of cables.

    Input

    First line of the input file contains an integer T (1  ≤  T  ≤  100) which denotes number of test cases. Each line in the next T lines represents one test case and contains two integers N, M.

    N is the number of computers you want to copy files to them (1  ≤  N  ≤  1,000,000,000). While M is the number of cables you can use in the copying process (1  ≤  M  ≤  1,000,000,000).

    Output

    For each test case, print one line contains one integer referring to the minimum hours you need to finish copying process to all computers.

    Examples
    input
    3
    10 10
    7 2
    5 3
    output
    4
    4
    3
    Note

    In the first test case there are 10 computer and 10 cables. The answer is 4 because in the first hour you can copy files only to 1 computer, while in the second hour you can copy files to 2 computers. In the third hour you can copy files to 4 computers and you need the fourth hour to copy files to the remaining 3 computers.

    模拟一下,一直复制cnt*2,当cnt>m时,一直复制m。

     1 #include <iostream>
     2 #include <stdio.h>
     3 #include <string.h>
     4 #include <cmath>
     5 #include <algorithm>
     6 #define ll long long
     7 using namespace std;
     8 
     9 int main(){
    10     int t;
    11     ll n,m;
    12     //cout << (4.1) << endl;
    13     cin>>t;
    14     while(t--){
    15         cin>>n>>m;
    16         ll ans = 0;
    17         ll cnt = 1,sum = 0;
    18         while(cnt <= m && sum < n){
    19             ans++;
    20             sum = sum + cnt;
    21             cnt = cnt*2;
    22         }
    23         if(sum >= n){
    24             cout << ans << endl;
    25             continue;
    26         }
    27         if(cnt > m){
    28             cnt = m;
    29             ll sh = n-sum;
    30             ans = ans + sh/cnt;
    31             if(sh%cnt!=0)ans++;
    32             cout << ans << endl;
    33         }
    34     }
    35     return 0;
    36 }
  • 相关阅读:
    基于opencv网络摄像头在ubuntu下的视频获取
    VHDL学习札记:library and Package
    HLS入门收集(1)
    Windows下zlib库和libPng库的编译和使用
    FPGA培训体会 江苏大学 自动化 许一航
    FPGA学习体会
    FPGA培训体会
    2016年上海V3学院寒假班FPGA/SOC培训收获
    上海V3学院FPGA培训感想 ——重庆理工大学叶钧
    上海招聘FPGA讲师(专兼职均可)
  • 原文地址:https://www.cnblogs.com/xingkongyihao/p/7197261.html
Copyright © 2011-2022 走看看