А на PascalABC.NET вот так:
begin
var a := ReadArrReal(15);
Abs(a[a.FindIndex(p-> p > 0)+1:].Product).Println
end.
#include <iostream>
typedef long long ll;
using namespace std;
bool ll_is_valid(ll t, ll N, ll x, ll y)
{
return t / x + (t - x) / y >= N;
}
ll f(ll N, ll x, ll y)
{
ll R = 1;
while (!ll_is_valid(R,N,x,y)) R *= 2;
ll L = R / 2;
while(R - L > 1)
{
ll M = (L + R) / 2;
if (!ll_is_valid(M,N,x,y)) {L = M;}
else {R = M;}
}
return R;
}
int main()
{
ll N,x,y;
cin >> N >> x >> y;
if(x > y) swap( x, y );
cout << f(N, x, y) << std::endl;
}
На питоне так:
Объяснение:
using math
mass = []
for i in range(15):
mass.append(int(input()) #Вводим массив
#Сама программа:
res = 1
was = False
for i in range(15):
if not was and mass[i] > 0:
was = True
if was:
res *= mass[i]
print(res)