bobo

Higher h-index+CCPC2018-湖南全国邀请赛

匿名 (未验证) 提交于 2019-12-03 00:22:01
当(n+a)/2为偶数时,此数最小 Higher h -index Problem Description The h -index of an author is the largest h where he has at least h papers with citations not less than h . Bobo has no papers and he is going to publish some subsequently. If he works on a paper for x hours, the paper will get ( a x ) citations, where a is a known constant. It's clear that x should be a positive integer. There is also a trick -- one can cite his own papers published earlier. Given Bobo has n working hours, find the maximum h -index of him. Input The input consists of several test cases and is terminated by end-of-file. Each