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

  • 相关阅读:
    程序员这口饭职业规划解决方案
    Entity Framework 学习初级篇Entity SQL
    工厂方法模式与IoC/DI 4
    为NUnit制作Visual Studio模板
    Enterprise Architect 7.5(UML工具)集成到Visual Studio中(有下载)
    从事ASP.NET开发两年多,谈谈对两三年工作经验的ASP.NET程序员的基本见解
    模式讲解
    一位软件工程师的7年总结 [转]
    工厂方法模式2
    CodeDom系列1
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/4854203.html
Copyright © 2011-2022 走看看