2019百度之星初赛一1001Polynomial（数学的函数收敛）

素颜马尾好姑娘i 2023-08-17 15:41 7阅读 0赞

# Polynomial #

题目链接：[http://acm.hdu.edu.cn/showproblem.php?pid=6668][http_acm.hdu.edu.cn_showproblem.php_pid_6668]

题目：

![1705372-20190817230638950-116285181.png][]

![1705372-20190817230659668-1869802945.png][]

思路：模拟即可，因为若分子最高次幂小于分母最高次幂，极限为无穷的也就是不存在收敛，输出“1/0”；分母最高次等于分子最高次，为a/b，就是常数项最简比；分子最高次大于分母最高次，为0.，输出“0/1即可”

// 
    // Created by HJYL on 2019/8/17.
    //
    #include <iostream>
    #include <vector>
    #include <map>
    #include <string>
    #include <queue>
    #include <stack>
    #include <set>
    #include <algorithm>
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    #include <cstdlib>
    #include<math.h>
    using namespace std;
    typedef long long ll;
    const int maxn=1e6+10;
    int gcd(int a,int b){
         return b?gcd(b,a%b):a;}
    int main()
    {
        //freopen("C:\\Users\\asus567767\\CLionProjects\\untitled\\text","r",stdin);
        int T,n;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d",&n);
            int a[maxn],b[maxn];
            for(int i=0;i<n;i++)
                scanf("%d",&a[i]);
            for(int i=0;i<n;i++)
                scanf("%d",&b[i]);
           for(int i=n-1;i>=0;i--)
           {
               if(a[i]==0&&b[i]==0)
                   continue;
               else
               {
                   if(b[i]==0&&a[i]!=0)
                   {
                       printf("1/0\n");
                       break;
                   }
                   else if(b[i]!=0&&a[i]==0)
                   {
                       printf("0/1\n");
                       break;
                   }
                   else if(a[i]!=0&&b[i]!=0)
                   {
                       int aa=gcd(a[i],b[i]);
                       int bb=a[i]/aa;
                       int cc=b[i]/aa;
                       printf("%d/%d\n",bb,cc);
                       break;
                   }
               }
           }
        }
        return 0;
    }

转载于:https://www.cnblogs.com/Vampire6/p/11370857.html

[http_acm.hdu.edu.cn_showproblem.php_pid_6668]: http://acm.hdu.edu.cn/showproblem.php?pid=6668
[1705372-20190817230638950-116285181.png]: /images/20230810/cb13a129602648f2be8120f44eca7a76.png
[1705372-20190817230659668-1869802945.png]: /images/20230810/b14fed76127547f5a9779ae8bd62c8eb.png