题意:第一行给出两个数字m,n,每个数字代表两个表达式的最高次项,接下来两行数据分别有表示从x^n-x^0的系数,求当x趋向于正无穷时,这两个表达式比值的极限。
链接:http://codeforces.com/problemset/problem/197/B
思路:判断这两个表达式的最高次项是否相同,若分子的最高次小于分母的最高次,结果趋向于0;若分子的最高次大于分母的最高次,当两式的最高次系数同号时,结果趋向于Inf,异号时趋向于-Inf;若分子分母的最高次项相同时结果趋向于两者最高次项系数的比值。
注意点:分子分母最高次项系数比值输出最简比
以下为AC代码:
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged |
---|---|---|---|---|---|---|---|---|
9722492 | Practice: luminous11 | 197B - 40 | GNU C++11 | Accepted | 62 ms | 4 KB | 2015-02-05 03:42:24 | 2015-02-05 03:42:25 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
int main()
{
ios::sync_with_stdio( false );
int m, n;
int a[106];
int b[106];
while ( cin >> m >> n ){
int cnt1 = 0;
int cnt2 = 0;
for ( int i = 0; i <= m; i ++ ){
cin >> a[i];
if ( a[i] < 0 )cnt1 ++;
}
for ( int i = 0; i <= n; i ++ ){
cin >> b[i];
if ( b[i] < 0 )cnt2 ++;
}
if ( m > n ){
if ( a[0] * b[0] > 0 ){
cout << "Infinity" << endl;
}
else{
cout << "-Infinity" << endl;
}
continue;
}
if ( m < n ){
cout << "0/1" << endl;
continue;
}
if ( m == n ){
if ( a[0] * b[0] > 0 ){
a[0] = abs( a[0] );
b[0] = abs( b[0] );
int tmp = __gcd( a[0], b[0] );
cout << a[0] / tmp << '/' << b[0] / tmp << endl;
}
else{
a[0] = abs ( a[0] );
b[0] = abs ( b[0] );
int tmp = __gcd( a[0], b[0] );
cout << '-' << a[0] / tmp << '/' << b[0] / tmp << endl;
}
}
}
return 0;
}