二分三分
文章平均质量分 72
Twillz
这个作者很懒,什么都没留下…
展开
-
Can you solve the equation?(二分求方程解)
Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; Now please try your lucky. Input The first line of the input contains an integer T(1<=T<=100原创 2017-07-12 23:22:57 · 663 阅读 · 0 评论 -
The Meeting Place Can Not Be Changed(二分)
The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.At some points on the road the原创 2017-07-13 11:39:09 · 314 阅读 · 0 评论 -
Median (Binery Search)
Given N numbers, X1, X2, … , XN, let us calculate the difference of every pair of numbers: ∣Xi - Xj∣ (1 ≤ i < j ≤ N). We can get C(N,2) differences through this work, and now your task is to find the m原创 2017-07-13 13:31:12 · 378 阅读 · 0 评论 -
NPY and shot (三分求峰值)
NPY is going to have a PE test.One of the test subjects is throwing the shot.The height of NPY is H meters.He can throw the shot at the speed of v0 m/s and at the height of exactly H meters.He wonders原创 2017-07-13 13:43:00 · 441 阅读 · 0 评论 -
Cable Master(二分)
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to co原创 2017-07-14 22:04:45 · 389 阅读 · 0 评论 -
POJ 3111 K Best(二分——最大化平均值)
K Best Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 10457 Accepted: 2695 Case Time Limit: 2000MS Special Judge DescriptionDemy has n jewels. Each of her jewels has som原创 2017-07-16 10:18:30 · 328 阅读 · 0 评论 -
POJ 3258(二分——最大化最小值)
River Hopscotch Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14284 Accepted: 6059 DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch tha原创 2017-07-16 20:16:04 · 331 阅读 · 0 评论 -
POJ 3258(二分——最大化最小值)
River Hopscotch Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14284 Accepted: 6059 DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch tha原创 2017-07-16 20:16:54 · 242 阅读 · 0 评论 -
POJ 2318 Toys(判断点在直线的方向)
TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16656 Accepted: 7994 DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad原创 2017-11-18 20:26:55 · 298 阅读 · 0 评论