解法:
分别维护分子分母就可以了,对结果取互质
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define endl '\n'
int gcd(int a, int b) {
if (b == 0) return a;
else {
return gcd(b, a % b);
}
}
int main() {
int n; cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec[i];
if (n == 1) {
cout << vec[0] << " " << 1;
return 0;
}
int fenzi = 1, fenmu = vec[n - 1];
for (int i = n - 2; ~i; i--) {
fenzi += vec[i] * fenmu;
if (i > 0) {
swap(fenzi, fenmu);
}
}
int a = gcd(fenzi, fenmu);
cout << fenzi / a << " " << fenmu / a;
return 0;
}
解法二:
感谢dalao的分享
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,sum,t=1,x,a[1001],b[1001],c[1001];
signed main()
{
ios::sync_with_stdio(false),
cin.tie(0),cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
cin>>c[i];
for(int i=1;i<=n;i++)
a[i]=c[n-i+1];
b[0]=1;
b[1]=a[1];
for(int i=2;i<=n;i++)
{
b[i]=b[i-1]*a[i]+b[i-2];
}
cout<<b[n]<<" "<<b[n-1];
}