#include <iostream>
using namespace std;
int main()
{
int Lu[80];
int Yi;
int i = 0;
int product = 1;
while (cin >> Yi)
{
while (i < Yi)
{
cin >> Lu[i];
if (Lu[i]%2 != 0)
product *= Lu[i];
i++;
}
cout << product << endl;
i = 0;
product = 1;
}
return 0;
}
HDU ACM 11 2006 奇数求积
最新推荐文章于 2018-10-19 10:49:52 发布