Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //используя рекурсию, найти n-ный член и сумму геометрической прогрессии, если известны её первый член и делитель
- #include <iostream>
- using namespace std;
- double num(double first, double q, int n)
- {
- if (n == 1)
- return first;
- else
- return num(first, q, n - 1)*q;
- }
- double sum(double first, double q, int n)
- {
- if (n == 1)
- return first;
- else
- return sum(first, q, n - 1) + num(first, q, n);
- }
- int main()
- {
- double first, q;
- cin >> first >> q;
- int n;
- cin >> n;
- cout << num(first, q, n) << " " << sum(first, q, n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement