uva 11181 Probability|Given

来源：互联网发布：cg绘画软件编辑：程序博客网时间：2024/04/30 22:06

递归边界没处理好，切记，。

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