UVA 10277 Boastin' Red Socks

题意：已知p/q是连续取的两次红袜子的概率，因为p/q=a/b(a-1)/(b-1)，枚举，排除是double型时的可能就可以了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;long  gcd(long long a,long long b){return b==0?a:gcd(b,a%b);
}int main(){long long p,q,i;while (scanf("%lld%lld",&p,&q) != EOF && p+q){if (p == 0){printf("0 2\n");continue;}long long d = gcd(p,q);p /= d;q /= d;for (i = 2; i <= 50000; i++){if (i*(i-1) % q == 0){long long t = i*(i-1) / q;long long s = (long long)sqrt((double)t*p);if (s*(s+1) == t*p){printf("%lld %lld\n",s+1,i-s-1);break;}}}if (i > 50000)printf("impossible\n");}return 0;
}

UVA 10277 Boastin' Red Socks相关推荐

10277 - Boastin' Red Socks
描述:红黑袜子,给出的是红袜子被选到的概率,即为p/q,要计算的是在挑选出一对红袜子之前的红袜子和黑袜子的数目,假设红袜子数为n,黑袜子数为m,那么n(n-1)/(m(m-1))=p/q,求出红袜子数 ...
提取了下刘汝佳推荐的题号...
今天闲来没事上uva oj提取了下刘汝佳推荐的acm题号,原始数据如下: Volume 0. Getting Started 10055 - Hashmat the Brave Warrior ...
HOJ题目分类//放这儿没事刷刷学算法！嘻嘻！
各种杂题,水题,模拟,包括简单数论. 1001 A+B 1002 A+B+C 1009 Fat Cat 1010 The Angle 1011 Unix ls 1012 Decoding Task 1 ...
HOJ 题目分类 by wywcgs
简单题(包含模拟.数论中最基础的题):1001 A+B1002 A+B+C1004 Prime Palindromes1010 The Angle1011 UNIX ls1012 Decoding T ...
量子叠加态和量子纠缠_从无到有的量子隐形传态。第2部分-在真实设备上进行操作...
量子叠加态和量子纠缠 With the theory done, we can now teleport a real qubit on a real device! 理论完成后,我们现在可以在真实设 ...
uva 725 Division（暴力模拟）
Division 紫书入门级别的暴力,可我还是写了好长时间 = = [题目链接]uva 725 [题目类型]化简暴力 &题解: 首先要看懂题意,他的意思也就是0~9都只出现一遍,在这2个5位数 ...
Gym - 101291I Mismatched Socks(贪心)
题目: Fred likes to wear mismatched socks. This sometimes means he has to plan ahead. Suppose his sock ...
[搜索]UVa 129 困难的串
题意:将一个包含两个相邻的重复子串的子串,称为"容易的串",其他为"困难的串". 输入正整数n和l,输出由前l个字符组成的,字典序第n小的困难的串. 输入样例: ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...

UVA 10277 Boastin' Red Socks

UVA 10277 Boastin' Red Socks相关推荐

最新文章

热门文章