bzoj1684 [Usaco2005 Oct]Close Encounter
2014-07-25 22:45
281 查看
Description
Lacking even a fifth grade education, the cows are having trouble with a fraction problem from their textbook. Please help them. The problem is simple: Given a properly reduced fraction (i.e., the greatestcommon divisor of the numerator and denominator is 1, so the fraction cannot be further reduced) find the smallest properly reduced fraction with numerator and denominator in the range 1..32,767 that is closest (but not equal) to the given fraction. 找一个分数它最接近给出一个分数.
你要找的分数的值的范围在1..32767
Input
* Line 1: Two positive space-separated integers N and D (1 <= N < D <= 32,767), respectively the numerator and denominator of the given fractionOutput
* Line 1: Two space-separated integers, respectively the numerator and denominator of the smallest, closest fraction different from the input fraction.Sample Input
2 3Sample Output
21845 32767OUTPUT DETAILS:
21845/32767 = .666676839503.... ~ 0.666666.... = 2/3.
题意是给定一个分数a/b,求和它最接近的分数x/y。只要限制1<=x,y<=32767就行了
我们从1到32767枚举分母j,然后显然和a/b最相近的分数一定是i/j和(i+1)/j。至于怎么算自己脑补一下就行,很简单
有一个问题是判定i/j和a/b是否完全相等,如果怕被卡精度可以直接判定(i*b==j*a)是否成立就行了。这也很简单,就是移项一下
然后没有了
#include<cstdio> #include<cmath> int a,b,i,aa,bb; double save=10; inline double abs(double x) {if (x<0)x=-x;return x;} void jud(int x,int y) { if (x*b==y*a) return; double work=abs((double)x/y-(double)a/b); if (work<save) { save=work; aa=x; bb=y; } } int main() { scanf("%d%d",&a,&b); for (int j=1;j<=32767;j++) { i=(int)floor((double)a/b*j); jud(i,j); jud(i+1,j); } printf("%d %d\n",aa,bb); }
相关文章推荐
- 【BZOJ】1684: [Usaco2005 Oct]Close Encounter(暴力+c++)
- bzoj1684 [Usaco2005 Oct]Close Encounter
- [bzoj1684][Usaco2005 Oct]Close Encounter
- bzoj 1684: [Usaco2005 Oct]Close Encounter
- bzoj 1684: [Usaco2005 Oct]Close Encounter【数学(?)】
- 1684: [Usaco2005 Oct]Close Encounter
- 1684: [Usaco2005 Oct]Close Encounter
- bzoj:1685 [Usaco2005 Oct]Allowance 津贴
- bzoj1744 [Usaco2005 oct]Skiing 奶牛滑雪
- bzoj 1685: [Usaco2005 Oct]Allowance 津贴(贪心)
- BZOJ 1685/Luogu 2376: [Usaco2005 Oct]Allowance 津贴
- 【BZOJ】1685: [Usaco2005 Oct]Allowance 津贴(贪心)
- bzoj1708[Usaco2007 Oct]Money奶牛的硬币
- bzoj1676[Usaco2005 Feb]Feed Accounting 饲料计算
- 【BZOJ1742】[Usaco2005 nov]Grazing on the Run 边跑边吃草【区间DP】
- bzoj:1681 [Usaco2005 Mar]Checking an Alibi 不在场的证明
- BZOJ 1708: [Usaco2007 Oct]Money奶牛的硬币( dp )
- BZOJ 1600: [Usaco2008 Oct]建造栅栏( dp )
- Bzoj 1729 [Usaco2005 dec] Cow Patterns 牛的模式匹配
- Bzoj 3409: [Usaco2009 Oct]Barn Echoes 牛棚回声