zoukankan      html  css  js  c++  java
  • Codeforces 448 D. Multiplication Table


    二分法判断答案


    D. Multiplication Table
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Bizon the Champion isn't just charming, he also is very smart.

    While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted ann × m multiplication table, where the element on the intersection of the i-th row and j-th column equals i·j (the rows and columns of the table are numbered starting from 1). Then he was asked: what number in the table is the k-th largest number?

    Bizon the Champion always answered correctly and immediately. Can you repeat his success?

    Consider the given multiplication table. If you write out all n·m numbers from the table in the non-decreasing order, then the k-th number you write out is called the k-th largest number.

    Input

    The single line contains integers nm and k (1 ≤ n, m ≤ 5·105; 1 ≤ k ≤ n·m).

    Output

    Print the k-th largest number in a n × m multiplication table.

    Sample test(s)
    input
    2 2 2
    
    output
    2
    
    input
    2 3 4
    
    output
    3
    
    input
    1 10 5
    
    output
    5
    
    Note

    2 × 3 multiplication table looks like this:

    1 2 3
    2 4 6


    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <map>
    
    using namespace std;
    
    typedef long long int LL;
    
    LL n,m,k;
    
    bool ck(LL x)
    {
        LL nt=0;
        for(LL i=1;i<=n;i++)
        {
            nt+=min(m,x/i);
        }
        if(nt>=k) return true;
        return false;
    }
    
    int main()
    {
        scanf("%I64d%I64d%I64d",&n,&m,&k);
    
        LL low=1,high=n*m,ans=-1,mid;
        while(low<=high)
        {
            mid=(low+high)/2;
            if(ck(mid))
            {
                ans=mid; high=mid-1;
            }
            else low=mid+1;
        }
        printf("%I64d
    ",ans);
    
        return 0;
    }
    


    版权声明:来自: 代码代码猿猿AC路 http://blog.csdn.net/ck_boss

  • 相关阅读:
    java笔记之日期相关操作
    Android笔记之察看网络状况
    Jsp之复选框的使用
    jsp之table美化
    JSP与servlet之间跳转传值
    request的get/setParameter和get/setAttribute()
    Jsp的button按钮
    使用request.getRequestDispatcher请求转发到一个页面中文乱码解决 【转】
    Servle与JSP之间的相互跳转
    java笔记之null与isEmpty()
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/4854203.html
Copyright © 2011-2022 走看看