2006. Finding the product of odd numbers

#include <stdio.h>

int main () {

int n,a[10],i,sum=1;

scanf ("%d", &n);

for (i=0;i<n;i++)

scanf ("%d", &a[i]);

for (i=0;i<n;i++) {

if (a[i]%2!=0)

Sum*=a[i];}

printf ("%d", sum);

return 0;

}

problem Descriptiongive you n integers and ask for the product of all the odd numbers in them.

Input data contains multiple test instances, one row per test instance, and N for each row, indicating that there is a total of n for this group of data, followed by n integers, you can assume that each set of data must have at least one odd number.

Output outputs the product of all the odd numbers in each set, and one row for the test instance.

Sample INPUT3 1 2 3 4 2 3 4 5

Sample OUTPUT3 15

2006. The product of odd numbers